We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents d8b25f3 + 987d384 commit 1d9eaceCopy full SHA for 1d9eace
src/solvers/flattening/arrays.cpp
@@ -316,7 +316,7 @@ void arrayst::add_array_Ackermann_constraints()
316
i1!=index_set.end();
317
i1++)
318
for(index_sett::const_iterator
319
- i2=index_set.begin();
+ i2=i1;
320
i2!=index_set.end();
321
i2++)
322
if(i1!=i2)
@@ -348,7 +348,7 @@ void arrayst::add_array_Ackermann_constraints()
348
349
// add constraint
350
lazy_constraintt lazy(lazy_typet::ARRAY_ACKERMANN,
351
- or_exprt(literal_exprt(!indices_equal_lit), values_equal));
+ implies_exprt(literal_exprt(indices_equal_lit), values_equal));
352
add_array_constraint(lazy, true); // added lazily
353
354
#if 0 // old code for adding, not significantly faster
0 commit comments