#include <bv_refinement.h>
+ Inheritance diagram for bv_refinementt:
+ Collaboration diagram for bv_refinementt:
Implementation of the decision procedure.
Return a textual description of the decision procedure.
- Public Member Functions inherited from
boolbvt
Convert expression to vector of literalts, using an internal cache to speed up conversion if available.
Return expr with variables replaced by values from satisfying assignment if available.
For a Boolean expression expr, add the constraint 'expr' if value is true, otherwise add 'not expr'.
Print satisfying assignment to out.
Generate a handle, which is an expression that has the same value as the argument in any model that is generated; this offers an efficient way to refer to the expression in subsequent calls to
get or
set_to.
- Public Member Functions inherited from
arrayst
Record that symbol is equal to value for the purposes of the array theory.
- Public Member Functions inherited from
equalityt
Implementation of the decision procedure.
Print satisfying assignment to out.
Return a textual description of the decision procedure.
Return expr with variables replaced by values from satisfying assignment if available.
Return value of literal l from satisfying assignment.
Generate a handle, which is an expression that has the same value as the argument in any model that is generated; this offers an efficient way to refer to the expression in subsequent calls to
get or
set_to.
Convert a Boolean expression and return the corresponding literal.
Returns true if an expression is in the final conflict leading to UNSAT.
For a Boolean expression expr, add the constraint 'current_context => expr' if value is true, otherwise add 'current_context => not expr'.
Push a new context on the stack This context becomes a child context nested in the current context.
Pop whatever is on top of the stack.
Set the limit for the solver to time out in seconds.
Return the number of incremental solver calls.
- Public Member Functions inherited from
prop_convt
For a Boolean expression expr, add the constraint 'expr'.
For a Boolean expression expr, add the constraint 'not expr'.
Run the decision procedure to solve the problem This corresponds to SMT-LIB's check-sat.
Run the decision procedure to solve the problem under the given assumption.
Protected Member Functions
generate array constraints
Converts an expression into its gate-level representation and returns a vector of literals corresponding to the outputs of the Boolean circuit.
Create Boolean functions describing all dynamic and all not-dynamic object encodings over placeholders as input Boolean variables representing object bits.
Create Boolean functions describing all objects of each known object size over placeholders as input Boolean variables representing object bits.
Given a pointer encoded in bv, extract the literals identifying the object that the pointer points to.
Given a pointer encoded in bv, extract the literals representing the offset into an object that the pointer points to.
- Protected Member Functions inherited from
boolbvt
Print that the expression of x has failed conversion, then return a vector of x's width.
Flatten <, >, <= and >= expressions.
conversion from bitvector types to boolean
index operator with constant index
Flatten array.
Flatten arrays constructed from a single element.
Return the model value for expr.
create new, unique variables for the given binding
- Protected Member Functions inherited from
arrayst
adds array constraints (refine=true...lazily for the refinement loop)
merge the indices into the root
- Protected Member Functions inherited from
equalityt
Get a boolean value from the model if the formula is satisfiable.
- Protected Attributes inherited from
boolbvt
- Protected Attributes inherited from
arrayst
- Protected Attributes inherited from
equalityt
Assumptions on the stack.
To generate unique literal names for contexts.
assumption_stack is segmented in contexts; Number of assumptions in each context on the stack
check if an under-approximation is part of the conflict
inspect if satisfying assignment extends to original formula, otherwise refine overapproximation
inspect if proof holds on original formula, otherwise refine underapproximation
check whether counterexample is spurious
freeze symbols for incremental solving
Additional Inherited Members
- Public Types inherited from
boolbvt
- Public Types inherited from
arrayst
Result of running the decision procedure.
More...
- Public Attributes inherited from
boolbvt
- Protected Types inherited from
boolbvt
- Protected Types inherited from
arrayst
- Static Protected Member Functions inherited from
bv_pointerst
Construct a pointer encoding from given encodings of object and offset.
Detailed Description
Constructor & Destructor Documentation
◆ bv_refinementt()
bv_refinementt::bv_refinementt
(
const infot &
info )
explicit
Member Function Documentation
◆ add_approximation()
◆ arrays_overapproximated()
void bv_refinementt::arrays_overapproximated
(
)
private
◆ check_SAT() [1/2]
void bv_refinementt::check_SAT
(
)
private
◆ check_SAT() [2/2]
inspect if satisfying assignment extends to original formula, otherwise refine overapproximation
Definition at line 161 of file refine_arithmetic.cpp.
◆ check_UNSAT() [1/2]
void bv_refinementt::check_UNSAT
(
)
private
◆ check_UNSAT() [2/2]
inspect if proof holds on original formula, otherwise refine underapproximation
Definition at line 363 of file refine_arithmetic.cpp.
◆ conflicts_with()
◆ convert_div()
◆ convert_floatbv_op()
◆ convert_mod()
◆ convert_mult()
◆ dec_solve()
◆ decision_procedure_text()
std::string bv_refinementt::decision_procedure_text
(
)
const
inlineoverridevirtual
◆ finish_eager_conversion_arrays()
void bv_refinementt::finish_eager_conversion_arrays
(
)
overrideprotectedvirtual
◆ freeze_lazy_constraints()
void bv_refinementt::freeze_lazy_constraints
(
)
private
◆ get_values()
◆ initialize()
◆ prop_solve()
Member Data Documentation
◆ approximations
◆ config_
◆ progress
bool bv_refinementt::progress
private
The documentation for this class was generated from the following files: