If an opposite constraint is found that does not satisfy the bound,
then no opposite constraint satisfying the bound will be found
as otherwise the constraint found first would have been removed already.
Signed-off-by: Sven Verdoolaege <sven@cerebras.net>
@@ -2366,6 +2366,7 @@ static isl_size find_later_constraint_in_pair(__isl_keep isl_basic_map *bmap,
continue;
if (constraint_pair_has_bound(bmap, ineq, j, bound, tmp))
return j;
+ return n_ineq;
}
return n_ineq;