mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-06 17:44:08 +00:00
Code Activity

unused variable warning

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2020-07-25 15:41:42 -07:00
parent 4d586c2c13
commit 78afa2527c
4 changed files with 6 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/smt/seq_axioms.cpp
View file

@ -327,7 +327,7 @@ void seq_axioms::add_indexof_axiom(expr* i) {
if (!offset || (a.is_numeral(offset, r) && r.is_zero())) {
// |s| = 0 => indexof(t,s,0) = 0
add_axiom(~s_eq_empty, i_eq_0);
#if 1
#if 0
expr_ref x = m_sk.mk_indexof_left(t, s);
expr_ref y = m_sk.mk_indexof_right(t, s);
xsy = mk_concat(x, s, y);

7
src/smt/smt_induction.cpp
View file

@ -95,7 +95,7 @@ collect_induction_literals::collect_induction_literals(context& ctx, ast_manager
vs(vs),
m_literal_index(0)
{
(void)vs;
// (void)vs;
}
literal_vector collect_induction_literals::operator()() {
@ -538,10 +538,9 @@ void induction_lemmas::apply_induction(literal lit, induction_positions_t const
}
}
induction_lemmas::induction_lemmas(context& ctx, ast_manager& m, value_sweep& vs):
induction_lemmas::induction_lemmas(context& ctx, ast_manager& m):
ctx(ctx),
m(m),
vs(vs),
m_dt(m),
m_a(m),
m_rec(m),
@ -554,7 +553,7 @@ induction::induction(context& ctx, ast_manager& m):
m(m),
vs(m),
m_collect_literals(ctx, m, vs),
m_create_lemmas(ctx, m, vs)
m_create_lemmas(ctx, m)
{}
// TBD: use smt_arith_value to also include state from arithmetic solver

3
src/smt/smt_induction.h
View file

@ -91,7 +91,6 @@ namespace smt {
context& ctx;
ast_manager& m;
value_sweep& vs;
datatype::util m_dt;
arith_util m_a;
recfun::util m_rec;
@ -123,7 +122,7 @@ namespace smt {
void apply_induction(literal lit, induction_positions_t const & positions);
public:
induction_lemmas(context& ctx, ast_manager& m, value_sweep& vs);
induction_lemmas(context& ctx, ast_manager& m);
bool operator()(literal lit);
};

1
src/smt/theory_seq.cpp
View file

@ -3565,6 +3565,7 @@ bool theory_seq::should_research(expr_ref_vector & unsat_core) {
if (k_min < UINT_MAX) {
m_max_unfolding_depth++;
k_min *= 2;
rational lo;
if (m_util.is_seq(s_min))
k_min = std::max(m_util.str.min_length(s_min), k_min);
IF_VERBOSE(1, verbose_stream() << "(smt.seq :increase-length " << mk_pp(s_min, m) << " " << k_min << ")\n");