int
main ()
{
int sat_result;
BtorExp *array, *index1, *index2, *read1, *read2, *eq, *ne;
Btor *btor;
btor = boolector_new ();
boolector_enable_inc_usage (btor);
array =
boolector_array (btor, ARRAY3_EXAMPLE_VALUE_BW, ARRAY3_EXAMPLE_INDEX_BW,
NULL);
index1 = boolector_var (btor, ARRAY3_EXAMPLE_INDEX_BW, NULL);
index2 = boolector_var (btor, ARRAY3_EXAMPLE_INDEX_BW, NULL);
read1 = boolector_read (btor, array, index1);
read2 = boolector_read (btor, array, index2);
eq = boolector_eq (btor, index1, index2);
ne = boolector_ne (btor, read1, read2);
/* we enforce that index1 is equal to index 2 */
boolector_assert (btor, eq);
sat_result = boolector_sat (btor);
assert (sat_result == BOOLECTOR_SAT);
/* now we additionally assume that the read values differ
* the instance is now unsatasfiable as read congruence is violated */
boolector_assume (btor, ne);
sat_result = boolector_sat (btor);
assert (sat_result == BOOLECTOR_UNSAT);
/* after the SAT call the assumptions are gone
* the instance is now satisfiable again */
sat_result = boolector_sat (btor);
assert (sat_result == BOOLECTOR_SAT);
boolector_release (btor, array);
boolector_release (btor, index1);
boolector_release (btor, index2);
boolector_release (btor, read1);
boolector_release (btor, read2);
boolector_release (btor, eq);
boolector_release (btor, ne);
boolector_delete (btor);
return 0;
}
const bool
V3SvrBoolector::assump_solve() {
for (uint32_t i = 0; i < _assump.size(); ++i) boolector_assume(_Solver, _assump[i]);
bool result = solve(); return result;
}
bool addTempConstraint(SOLVER_EXPR_TYPE expr) {
_solver_called++;
boolector_assume(_btor, expr);
return boolector_sat(_btor) == BOOLECTOR_SAT;
}
