pon encountering an ordering which vio-lates the hard constraints, Snowcap uses this counter-example toidentify the (minimal) ordering constraint (which we call dependen-cies). Snowcap then restarts its exploration taking these constraintsinto account, effectively pruning the search space in a divide-and-conquer fashion.