52 std::map<exprt, polynomialt> polynomials;
58 std::cout <<
"Polynomial accelerating program:\n";
60 for(goto_programt::instructionst::iterator
71 std::cout <<
"Modified:\n";
73 for(expr_sett::iterator it=
modified.begin();
77 std::cout <<
expr2c(*it,
ns) <<
'\n';
98 for(expr_sett::iterator it=
modified.begin();
105 if(it->type().id()==ID_bool)
111 if(target.
id()==ID_index ||
112 target.
id()==ID_dereference)
120 std::map<exprt, polynomialt> this_poly;
121 this_poly[target]=poly;
126 std::cout <<
"Fitted a polynomial for " <<
expr2c(target,
ns)
129 polynomials[target]=poly;
136 if(polynomials.empty())
149 for(patht::iterator it=accelerator.
path.begin();
150 it!=accelerator.
path.end();
153 if(it->loc->is_assign() || it->loc->is_decl())
155 assigns.push_back(*(it->loc));
159 for(expr_sett::iterator it=dirty.begin();
164 std::cout <<
"Trying to accelerate " <<
expr2c(*it,
ns) <<
'\n';
167 if(it->type().id()==ID_bool)
172 std::cout <<
"Ignoring boolean\n";
177 if(it->id()==ID_index ||
178 it->id()==ID_dereference)
181 std::cout <<
"Ignoring array reference\n";
190 std::cout <<
"We've accelerated it already\n";
201 std::cout <<
"Ignoring because it depends on an array\n";
212 std::map<exprt, polynomialt> this_poly;
213 this_poly[target]=poly;
217 polynomials[target]=poly;
224 std::cout <<
"Failed to accelerate " <<
expr2c(*it,
ns) <<
'\n';
244 bool path_is_monotone;
250 catch(
const std::string &s)
253 std::cout <<
"Assumptions error: " << s <<
'\n';
257 exprt pre_guard(guard);
259 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
260 it!=polynomials.end();
307 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
308 it!=polynomials.end();
311 program.
assign(it->first, it->second.to_expr());
350 for(distinguish_valuest::iterator jt=it->begin();
354 exprt distinguisher=jt->first;
355 bool taken=jt->second;
360 distinguisher.
swap(negated);
363 or_exprt disjunct(new_path, distinguisher);
364 new_path.
swap(disjunct);
377 std::cout <<
"Found a path\n";
385 catch(
const std::string &s)
387 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
391 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
403 std::vector<expr_listt> parameters;
404 std::set<std::pair<expr_listt, exprt> > coefficients;
412 std::cout <<
"Fitting a polynomial for " <<
expr2c(var,
ns)
413 <<
", which depends on:\n";
415 for(expr_sett::iterator it=influence.begin();
419 std::cout <<
expr2c(*it,
ns) <<
'\n';
423 for(expr_sett::iterator it=influence.begin();
427 if(it->id()==ID_index ||
428 it->id()==ID_dereference)
437 exprs.push_back(*it);
438 parameters.push_back(exprs);
441 parameters.push_back(exprs);
447 parameters.push_back(exprs);
451 parameters.push_back(exprs);
455 parameters.push_back(exprs);
457 for(std::vector<expr_listt>::iterator it=parameters.begin();
458 it!=parameters.end();
462 coefficients.insert(make_pair(*it, coeff.
symbol_expr()));
483 std::map<exprt, exprt> ivals1;
484 std::map<exprt, exprt> ivals2;
485 std::map<exprt, exprt> ivals3;
487 for(expr_sett::iterator it=influence.begin();
536 std::map<exprt, exprt> values;
538 for(expr_sett::iterator it=influence.begin();
542 values[*it]=ivals1[*it];
557 for(
int n=0; n <= 1; n++)
559 for(expr_sett::iterator it=influence.begin();
563 values[*it]=ivals2[*it];
566 values[*it]=ivals3[*it];
569 values[*it]=ivals1[*it];
573 for(expr_sett::iterator it=influence.begin();
577 values[*it]=ivals3[*it];
591 for(distinguish_valuest::iterator jt=it->begin();
595 exprt distinguisher=jt->first;
596 bool taken=jt->second;
601 distinguisher.
swap(negated);
604 or_exprt disjunct(new_path, distinguisher);
605 new_path.
swap(disjunct);
623 std::cout <<
"Found a polynomial\n";
633 catch(
const std::string &s)
635 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
639 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
647 std::map<exprt, exprt> &values,
648 std::set<std::pair<expr_listt, exprt> > &coefficients,
656 for(std::map<exprt, exprt>::iterator it=values.begin();
662 expr_type=it->first.type();
666 expr_type=
join_types(expr_type, it->first.type());
671 for(std::map<exprt, exprt>::iterator it=values.begin();
675 program.
assign(it->first, it->second);
679 for(
int i=0; i<num_unwindings; i++)
681 program.
append(loop_body);
687 for(std::set<std::pair<expr_listt, exprt> >::iterator it=coefficients.begin();
688 it!=coefficients.end();
693 for(expr_listt::const_iterator e_it=it->first.begin();
694 e_it!=it->first.end();
702 from_integer(num_unwindings, expr_type), concrete_value);
703 mult.
swap(concrete_value);
707 std::map<exprt, exprt>::iterator v_it=values.find(e);
711 mult_exprt mult(concrete_value, v_it->second);
712 mult.swap(concrete_value);
740 assumption->guard=polynomial_holds;
753 for(natural_loops_mutablet::natural_loopt::iterator it=
loop.begin();
763 for(
const auto &jt : succs)
788 "we should have a looping path, so we should never hit a location " 789 "with no successors.");
801 bool found_branch=
false;
803 for(
const auto &succ : succs)
806 bool taken=scratch_program.
eval(distinguisher).
is_true();
811 (succ->location_number < next->location_number))
831 for(goto_programt::targetst::iterator it=t->targets.begin();
832 it!=t->targets.end();
858 std::map<exprt, exprt> shadow_distinguishers;
893 exprt &distinguisher=*it;
897 shadow_distinguishers[distinguisher]=shadow;
900 assign->make_assignment();
924 exprt &distinguisher=d->second;
925 exprt &shadow=shadow_distinguishers[distinguisher];
928 assign->make_assignment();
931 assign->swap(*fixedt);
947 for(
const auto &target : t->targets)
949 if(target->location_number > t->location_number)
960 fixedt->targets.clear();
961 fixedt->targets.push_back(kill);
971 fixedt->targets.clear();
972 fixedt->targets.push_back(end);
977 fixedt->targets.clear();
978 fixedt->targets.push_back(kill);
991 const exprt &shadow=shadow_distinguishers[expr];
1025 for(expr_sett::iterator it=influence.begin();
1026 it!=influence.end();
1029 if(it->id()==ID_index ||
1030 it->id()==ID_dereference)
std::list< exprt > expr_listt
The type of an expression.
void update()
Update all indices.
goto_programt::targett loop_header
A generic base class for relations, i.e., binary predicates.
Generate Equation using Symbolic Execution.
targett assign(const exprt &lhs, const exprt &rhs)
targett insert_before(const_targett target)
Insertion before the given target.
void build_path(scratch_programt &scratch_program, patht &path)
void cone_of_influence(const expr_sett &targets, expr_sett &cone)
Goto Programs with Functions.
void record_path(scratch_programt &scratch_program)
bool depends_on_array(const exprt &e, exprt &array)
std::set< exprt > changed_vars
void assert_for_values(scratch_programt &program, std::map< exprt, exprt > &values, std::set< std::pair< expr_listt, exprt > > &coefficients, int num_unwindings, goto_programt &loop_body, exprt &target)
Symbol table entry.This is a symbol in the symbol table, stored in an object of type symbol_tablet...
void copy_from(const goto_programt &src)
Copy a full goto program, preserving targets.
#define INVARIANT(CONDITION, REASON)
signedbv_typet signed_poly_type()
bool do_arrays(goto_programt::instructionst &loop_body, std::map< exprt, polynomialt > &polynomials, exprt &loop_counter, substitutiont &substitution, scratch_programt &program)
std::list< instructiont > instructionst
const irep_idt & id() const
bool replace_expr(const exprt &what, const exprt &by, exprt &dest)
virtual bool accelerate(path_acceleratort &accelerator)
class symbol_exprt symbol_expr() const
produces a symbol_exprt for a symbol
The boolean constant true.
unsignedbv_typet unsigned_poly_type()
void ensure_no_overflows(scratch_programt &program)
std::unordered_set< exprt, irep_hash > expr_sett
instructionst::iterator targett
A declaration of a local variable.
goto_functionst & goto_functions
targett assume(const exprt &guard)
symbolt fresh_symbol(std::string base, typet type)
exprt eval(const exprt &e)
Fixed-width bit-vector with two's complement interpretation.
symbol_tablet & symbol_table
instructionst instructions
The list of instructions in the goto program.
API to expression classes.
void append(goto_programt::instructionst &instructions)
std::list< path_nodet > patht
std::list< Target > get_successors(Target target) const
message_handlert & message_handler
void find_modified(const patht &path, expr_sett &modified)
#define PRECONDITION(CONDITION)
targett insert_after(const_targett target)
Insertion after the given target.
A side effect that returns a non-deterministically chosen value.
std::map< exprt, bool > distinguish_valuest
void extract_polynomial(scratch_programt &program, std::set< std::pair< expr_listt, exprt > > &coefficients, polynomialt &polynomial)
bool check_inductive(std::map< exprt, polynomialt > polynomials, patht &path)
bool check_sat(bool do_slice)
typet join_types(const typet &t1, const typet &t2)
Return the smallest type that both t1 and t2 can be cast to without losing information.
The boolean constant false.
bool fit_polynomial(goto_programt::instructionst &loop_body, exprt &target, polynomialt &polynomial)
A generic container class for the GOTO intermediate representation of one function.
bool do_assumptions(std::map< exprt, polynomialt > polynomials, patht &body, exprt &guard)
acceleration_utilst utils
std::ostream & output_instruction(const namespacet &ns, const irep_idt &identifier, std::ostream &out, const instructionst::value_type &it) const
Output a single instruction.
std::set< exprt > dirty_vars
targett add_instruction()
Adds an instruction at the end.
Base class for all expressions.
std::map< exprt, exprt > substitutiont
void remove_skip(goto_programt &goto_program, goto_programt::targett begin, goto_programt::targett end)
remove unnecessary skip statements
natural_loops_mutablet::natural_loopt & loop
goto_programt pure_accelerator
std::string expr2c(const exprt &expr, const namespacet &ns)
std::list< exprt > distinguishers
bool fit_polynomial(exprt &target, polynomialt &polynomial, patht &path)
distinguish_mapt distinguishing_points
bool find_path(patht &path)
#define Forall_goto_program_instructions(it, program)
std::list< distinguish_valuest > accelerated_paths
void cone_of_influence(const exprt &target, expr_sett &cone)
Expression to hold a symbol (variable)
goto_programt & goto_program
void find_distinguishing_points()
bool simplify(exprt &expr, const namespacet &ns)
void stash_polynomials(scratch_programt &program, std::map< exprt, polynomialt > &polynomials, std::map< exprt, exprt > &stashed, patht &path)