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();
309 for(std::map<exprt, polynomialt>::iterator it=polynomials.begin();
310 it!=polynomials.end();
313 program.
assign(it->first, it->second.to_expr());
352 for(distinguish_valuest::iterator jt=it->begin();
356 exprt distinguisher=jt->first;
357 bool taken=jt->second;
362 distinguisher.
swap(negated);
365 or_exprt disjunct(new_path, distinguisher);
366 new_path.
swap(disjunct);
379 std::cout <<
"Found a path\n";
387 catch(
const std::string &s)
389 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
393 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
405 std::vector<expr_listt> parameters;
406 std::set<std::pair<expr_listt, exprt> > coefficients;
414 std::cout <<
"Fitting a polynomial for " <<
expr2c(var,
ns)
415 <<
", which depends on:\n";
417 for(expr_sett::iterator it=influence.begin();
421 std::cout <<
expr2c(*it,
ns) <<
'\n';
425 for(expr_sett::iterator it=influence.begin();
429 if(it->id()==ID_index ||
430 it->id()==ID_dereference)
439 exprs.push_back(*it);
440 parameters.push_back(exprs);
443 parameters.push_back(exprs);
449 parameters.push_back(exprs);
453 parameters.push_back(exprs);
457 parameters.push_back(exprs);
459 for(std::vector<expr_listt>::iterator it=parameters.begin();
460 it!=parameters.end();
464 coefficients.insert(make_pair(*it, coeff.
symbol_expr()));
485 std::map<exprt, exprt> ivals1;
486 std::map<exprt, exprt> ivals2;
487 std::map<exprt, exprt> ivals3;
489 for(expr_sett::iterator it=influence.begin();
538 std::map<exprt, exprt> values;
540 for(expr_sett::iterator it=influence.begin();
544 values[*it]=ivals1[*it];
549 for(std::list<symbol_exprt>::iterator it =
distinguishers.begin();
559 for(
int n=0; n <= 1; n++)
561 for(expr_sett::iterator it=influence.begin();
565 values[*it]=ivals2[*it];
568 values[*it]=ivals3[*it];
571 values[*it]=ivals1[*it];
575 for(expr_sett::iterator it=influence.begin();
579 values[*it]=ivals3[*it];
593 for(distinguish_valuest::iterator jt=it->begin();
597 exprt distinguisher=jt->first;
598 bool taken=jt->second;
603 distinguisher.
swap(negated);
606 or_exprt disjunct(new_path, distinguisher);
607 new_path.
swap(disjunct);
625 std::cout <<
"Found a polynomial\n";
635 catch(
const std::string &s)
637 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
641 std::cout <<
"Error in fitting polynomial SAT check: " << s <<
'\n';
649 std::map<exprt, exprt> &values,
650 std::set<std::pair<expr_listt, exprt> > &coefficients,
658 for(std::map<exprt, exprt>::iterator it=values.begin();
664 expr_type=it->first.type();
668 expr_type=
join_types(expr_type, it->first.type());
673 for(std::map<exprt, exprt>::iterator it=values.begin();
677 program.
assign(it->first, it->second);
681 for(
int i=0; i<num_unwindings; i++)
683 program.
append(loop_body);
689 for(std::set<std::pair<expr_listt, exprt> >::iterator it=coefficients.begin();
690 it!=coefficients.end();
695 for(expr_listt::const_iterator e_it=it->first.begin();
696 e_it!=it->first.end();
704 from_integer(num_unwindings, expr_type), concrete_value);
705 mult.
swap(concrete_value);
709 std::map<exprt, exprt>::iterator v_it=values.find(e);
713 mult_exprt mult(concrete_value, v_it->second);
714 mult.
swap(concrete_value);
742 assumption->guard=polynomial_holds;
755 for(natural_loops_mutablet::natural_loopt::iterator it=
loop.begin();
765 for(
const auto &jt : succs)
790 "we should have a looping path, so we should never hit a location "
791 "with no successors.");
803 bool found_branch=
false;
805 for(
const auto &succ : succs)
808 bool taken=scratch_program.
eval(distinguisher).
is_true();
813 (succ->location_number < next->location_number))
833 for(goto_programt::targetst::iterator it=t->targets.begin();
834 it!=t->targets.end();
860 std::map<exprt, exprt> shadow_distinguishers;
891 for(std::list<symbol_exprt>::iterator it =
distinguishers.begin();
895 exprt &distinguisher=*it;
899 shadow_distinguishers[distinguisher]=shadow;
902 assign->make_assignment();
926 exprt &distinguisher=d->second;
927 exprt &shadow=shadow_distinguishers[distinguisher];
930 assign->make_assignment();
933 assign->swap(*fixedt);
949 for(
const auto &target : t->targets)
951 if(target->location_number > t->location_number)
962 fixedt->targets.clear();
963 fixedt->targets.push_back(kill);
973 fixedt->targets.clear();
974 fixedt->targets.push_back(end);
979 fixedt->targets.clear();
980 fixedt->targets.push_back(kill);
993 const exprt &shadow=shadow_distinguishers[expr];
1009 for(std::list<symbol_exprt>::iterator it =
distinguishers.begin();
1027 for(expr_sett::iterator it=influence.begin();
1028 it!=influence.end();
1031 if(it->id()==ID_index ||
1032 it->id()==ID_dereference)