diff options
author | Dan Liew <daniel.liew@imperial.ac.uk> | 2014-12-02 13:33:01 +0000 |
---|---|---|
committer | Dan Liew <daniel.liew@imperial.ac.uk> | 2014-12-02 18:39:04 +0000 |
commit | 03c58b5c78206e17164c4c9ef35ab133de63e705 (patch) | |
tree | f74daa6a7eb2009c62af7a74b14b7b1b2e61df35 /lib | |
parent | 591b3d4715327b25d09f57a7198d48ed7174a017 (diff) | |
download | klee-03c58b5c78206e17164c4c9ef35ab133de63e705.tar.gz |
The printing of constraints and the QueryExpr have been merged into a
single method with two different implementations. There is one version of this method for human readability (printHumanReadableQuery()) and a version for machine consumption (printMachineReadableQuery()). The reason for having two versions is because different behaviour is needed in different scenarios * In machine readable mode the entire query is printed inside a single ``(assert ...)``. This is done to allow ``(let ...)`` to abbreviate as much as possible. * In human readable mode each constraint and query expression is printed inside its own ``(assert ...)`` unless the abbreviation mode is ABBR_LET in which case all constraints and query expr are printed inside a single ``(assert ...)`` much like in the machine readable mode Whilst I was here I also fixed a bug handling identation when printing ``(let ...)`` expressions in printAssert()
Diffstat (limited to 'lib')
-rw-r--r-- | lib/Expr/ExprSMTLIBPrinter.cpp | 75 |
1 files changed, 46 insertions, 29 deletions
diff --git a/lib/Expr/ExprSMTLIBPrinter.cpp b/lib/Expr/ExprSMTLIBPrinter.cpp index fb7e270e..3e1ff561 100644 --- a/lib/Expr/ExprSMTLIBPrinter.cpp +++ b/lib/Expr/ExprSMTLIBPrinter.cpp @@ -480,8 +480,12 @@ void ExprSMTLIBPrinter::generateOutput() { printOptions(); printSetLogic(); printArrayDeclarations(); - printConstraints(); - printQueryExpr(); + + if (humanReadable) + printHumanReadableQuery(); + else + printMachineReadableQuery(); + printAction(); printExit(); } @@ -570,25 +574,45 @@ void ExprSMTLIBPrinter::printArrayDeclarations() { } } -void ExprSMTLIBPrinter::printConstraints() { - if (humanReadable) - *o << "; Constraints\n"; +void ExprSMTLIBPrinter::printHumanReadableQuery() { + assert(humanReadable && "method must be called in humanReadable mode"); + *o << "; Constraints\n"; - // Generate assert statements for each constraint - for (ConstraintManager::const_iterator i = query->constraints.begin(); - i != query->constraints.end(); i++) { - *p << "(assert "; - p->pushIndent(); - printSeperator(); + if (abbrMode != ABBR_LET) { + // Generate assert statements for each constraint + for (ConstraintManager::const_iterator i = query->constraints.begin(); + i != query->constraints.end(); i++) { + printAssert(*i); + } - // recurse into Expression - printExpression(*i, SORT_BOOL); + *o << "; QueryExpr\n"; + ref<Expr> queryAssert = Expr::createIsZero(query->expr); + printAssert(queryAssert); + } else { + // let bindings are only scoped within a single (assert ...) so + // the entire query must be printed within a single assert + *o << "; Constraints and QueryExpr\n"; + printQueryInSingleAssert(); + } +} +void ExprSMTLIBPrinter::printMachineReadableQuery() { + assert(!humanReadable && "method should not be called in humanReadable mode"); + printQueryInSingleAssert(); +} - p->popIndent(); - printSeperator(); - *p << ")"; - p->breakLineI(); + +void ExprSMTLIBPrinter::printQueryInSingleAssert() { + ref<Expr> queryAssert = Expr::createIsZero(query->expr); + + // Print constraints inside the main query to reuse the Expr bindings + for (std::vector<ref<Expr> >::const_iterator i = query->constraints.begin(), + e = query->constraints.end(); + i != e; ++i) { + queryAssert = AndExpr::create(queryAssert, *i); } + + // print just a single (assert ...) containing entire query + printAssert(queryAssert); } void ExprSMTLIBPrinter::printAction() { @@ -706,7 +730,7 @@ void ExprSMTLIBPrinter::printAssert(const ref<Expr> &e) { *p << "(let"; p->pushIndent(); printSeperator(); - *p << "( "; + *p << "("; p->pushIndent(); // Disable abbreviations so none are used here. @@ -716,8 +740,9 @@ void ExprSMTLIBPrinter::printAssert(const ref<Expr> &e) { for (BindingMap::const_iterator i = bindings.begin(); i != bindings.end(); ++i) { printSeperator(); - *p << "(?B" << i->second << " "; + *p << "(?B" << i->second; p->pushIndent(); + printSeperator(); // We can abbreviate SORT_BOOL or SORT_BITVECTOR in let expressions printExpression(i->first, getSort(i->first)); @@ -736,7 +761,8 @@ void ExprSMTLIBPrinter::printAssert(const ref<Expr> &e) { printSeperator(); printExpression(e, SORT_BOOL); - + p->popIndent(); + printSeperator(); *p << ")"; } else { printExpression(e, SORT_BOOL); @@ -749,15 +775,6 @@ void ExprSMTLIBPrinter::printAssert(const ref<Expr> &e) { p->breakLineI(); } -void ExprSMTLIBPrinter::printQueryExpr() { - if (humanReadable) { - *p << "; Query from solver turned into an assert"; - p->breakLineI(); - } - ref<Expr> queryAssert = Expr::createIsZero(query->expr); - printAssert(queryAssert); -} - ExprSMTLIBPrinter::SMTLIB_SORT ExprSMTLIBPrinter::getSort(const ref<Expr> &e) { switch (e->getKind()) { case Expr::NotOptimized: |