def do_model(self, solver_name):
for (f, _, satisfiability, logic) in get_example_formulae():
if satisfiability and not logic.theory.uninterpreted and logic.quantifier_free:
try:
with Solver(name=solver_name, logic=logic) as s:
s.add_assertion(f)
check = s.solve()
self.assertTrue(check)
# Ask single values to the solver
subs = {}
for d in f.get_free_variables():
m = s.get_value(d)
subs[d] = m
simp = f.substitute(subs).simplify()
self.assertEqual(simp, TRUE(),
"%s -- %s :> %s" % (f, subs, simp))
# Ask the eager model
subs = {}
model = s.get_model()
for d in f.get_free_variables():
m = model.get_value(d)
subs[d] = m
simp = f.substitute(subs).simplify()
self.assertEqual(simp, TRUE())
except NoSolverAvailableError:
pass
def test_dumped_logic(self):
# Dumped logic matches the logic in the example
fs = get_example_formulae()
for (f_out, _, _, logic) in fs:
buf_out = cStringIO()
script_out = smtlibscript_from_formula(f_out)
script_out.serialize(outstream=buf_out)
buf_in = cStringIO(buf_out.getvalue())
parser = SmtLibParser()
script_in = parser.get_script(buf_in)
for cmd in script_in:
if cmd.name == "set-logic":
logic_in = cmd.args[0]
if logic == logics.QF_BOOL:
self.assertEqual(logic_in, logics.QF_UF)
elif logic == logics.BOOL:
self.assertEqual(logic_in, logics.LRA)
else:
self.assertEqual(logic_in, logic, script_in)
break
else: # Loops exited normally
print("-" * 40)
print(script_in)
def test_examples_z3(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
v = is_valid(f, solver_name='z3', logic=logic)
s = is_sat(f, solver_name='z3', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def do_model(self, solver_name):
for (f, _, satisfiability, logic) in get_example_formulae():
if satisfiability and not logic.theory.uninterpreted and logic.quantifier_free:
try:
with Solver(name=solver_name, logic=logic) as s:
s.add_assertion(f)
check = s.solve()
self.assertTrue(check)
# Ask single values to the solver
subs = {}
for d in f.get_free_variables():
m = s.get_value(d)
subs[d] = m
simp = f.substitute(subs).simplify()
self.assertEqual(simp, TRUE(), "%s -- %s :> %s" % (f, subs, simp))
# Ask the eager model
subs = {}
model = s.get_model()
for d in f.get_free_variables():
m = model.get_value(d)
subs[d] = m
simp = f.substitute(subs).simplify()
self.assertEqual(simp, TRUE())
except NoSolverAvailableError:
pass
def test_examples_z3(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
v = is_valid(f, solver_name='z3', logic=logic)
s = is_sat(f, solver_name='z3', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def test_types_oracle_examples(self):
oracle = get_env().typeso
for (f, _, _, _) in get_example_formulae():
types_all = oracle.get_types(f)
types_custom = oracle.get_types(f, custom_only=True)
# Custom types are a subset of all types
s1 = set(types_all)
s2 = set(types_custom)
self.assertTrue(s1.issuperset(s2))
# Compare logics with types
theory = self.env.theoryo.get_theory(f)
if len(f.get_free_variables()) == 0:
continue
if theory.arrays:
self.assertTrue(any(x.is_array_type() for x in types_all),
(f, types_all))
if theory.bit_vectors:
self.assertTrue(any(x.is_bv_type() for x in types_all),
(f, types_all))
if theory.integer_arithmetic:
self.assertTrue(any(x.is_int_type() for x in types_all),
(f, types_all))
if theory.real_arithmetic:
self.assertTrue(any(x.is_real_type() for x in types_all),
(f, types_all))
def test_bdd_simplify(self):
s = BddSimplifier()
for (f, _, _, logic) in get_example_formulae():
if logic == QF_BOOL:
fprime = s.simplify(f)
self.assertValid(Iff(fprime, f))
s = BddSimplifier()
try:
s.validate_simplifications = True
except ValueError:
self.assertTrue(len(self.env.factory.all_solvers())==1)
for (f, _, _, logic) in get_example_formulae():
if logic == QF_BOOL:
fprime = s.simplify(f)
self.assertValid(Iff(fprime, f))
def test_types_oracle_examples(self):
oracle = get_env().typeso
for (f, _, _, _) in get_example_formulae():
types_all = oracle.get_types(f)
types_custom = oracle.get_types(f, custom_only=True)
# Custom types are a subset of all types
s1 = set(types_all)
s2 = set(types_custom)
self.assertTrue(s1.issuperset(s2))
# Compare logics with types
theory = self.env.theoryo.get_theory(f)
if len(f.get_free_variables()) == 0:
continue
if theory.arrays:
self.assertTrue(any(x.is_array_type() for x in types_all),
(f, types_all))
if theory.bit_vectors:
self.assertTrue(any(x.is_bv_type() for x in types_all),
(f, types_all))
if theory.integer_arithmetic:
self.assertTrue(any(x.is_int_type() for x in types_all),
(f, types_all))
if theory.real_arithmetic:
self.assertTrue(any(x.is_real_type() for x in types_all),
(f, types_all))
def test_examples_conversion(self):
convert = self.bdd_converter.convert
for example in get_example_formulae():
if example.logic != BOOL:
continue
expr = convert(example.expr)
self.assertIsNotNone(expr)
def _helper_check_examples(self, solver_name):
for (f, _, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
if satisfiability == False:
with UnsatCoreSolver(name=solver_name,
unsat_cores_mode="named") as solver:
if logic not in solver.LOGICS: continue
clauses = [f]
if f.is_and():
clauses = f.args()
for i,c in enumerate(clauses):
solver.add_assertion(c, "a%d" % i)
try:
r = solver.solve()
self.assertFalse(r)
except SolverReturnedUnknownResultError:
if QF_BV <= logic:
continue # Unsat-core support for QF_UFBV might be
# incomplete
else:
raise
core = solver.get_named_unsat_core()
self.assertTrue(len(core) <= len(clauses))
for k in core.values():
self.assertIn(k, clauses)
self.assertTrue(is_unsat(And(core.values()), logic=logic))
def _helper_check_examples(self, solver_name):
for (f, _, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
if satisfiability == False:
with UnsatCoreSolver(name=solver_name,
unsat_cores_mode="named") as solver:
if logic not in solver.LOGICS: continue
clauses = [f]
if f.is_and():
clauses = f.args()
for i, c in enumerate(clauses):
solver.add_assertion(c, "a%d" % i)
try:
r = solver.solve()
self.assertFalse(r)
except SolverReturnedUnknownResultError:
if QF_BV <= logic:
continue # Unsat-core support for QF_UFBV might be
# incomplete
else:
raise
core = solver.get_named_unsat_core()
self.assertTrue(len(core) <= len(clauses))
for k in core.values():
self.assertIn(k, clauses)
self.assertTrue(is_unsat(And(core.values()), logic=logic))
def test_dumped_logic(self):
# Dumped logic matches the logic in the example
fs = get_example_formulae()
for (f_out, _, _, logic) in fs:
buf_out = cStringIO()
script_out = smtlibscript_from_formula(f_out)
script_out.serialize(outstream=buf_out)
buf_in = cStringIO(buf_out.getvalue())
parser = SmtLibParser()
script_in = parser.get_script(buf_in)
for cmd in script_in:
if cmd.name == "set-logic":
logic_in = cmd.args[0]
if logic == logics.QF_BOOL:
self.assertEqual(logic_in, logics.QF_UF)
elif logic == logics.BOOL:
self.assertEqual(logic_in, logics.LRA)
else:
self.assertEqual(logic_in, logic, script_in)
break
else: # Loops exited normally
print("-"*40)
print(script_in)
def test_examples_conversion(self):
convert = self.bdd_converter.convert
for example in get_example_formulae():
if example.logic != BOOL:
continue
expr = convert(example.expr)
self.assertIsNotNone(expr)
def test_dumped_logic(self):
# Dumped logic matches the logic in the example.
#
# There are a few cases where we use a logic
# that does not exist in SMT-LIB, and the SMT-LIB
# serialization logic will find a logic that
# is more expressive. We need to adjust the test
# for those cases (see rewrite dict below).
rewrite = {
logics.QF_BOOL: logics.QF_UF,
logics.BOOL: logics.LRA,
logics.QF_NIRA: logics.AUFNIRA,
}
fs = get_example_formulae()
for (f_out, _, _, logic) in fs:
buf_out = StringIO()
script_out = smtlibscript_from_formula(f_out)
script_out.serialize(outstream=buf_out)
buf_in = StringIO(buf_out.getvalue())
parser = SmtLibParser()
script_in = parser.get_script(buf_in)
for cmd in script_in:
if cmd.name == "set-logic":
logic_in = cmd.args[0]
self.assertEqual(logic_in, rewrite.get(logic, logic))
break
else: # Loops exited normally
print("-"*40)
print(script_in)
def test_bdd_simplify(self):
s = BddSimplifier()
for (f, _, _, logic) in get_example_formulae():
if logic == QF_BOOL:
fprime = s.simplify(f)
self.assertValid(Iff(fprime, f))
s = BddSimplifier()
try:
s.validate_simplifications = True
except ValueError:
self.assertTrue(len(self.env.factory.all_solvers()) == 1)
for (f, _, _, logic) in get_example_formulae():
if logic == QF_BOOL:
fprime = s.simplify(f)
self.assertValid(Iff(fprime, f))
def test_examples_yices(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
v = is_valid(f, solver_name='yices', logic=logic)
s = is_sat(f, solver_name='yices', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def test_examples_by_logic(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if len(get_env().factory.all_solvers(logic=logic)) > 0:
v = is_valid(f, logic=logic)
s = is_sat(f, logic=logic)
self.assertEqual(validity, v, f.serialize())
self.assertEqual(satisfiability, s, f.serialize())
def test_shortcuts(self):
for (expr, _, sat_res, logic) in get_example_formulae():
if not logic <= QF_UFLIRA: continue
res = is_sat(expr, portfolio=["z3", "cvc4", "msat"])
self.assertEqual(res, sat_res, expr)
with self.assertRaises(ValueError):
is_sat(TRUE(), portfolio=["supersolver"])
def test_shortcuts(self):
for (expr, _, sat_res, logic) in get_example_formulae():
if not logic <= QF_UFLIRA: continue
res = is_sat(expr, portfolio=["z3", "cvc4", "msat"])
self.assertEqual(res, sat_res, expr)
with self.assertRaises(ValueError):
is_sat(TRUE(), portfolio=["supersolver"])
def test_examples_by_logic(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if len(get_env().factory.all_solvers(logic=logic)) > 0:
v = is_valid(f, logic=logic)
s = is_sat(f, logic=logic)
self.assertEqual(validity, v, f.serialize())
self.assertEqual(satisfiability, s, f.serialize())
def test_examples_yices(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
v = is_valid(f, solver_name='yices', logic=logic)
s = is_sat(f, solver_name='yices', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def _std_examples(self, qe, target_logic):
for (f, validity, satisfiability, logic) in get_example_formulae():
if logic != target_logic: continue
qf = qe.eliminate_quantifiers(f)
s = is_sat(qf)
v = is_valid(qf)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def test_conj_partitioning(self):
for (f, _, _, logic) in get_example_formulae():
if get_env().factory.has_solvers(logic=logic):
conjuncts = list(conjunctive_partition(f))
try:
ok = is_valid(Iff(f, And(conjuncts)), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def _std_examples(self, qe, target_logic):
for (f, validity, satisfiability, logic) in get_example_formulae():
if logic != target_logic: continue
qf = qe.eliminate_quantifiers(f)
s = is_sat(qf)
v = is_valid(qf)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def test_propagate_toplevel_examples(self):
for (f, _, _, logic) in get_example_formulae():
if self.env.factory.has_solvers(logic=logic):
rwf = propagate_toplevel(f)
try:
ok = is_valid(Iff(f, rwf), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def test_examples_get_implicant(self):
for (f, _, satisfiability, logic) in get_example_formulae():
if logic.quantifier_free:
for sname in get_env().factory.all_solvers(logic=logic):
f_i = get_implicant(f, logic=logic, solver_name=sname)
if satisfiability:
self.assertValid(Implies(f_i, f), logic=logic, msg=(f_i, f))
else:
self.assertIsNone(f_i)
def test_nnf_examples(self):
for (f, _, _, logic) in get_example_formulae():
if get_env().factory.has_solvers(logic=logic):
rf = nnf(f)
try:
ok = is_valid(Iff(f, rf), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def test_prenex_examples(self):
for (f, _, _, logic) in get_example_formulae():
if self.env.factory.has_solvers(logic=logic):
prenex = prenex_normal_form(f)
try:
ok = is_valid(Iff(f, prenex), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def test_aig_examples(self):
for (f, _, _, logic) in get_example_formulae():
if get_env().factory.has_solvers(logic=logic):
f_aig = aig(f)
try:
ok = is_valid(Iff(f, f_aig), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok, "Was: %s\n Got:%s" % (f, f_aig))
def test_disj_partitioning(self):
for (f, _, _, logic) in get_example_formulae():
if self.env.factory.has_solvers(logic=logic):
disjuncts = list(disjunctive_partition(f))
try:
ok = is_valid(Iff(f, Or(disjuncts)), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def test_propagate_toplevel_examples(self):
for (f, _, _, logic) in get_example_formulae():
if self.env.factory.has_solvers(logic=logic):
rwf = propagate_toplevel(f)
try:
ok = is_valid(Iff(f, rwf), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def test_aig_examples(self):
for (f, _, _, logic) in get_example_formulae():
if self.env.factory.has_solvers(logic=logic):
f_aig = aig(f)
try:
ok = is_valid(Iff(f, f_aig), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok, "Was: %s\n Got:%s" % (f, f_aig))
def test_examples_get_implicant(self):
for (f, _, satisfiability, logic) in get_example_formulae():
if logic.quantifier_free:
for sname in get_env().factory.all_solvers(logic=logic):
f_i = get_implicant(f, logic=logic, solver_name=sname)
if satisfiability:
self.assertValid(Implies(f_i, f), logic=logic, msg=(f_i, f))
else:
self.assertIsNone(f_i)
def test_prenex_examples(self):
for (f, _, _, logic) in get_example_formulae():
if self.env.factory.has_solvers(logic=logic):
prenex = prenex_normal_form(f)
try:
ok = is_valid(Iff(f, prenex), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def test_bdd_simplify_bool_abs(self):
s = BddSimplifier()
for (f, _, _, logic) in get_example_formulae():
if not logic.theory.linear: continue
if logic != QF_BOOL:
with self.assertRaises(ConvertExpressionError):
s.simplify(f)
s = BddSimplifier(bool_abstraction=True)
for (f, _, _, logic) in get_example_formulae():
if logic.quantifier_free:
fprime = s.simplify(f)
self.assertValid(Iff(fprime, f))
s = BddSimplifier(bool_abstraction=True)
f = And(Equals(Plus(Int(5), Int(1)), Int(6)), Symbol("x"))
fs = s.simplify(f)
self.assertEqual(fs, Symbol("x"))
def test_nnf_examples(self):
for (f, _, _, logic) in get_example_formulae():
if get_env().factory.has_solvers(logic=logic):
rf = nnf(f)
try:
ok = is_valid(Iff(f, rf), logic=logic)
except SolverReturnedUnknownResultError:
ok = not logic.quantifier_free
self.assertTrue(ok)
def do_back(self, solver_name):
for formula, _, _, logic in get_example_formulae():
if logic.quantifier_free:
try:
s = Solver(name=solver_name, logic=logic)
term = s.converter.convert(formula)
res = s.converter.back(term)
self.assertValid(Iff(formula, res), logic=logic)
except NoSolverAvailableError:
pass
def do_back(self, solver_name):
for formula, _, _, logic in get_example_formulae():
if logic.quantifier_free:
try:
s = Solver(name=solver_name, logic=logic)
term = s.converter.convert(formula)
res = s.converter.back(term)
self.assertValid(Iff(formula, res), logic=logic)
except NoSolverAvailableError:
pass
def test_btor_options(self):
for (f, _, sat, logic) in get_example_formulae():
if logic == QF_BV:
solver = Solver(name="btor",
solver_options={"rewrite-level":0,
"fun:dual-prop":1,
"eliminate-slices":1})
solver.add_assertion(f)
res = solver.solve()
self.assertTrue(res == sat)
def test_examples_msat(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
if not logic.theory.linear: continue
if logic.theory.strings: continue
v = is_valid(f, solver_name='msat', logic=logic)
s = is_sat(f, solver_name='msat', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def test_btor_options(self):
for (f, _, sat, logic) in get_example_formulae():
if logic == QF_BV:
solver = Solver(name="btor",
solver_options={"rewrite-level":0,
"fun:dual-prop":1,
"eliminate-slices":1})
solver.add_assertion(f)
res = solver.solve()
self.assertTrue(res == sat)
def test_basic(self):
with Portfolio(["z3", "msat", "cvc4"],
environment=self.env,
logic="QF_LRA") as p:
for example in get_example_formulae():
if not example.logic <= QF_LRA: continue
res = p.is_sat(example.expr)
self.assertEqual(res, example.is_sat, example.expr)
if res:
self.assertTrue(p.get_model().get_value(example.expr).is_true())
def test_examples_msat(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
if not logic.theory.linear: continue
if logic.theory.strings: continue
v = is_valid(f, solver_name='msat', logic=logic)
s = is_sat(f, solver_name='msat', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
def test_simplify_q(self):
simp = get_env().simplifier
for (f, _, _, logic) in get_example_formulae():
if logic.quantifier_free: continue
simp.validate_simplifications = True
sf = f.simplify()
simp.validate_simplifications = False
self.assertValid(Iff(f, sf), solver_name='z3',
msg="Simplification did not provide equivalent "+
"result:\n f= %s\n sf = %s" % (f, sf))
def test_examples_btor(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
try:
v = is_valid(f, solver_name='btor', logic=logic)
s = is_sat(f, solver_name='btor', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
except NoSolverAvailableError:
pass #Skip tests for unsupported logic
def test_examples_solving(self):
for example in get_example_formulae():
if example.logic != BOOL:
continue
solver = Solver(logic=BOOL, name='bdd')
solver.add_assertion(example.expr)
if example.is_sat:
self.assertTrue(solver.solve())
else:
self.assertFalse(solver.solve())
def test_examples_btor(self):
for (f, validity, satisfiability, logic) in get_example_formulae():
if not logic.quantifier_free: continue
try:
v = is_valid(f, solver_name='btor', logic=logic)
s = is_sat(f, solver_name='btor', logic=logic)
self.assertEqual(validity, v, f)
self.assertEqual(satisfiability, s, f)
except NoSolverAvailableError:
pass #Skip tests for unsupported logic
def test_examples(self):
p = HRParser()
for (f, _, _, _) in get_example_formulae():
s = f.serialize()
res = p.parse(s)
check = (res == f)
if not check:
try:
self.assertValid(Iff(res, f))
except NoSolverAvailableError:
pass
def test_examples(self):
p = HRParser()
for (f, _, _, _) in get_example_formulae():
s = f.serialize()
res = p.parse(s)
check = (res == f)
if not check:
try:
self.assertValid(Iff(res, f))
except NoSolverAvailableError:
pass
def do_examples(self, logic):
conv = CNFizer()
for example in get_example_formulae():
if example.logic != logic:
continue
cnf = conv.convert_as_formula(example.expr)
self.assertValid(Implies(cnf, example.expr), logic=logic)
res = is_sat(cnf, logic=logic)
self.assertEqual(res, example.is_sat)
def test_read_and_write_shortcuts(self):
fs = get_example_formulae()
fdi, tmp_fname = mkstemp()
os.close(fdi) # Close initial file descriptor
for (f_out, _, _, _) in fs:
write_smtlib(f_out, tmp_fname)
f_in = read_smtlib(tmp_fname)
self.assertEqual(f_out.simplify(), f_in.simplify())
# Clean-up
os.remove(tmp_fname)
def test_basic(self):
with Portfolio(["z3", "msat", "cvc4"],
environment=self.env,
logic="QF_LRA") as p:
for example in get_example_formulae():
if not example.logic <= QF_LRA: continue
res = p.is_sat(example.expr)
self.assertEqual(res, example.is_sat, example.expr)
if res:
self.assertTrue(p.get_model().get_value(
example.expr).is_true())
def do_examples(self, logic):
conv = CNFizer()
for example in get_example_formulae():
if example.logic != logic:
continue
cnf = conv.convert_as_formula(example.expr)
self.assertValid(Implies(cnf, example.expr), logic=logic)
res = is_sat(cnf, logic=logic)
self.assertEqual(res, example.is_sat)
def test_examples_solving(self):
for example in get_example_formulae():
if example.logic != BOOL:
continue
solver = Solver(logic=BOOL,
name='bdd')
solver.add_assertion(example.expr)
if example.is_sat:
self.assertTrue(solver.solve())
else:
self.assertFalse(solver.solve())
def test_bdd_simplify_bool_abs(self):
s = BddSimplifier()
for (f, _, _, logic) in get_example_formulae():
if not logic.theory.linear: continue
if logic != QF_BOOL:
with self.assertRaises(ConvertExpressionError):
s.simplify(f)
s = BddSimplifier(bool_abstraction=True)
for (f, _, _, logic) in get_example_formulae():
if logic.quantifier_free:
fprime = s.simplify(f)
self.assertValid(Iff(fprime, f))
s = BddSimplifier(bool_abstraction=True)
f = And(Equals(Plus(Int(5), Int(1)),
Int(6)),
Symbol("x"))
fs = s.simplify(f)
self.assertEqual(fs, Symbol("x"))
def test_w_theory(self):
for example in get_example_formulae():
f = example.expr
if example.logic.quantifier_free: continue
try:
res = qelim(f, solver_name="shannon")
self.assertIsNotNone(res, f)
except NoSolverAvailableError:
self.assertTrue(example.logic > pysmt.logics.BOOL, example)
except InternalSolverError:
self.assertTrue(example.logic > pysmt.logics.BOOL, example)
def test_w_theory(self):
for example in get_example_formulae():
f = example.expr
if example.logic.quantifier_free: continue
try:
res = qelim(f, solver_name="shannon")
self.assertIsNotNone(res, f)
except NoSolverAvailableError:
self.assertTrue(example.logic > pysmt.logics.BOOL, example)
except InternalSolverError:
self.assertTrue(example.logic > pysmt.logics.BOOL, example)
def test_simplify_qf(self):
simp = get_env().simplifier
for (f, _, _, logic) in get_example_formulae():
if logic.is_quantified(): continue
sname = "z3" if not logic.theory.strings else "cvc4"
simp.validate_simplifications = sname
sf = f.simplify()
simp.validate_simplifications = None
self.assertValid(Iff(f, sf), solver_name=sname,
msg="Simplification did not provide equivalent "+
"result:\n f= %s\n sf = %s" % (f, sf))
def test_read_and_write_shortcuts(self):
fs = get_example_formulae()
fdi, tmp_fname = mkstemp()
os.close(fdi) # Close initial file descriptor
for (f_out, _, _, _) in fs:
write_smtlib(f_out, tmp_fname)
f_in = read_smtlib(tmp_fname)
self.assertEqual(f_out.simplify(), f_in.simplify())
# Clean-up
os.remove(tmp_fname)
