Skip to content
Snippets Groups Projects
Commit 25b5159f authored by Etienne Kneuss's avatar Etienne Kneuss
Browse files

OptimisticGround can take time, so we do the work on application rather than instantiation.

parent 4fad2012
Branches
Tags
No related merge requests found
...@@ -10,57 +10,62 @@ import purescala.Extractors._ ...@@ -10,57 +10,62 @@ import purescala.Extractors._
case object OptimisticGround extends Rule("Optimistic Ground") { case object OptimisticGround extends Rule("Optimistic Ground") {
def instantiateOn(sctx: SynthesisContext, p: Problem): Traversable[RuleInstantiation] = { def instantiateOn(sctx: SynthesisContext, p: Problem): Traversable[RuleInstantiation] = {
if (!p.as.isEmpty && !p.xs.isEmpty) { if (!p.as.isEmpty && !p.xs.isEmpty) {
val xss = p.xs.toSet val res = new RuleInstantiation(p, this, SolutionBuilder.none) {
val ass = p.as.toSet def apply(sctx: SynthesisContext) = {
val xss = p.xs.toSet
val ass = p.as.toSet
val tpe = TupleType(p.xs.map(_.getType)) val tpe = TupleType(p.xs.map(_.getType))
var i = 0; var i = 0;
var maxTries = 3; var maxTries = 3;
var result: Option[RuleInstantiation] = None var result: Option[RuleApplicationResult] = None
var continue = true var continue = true
var predicates: Seq[Expr] = Seq() var predicates: Seq[Expr] = Seq()
while (result.isEmpty && i < maxTries && continue) { while (result.isEmpty && i < maxTries && continue) {
val phi = And(p.pc +: p.phi +: predicates) val phi = And(p.pc +: p.phi +: predicates)
//println("SOLVING " + phi + " ...") //println("SOLVING " + phi + " ...")
sctx.solver.solveSAT(phi) match { sctx.solver.solveSAT(phi) match {
case (Some(true), satModel) => case (Some(true), satModel) =>
val satXsModel = satModel.filterKeys(xss) val satXsModel = satModel.filterKeys(xss)
val newPhi = valuateWithModelIn(phi, xss, satModel) val newPhi = valuateWithModelIn(phi, xss, satModel)
//println("REFUTING " + Not(newPhi) + "...") //println("REFUTING " + Not(newPhi) + "...")
sctx.solver.solveSAT(Not(newPhi)) match { sctx.solver.solveSAT(Not(newPhi)) match {
case (Some(true), invalidModel) => case (Some(true), invalidModel) =>
// Found as such as the xs break, refine predicates // Found as such as the xs break, refine predicates
predicates = valuateWithModelIn(phi, ass, invalidModel) +: predicates predicates = valuateWithModelIn(phi, ass, invalidModel) +: predicates
case (Some(false), _) => case (Some(false), _) =>
result = Some(RuleInstantiation.immediateSuccess(p, this, Solution(BooleanLiteral(true), Set(), Tuple(p.xs.map(valuateWithModel(satModel))).setType(tpe)))) result = Some(RuleSuccess(Solution(BooleanLiteral(true), Set(), Tuple(p.xs.map(valuateWithModel(satModel))).setType(tpe))))
case _ =>
continue = false
result = None
}
case (Some(false), _) =>
if (predicates.isEmpty) {
result = Some(RuleSuccess(Solution(BooleanLiteral(false), Set(), Error(p.phi+" is UNSAT!").setType(tpe))))
} else {
continue = false
result = None
}
case _ => case _ =>
continue = false continue = false
result = None result = None
} }
case (Some(false), _) => i += 1
if (predicates.isEmpty) { }
result = Some(RuleInstantiation.immediateSuccess(p, this, Solution(BooleanLiteral(false), Set(), Error(p.phi+" is UNSAT!").setType(tpe))))
} else {
continue = false
result = None
}
case _ =>
continue = false
result = None
}
i += 1 result.getOrElse(RuleApplicationImpossible)
}
} }
List(res)
result
} else { } else {
Nil Nil
} }
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment