mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-11 13:40:52 +00:00
Code Activity

Fix compiler warnings

Browse source
This commit is contained in:
Arie Gurfinkel 2018-05-15 12:13:18 -07:00
parent 4b6921dffb
commit 7c727ee922
6 changed files with 79 additions and 74 deletions
Download patch file Download diff file Expand all files Collapse all files

18
src/muz/spacer/spacer_itp_solver.cpp
View file

@ -279,7 +279,7 @@ void itp_solver::get_itp_core (expr_ref_vector &core)
else
{
proof_ref res(get_proof(),m);
// new code
if (m_old_hyp_reducer)
{
@ -290,10 +290,10 @@ void itp_solver::get_itp_core (expr_ref_vector &core)
verbose_stream() << "\nStats before transformation:";
iuc_before.print_farkas_stats();
}
proof_utils::reduce_hypotheses(res);
proof_utils::permute_unit_resolution(res);
if (m_print_farkas_stats)
{
iuc_proof iuc_after(m, res.get(), B);
@ -310,13 +310,13 @@ void itp_solver::get_itp_core (expr_ref_vector &core)
verbose_stream() << "\nStats before transformation:";
iuc_before.print_farkas_stats();
}
theory_axiom_reducer ta_reducer(m);
proof_ref pr_without_theory_lemmas = ta_reducer.reduce(res.get());
hypothesis_reducer hyp_reducer(m);
proof_ref pr_with_less_hypothesis = hyp_reducer.reduce(pr_without_theory_lemmas);
if (m_print_farkas_stats)
{
iuc_proof iuc_after(m, pr_with_less_hypothesis.get(), B);
@ -328,9 +328,9 @@ void itp_solver::get_itp_core (expr_ref_vector &core)
// construct proof object with contains partition information
iuc_proof iuc_pr(m, res, B);
// configure learner
unsat_core_learner learner(m, iuc_pr, m_print_farkas_stats, m_iuc_debug_proof);
unsat_core_learner learner(m, iuc_pr);
if (m_iuc_arith == 0 || m_iuc_arith > 3)
{
@ -352,7 +352,7 @@ void itp_solver::get_itp_core (expr_ref_vector &core)
unsat_core_plugin_farkas_lemma_bounded* plugin_farkas_lemma_bounded = alloc(unsat_core_plugin_farkas_lemma_bounded, learner,m);
learner.register_plugin(plugin_farkas_lemma_bounded);
}
if (m_iuc == 2)
{
unsat_core_plugin_min_cut* plugin_min_cut = alloc(unsat_core_plugin_min_cut, learner, m);