#include "../simplifier/UseITEContext.h"
#include "../simplifier/AlwaysTrue.h"
#include "../simplifier/AIGSimplifyPropositionalCore.h"
-#include "../simplifier/BigRewriter.h"
#include <memory>
namespace BEEV {
bm->ASTNodeStats("After bitblast simplification: ", simplified_solved_InputToSAT);
}
}
-
return simplified_solved_InputToSAT;
}
// so it's expensive to call.
if (!arrayops && initial_difficulty_score < 1000000)
{
- // Remove the sdiv/smod/srem
- simplified_solved_InputToSAT = arrayTransformer->TransformFormula_TopLevel(simplified_solved_InputToSAT);
-
simplified_solved_InputToSAT = callSizeReducing(simplified_solved_InputToSAT, bvSolver, initial_difficulty_score);
initial_difficulty_score = difficulty.score(simplified_solved_InputToSAT);
}
- {
- bm->GetRunTimes()->start(RunTimes::BigRewrite);
- BEEV::BigRewriter b ;
- ASTNodeMap fromTo;
- SimplifyingNodeFactory nf(*(bm->hashingNodeFactory), *bm);
- simplified_solved_InputToSAT = b.rewrite(simplified_solved_InputToSAT, fromTo, &nf,bm);
- bm->GetRunTimes()->stop(RunTimes::BigRewrite);
- }
-
-
if (bm->UserFlags.stats_flag)
cout << "Difficulty After Size reducing:" << initial_difficulty_score << endl;
}
while (inputToSAT != simplified_solved_InputToSAT);
-
if (bm->UserFlags.bitConstantProp_flag)
{
bm->GetRunTimes()->start(RunTimes::ConstantBitPropagation);