java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/Elevator-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:36:26,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:36:26,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:36:26,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:36:26,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:36:26,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:36:26,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:36:26,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:36:26,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:36:26,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:36:26,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:36:26,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:36:26,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:36:26,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:36:26,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:36:26,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:36:26,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:36:26,232 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:36:26,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:36:26,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:36:26,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:36:26,239 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:36:26,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:36:26,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:36:26,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:36:26,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:36:26,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:36:26,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:36:26,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:36:26,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:36:26,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:36:26,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:36:26,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:36:26,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:36:26,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:36:26,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:36:26,252 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:36:26,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:36:26,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:36:26,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:36:26,270 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:36:26,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:36:26,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:36:26,272 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:36:26,272 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:36:26,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:36:26,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:36:26,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:36:26,352 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:36:26,352 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:36:26,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-07-23 13:36:26,353 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-07-23 13:36:26,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:36:26,446 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:36:26,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:36:26,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:36:26,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:36:26,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:36:26,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:36:26,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:36:26,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:36:26,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/1) ... [2018-07-23 13:36:26,633 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-07-23 13:36:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-07-23 13:36:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-07-23 13:36:27,430 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:36:27,431 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:27 BoogieIcfgContainer [2018-07-23 13:36:27,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:36:27,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:36:27,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:36:27,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:36:27,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:26" (1/2) ... [2018-07-23 13:36:27,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4382621a and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:36:27, skipping insertion in model container [2018-07-23 13:36:27,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:27" (2/2) ... [2018-07-23 13:36:27,441 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-07-23 13:36:27,452 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:36:27,466 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:36:27,511 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:36:27,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:36:27,512 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:36:27,512 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:36:27,512 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:36:27,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:36:27,512 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:36:27,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:36:27,513 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:36:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:36:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:36:27,538 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,539 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:36:27,540 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash 35564, now seen corresponding path program 1 times [2018-07-23 13:36:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,686 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:27,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:36:27,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,690 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|) (= Elevator_qCSP 1)), 11#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|))] [2018-07-23 13:36:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,692 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:36:27,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:36:27,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:27,715 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2018-07-23 13:36:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:27,810 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:36:27,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:36:27,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-23 13:36:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:27,825 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:36:27,826 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:36:27,829 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:36:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:36:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:36:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:36:27,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-07-23 13:36:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:27,869 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:36:27,869 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:36:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:36:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:36:27,870 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:27,870 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:36:27,870 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash 34183738, now seen corresponding path program 1 times [2018-07-23 13:36:27,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:27,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:36:27,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,963 INFO L185 omatonBuilderFactory]: Interpolants [42#true, 43#false, 44#(= Elevator_qCSP 1), 45#(not (= Elevator_qCSP 3)), 46#(and (<= |Elevator_current'| Elevator_max) (not (= Elevator_qCSP 3)) (<= Elevator_min |Elevator_current'|)), 47#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|))] [2018-07-23 13:36:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:27,965 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:27,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:27,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:27,966 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-23 13:36:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:28,032 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:36:28,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:36:28,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-23 13:36:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:28,033 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:36:28,033 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:36:28,034 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:36:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:36:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:36:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:36:28,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-07-23 13:36:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:28,039 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:36:28,039 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:36:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:28,040 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:28,040 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-07-23 13:36:28,040 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1509159416, now seen corresponding path program 2 times [2018-07-23 13:36:28,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:28,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:36:28,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,399 INFO L185 omatonBuilderFactory]: Interpolants [84#true, 85#false, 86#(and (<= |Elevator_current'| Elevator_max) (= Elevator_qDC1 1) (<= Elevator_min |Elevator_current'|) (= Elevator_qCSP 1)), 87#(and (< 0 Elevator_qDC1) (or (and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|)) (not (= Elevator_qCSP 1))) (or (<= Elevator_qCSP 1) (and (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)) (or (< |Elevator_current'| |Elevator_goal'|) (<= Elevator_min |Elevator_goal'|)))) (<= Elevator_qDC1 1)), 88#(or (and (or (<= (+ |Elevator_current'| 1) Elevator_max) (= 0 (+ |Elevator_dir'| 1))) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (= 1 |Elevator_dir'|))) (not (= Elevator_qCSP 3)) (= Elevator_qDC1 2)), 89#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|) (or (and (or (<= (+ |Elevator_current'| 1) Elevator_max) (= 0 (+ |Elevator_dir'| 1))) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (= 1 |Elevator_dir'|))) (not (= Elevator_qCSP 3)) (= Elevator_qDC1 2))), 90#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|))] [2018-07-23 13:36:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:28,400 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:28,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:28,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:28,401 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 13:36:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:28,524 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:36:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:36:28,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:36:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:28,525 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:36:28,525 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:36:28,526 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:36:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:36:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:36:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:36:28,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-07-23 13:36:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:28,538 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:36:28,538 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:36:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:28,539 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:28,539 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-07-23 13:36:28,540 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1396754006, now seen corresponding path program 3 times [2018-07-23 13:36:28,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:29,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:29,028 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:29,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:29,033 INFO L185 omatonBuilderFactory]: Interpolants [135#true, 136#false, 137#(and (<= |Elevator_current'| Elevator_max) (= Elevator_qDC1 1) (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|)), 138#(and (not (= Elevator_qDC1 2)) (or (and (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 1))) (or (<= |Elevator_current'| Elevator_max) (<= Elevator_qCSP 1)) (or (not (= Elevator_qCSP 2)) (and (<= 1 Elevator_qDC1) (not (= |Elevator_goal'| |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (or (<= |Elevator_current'| |Elevator_goal'|) (<= (+ Elevator_min 1) |Elevator_current'|)) (<= Elevator_qDC1 1))) (or (= Elevator_qCSP 2) (<= Elevator_qCSP 1))), 139#(and (not (= Elevator_qDC1 2)) (or (<= |Elevator_current'| Elevator_max) (<= Elevator_qCSP 1)) (or (and (<= |Elevator_current'| Elevator_max) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 1))) (or (= Elevator_qCSP 2) (<= Elevator_qCSP 1)) (or (and (<= 1 Elevator_qDC1) (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_min |Elevator_current'|) (<= |Elevator_goal'| Elevator_max) (or (<= |Elevator_current'| |Elevator_goal'|) (<= (+ Elevator_min 1) |Elevator_current'|)) (<= Elevator_qDC1 1)) (not (= Elevator_qCSP 2)))), 140#(and (or (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (not (= Elevator_qCSP 2)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|))) (or (<= Elevator_qCSP 2) (and (< 0 Elevator_qDC1) (<= Elevator_qDC1 1) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|)))))), 141#(or (not (= Elevator_qCSP 3)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (not (= Elevator_qDC1 1))), 142#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|) (or (not (= Elevator_qCSP 3)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (not (= Elevator_qDC1 1)))), 143#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|))] [2018-07-23 13:36:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:29,036 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:29,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:29,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:29,037 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 13:36:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:29,257 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:36:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:36:29,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:36:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:29,258 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:36:29,259 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:36:29,264 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:36:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:36:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:36:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:36:29,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-07-23 13:36:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:29,272 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:36:29,272 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:36:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:36:29,274 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:29,274 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-07-23 13:36:29,275 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2044157148, now seen corresponding path program 4 times [2018-07-23 13:36:29,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:29,920 WARN L169 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 42 [2018-07-23 13:36:30,321 WARN L169 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 71 [2018-07-23 13:36:30,503 WARN L169 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-07-23 13:36:30,692 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2018-07-23 13:36:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:30,802 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:30,802 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:36:30,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:30,805 INFO L185 omatonBuilderFactory]: Interpolants [208#(and (<= |Elevator_current'| Elevator_max) (or (not (= Elevator_qCSP 3)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (not (= Elevator_qDC1 1))) (<= Elevator_min |Elevator_current'|)), 209#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|)), 200#true, 201#false, 202#(and (= Elevator_qDC1 1) (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 1) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|)), 203#(and (not (= Elevator_qDC1 2)) (or (and (= Elevator_qCSP 2) (<= Elevator_min |Elevator_goal'|)) (and (or (= Elevator_qDC2 1) (not (= Elevator_qCSP 1))) (not (= Elevator_qDC2 2)) (<= Elevator_qCSP 1) (<= |Elevator_current'| |Elevator_goal'|) (not (= Elevator_qDC2 3)) (<= |Elevator_goal'| |Elevator_current'|))) (or (not (= Elevator_qCSP 2)) (and (<= 1 Elevator_qDC1) (not (= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qDC2 2) (<= |Elevator_goal'| Elevator_max) (<= Elevator_qDC1 1)))), 204#(and (or (and (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (= 1 |Elevator_dir'|)) (= Elevator_qCSP 3)) (and (or (and (not (= |Elevator_goal'| |Elevator_current'|)) (or (<= (+ |Elevator_current'| 1) Elevator_max) (= 0 (+ |Elevator_dir'| 1))) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (= 1 |Elevator_dir'|))) (<= Elevator_qCSP 2)) (or (<= |Elevator_goal'| Elevator_max) (not (= Elevator_qCSP 2)) (<= |Elevator_goal'| |Elevator_current'|)) (or (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (not (= Elevator_qCSP 2))))) (or (not (= Elevator_qCSP 3)) (and (or (= 1 |Elevator_dir'|) (and (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (or (<= (+ Elevator_min 2) |Elevator_current'|) (= Elevator_min |Elevator_goal'|)))) (or (<= (+ |Elevator_current'| 2) Elevator_max) (and (= Elevator_max |Elevator_goal'|) (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3)) (< |Elevator_current'| |Elevator_goal'|)) (= 0 (+ |Elevator_dir'| 1)))))), 205#(or (and (not (= Elevator_qCSP 3)) (not (= Elevator_qCSP 2))) (and (or (<= (+ |Elevator_current'| 1) Elevator_max) (= 0 (+ |Elevator_dir'| 1))) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (= 1 |Elevator_dir'|)) (= Elevator_qCSP 3)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (<= Elevator_qCSP 2) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (and (= Elevator_qDC1 2) (or (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3))) (<= 3 Elevator_qCSP))), 206#(or (and (or (<= (+ |Elevator_current'| 1) Elevator_max) (= 0 (+ |Elevator_dir'| 1))) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (= 1 |Elevator_dir'|)) (= Elevator_qCSP 3)) (and (or (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (not (= Elevator_qCSP 2))) (<= Elevator_qCSP 2)) (and (= Elevator_qDC1 2) (or (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= |Elevator_current'| Elevator_max) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3))) (<= 3 Elevator_qCSP)) (and (not (= Elevator_qCSP 3)) (<= 3 Elevator_qCSP))), 207#(or (not (= Elevator_qCSP 3)) (and (= 0 (+ |Elevator_dir'| 1)) (or (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (= 1 |Elevator_dir'|))) (not (= Elevator_qDC1 1)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= |Elevator_current'| Elevator_max) (or (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (= 1 |Elevator_dir'|))))] [2018-07-23 13:36:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:30,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:36:30,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:36:30,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:36:30,810 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-07-23 13:36:31,122 WARN L169 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2018-07-23 13:36:31,349 WARN L169 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-07-23 13:36:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:31,420 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:36:31,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:36:31,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-07-23 13:36:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:31,424 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:36:31,424 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:36:31,425 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:36:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:36:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:36:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:36:31,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-07-23 13:36:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:31,437 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:36:31,437 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:36:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:36:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:36:31,438 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:31,438 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-07-23 13:36:31,440 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1634958222, now seen corresponding path program 5 times [2018-07-23 13:36:31,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:32,265 WARN L169 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 47 [2018-07-23 13:36:33,102 WARN L169 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 57 [2018-07-23 13:36:33,643 WARN L169 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 58 [2018-07-23 13:36:34,195 WARN L169 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 73 [2018-07-23 13:36:34,783 WARN L169 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 74 [2018-07-23 13:36:35,169 WARN L169 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 61 [2018-07-23 13:36:35,512 WARN L169 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 53 [2018-07-23 13:36:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:35,710 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:36:35,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,714 INFO L185 omatonBuilderFactory]: Interpolants [288#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|)), 276#true, 277#false, 278#(and (<= |Elevator_current'| Elevator_max) (= Elevator_qDC1 1) (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 1) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|)), 279#(and (not (= Elevator_qDC1 2)) (or (= Elevator_qDC2 1) (not (= Elevator_qCSP 1))) (or (<= Elevator_qCSP 1) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= |Elevator_current'| Elevator_max) (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)))) (or (and (= Elevator_qCSP 2) (<= Elevator_min |Elevator_goal'|) (or (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 2)) (or (and (<= |Elevator_current'| Elevator_max) (<= |Elevator_current'| |Elevator_goal'|)) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= |Elevator_current'| Elevator_max) (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|))))) (and (<= 1 Elevator_qCSP) (not (= Elevator_qCSP 2)) (or (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 2)) (or (and (<= |Elevator_current'| Elevator_max) (<= |Elevator_current'| |Elevator_goal'|)) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= |Elevator_current'| Elevator_max) (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)))))) (or (and (<= 1 Elevator_qDC1) (= Elevator_qDC2 2) (<= |Elevator_goal'| Elevator_max) (<= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|))), 280#(and (or (<= |Elevator_current'| Elevator_max) (not (= Elevator_qCSP 1))) (or (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2) (<= Elevator_min |Elevator_goal'|)) (and (= Elevator_qCSP 2) (= Elevator_qDC2 2)) (and (<= Elevator_qCSP 1) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= |Elevator_goal'| |Elevator_current'|))) (or (and (<= |Elevator_current'| Elevator_max) (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= 2 Elevator_qCSP) (<= Elevator_min |Elevator_goal'|)) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max)) (and (< 0 Elevator_qDC1) (or (= 1 |Elevator_dir'|) (<= Elevator_qCSP 2)) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (not (= Elevator_qCSP 1)) (<= Elevator_qDC1 1)) (and (<= Elevator_qCSP 1) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= |Elevator_goal'| |Elevator_current'|)))), 281#(and (or (and (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_min |Elevator_current'|) (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|)) (and (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= 2 Elevator_qCSP) (<= Elevator_min |Elevator_goal'|)) (and (< 0 Elevator_qDC1) (or (= 1 |Elevator_dir'|) (<= Elevator_qCSP 2)) (<= Elevator_min |Elevator_current'|) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= Elevator_qDC1 1)) (and (<= Elevator_qCSP 1) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= |Elevator_goal'| |Elevator_current'|))) (or (and (<= |Elevator_current'| Elevator_max) (or (= Elevator_qDC2 2) (and (<= Elevator_qCSP 1) (< |Elevator_current'| (+ |Elevator_goal'| 1)))) (<= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 1))) (or (and (<= |Elevator_current'| Elevator_max) (or (= Elevator_qDC2 2) (and (<= Elevator_qCSP 1) (< |Elevator_current'| (+ |Elevator_goal'| 1)))) (<= |Elevator_goal'| |Elevator_current'|)) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (and (<= Elevator_qCSP 1) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= |Elevator_goal'| |Elevator_current'|)))), 282#(and (or (and (<= Elevator_qCSP 1) (not (= Elevator_qCSP 1))) (and (<= |Elevator_current'| Elevator_max) (<= Elevator_qCSP 1)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)) (or (<= (+ Elevator_min 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|))) (= Elevator_qCSP 3)) (or (not (= Elevator_qCSP 3)) (and (<= |Elevator_current'| Elevator_max) (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (not (= Elevator_qDC2 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (and (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3)) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (not (= Elevator_qDC1 1))) (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= |Elevator_goal'| |Elevator_current'|) (= Elevator_qDC2 3)) (not (= Elevator_qCSP 3)) (and (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|)))), 283#(and (or (and (<= Elevator_qCSP 1) (not (= Elevator_qCSP 1))) (and (or (<= (+ Elevator_min 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (not (= Elevator_qCSP 1)) (<= Elevator_qCSP 2)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|) (or (and (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)) (or (<= (+ Elevator_min 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (<= |Elevator_goal'| Elevator_max)) (<= Elevator_qCSP 1))) (= Elevator_qCSP 3)) (or (not (= Elevator_qCSP 3)) (and (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3)) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (not (= Elevator_qDC2 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (not (= Elevator_qDC1 1))) (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= |Elevator_goal'| |Elevator_current'|) (= Elevator_qDC2 3)) (not (= Elevator_qCSP 3)) (and (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|)))), 284#(or (and (not (= Elevator_qCSP 3)) (or (not (= Elevator_qCSP 2)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)))) (and (= Elevator_qDC1 2) (or (and (not (= Elevator_qDC2 3)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (and (not (= |Elevator_goal'| |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| 1) (+ |Elevator_goal'| |Elevator_dir'|)))) (not (= Elevator_qCSP 2))) (and (or (and (or (<= 2 Elevator_qDC1) (<= 3 Elevator_c3)) (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|))) (not (= Elevator_qCSP 2)))), 285#(or (and (= Elevator_qDC1 2) (not (= Elevator_qDC2 3)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (not (= Elevator_qCSP 2)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (and (not (= Elevator_qCSP 3)) (or (not (= Elevator_qCSP 2)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)))) (and (or (and (or (<= 2 Elevator_qDC1) (<= 3 Elevator_c3)) (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|))) (not (= Elevator_qCSP 2)))), 286#(or (not (= Elevator_qCSP 3)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (not (= Elevator_qDC1 1)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)))), 287#(and (<= |Elevator_current'| Elevator_max) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (<= 4 Elevator_qCSP) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (not (= Elevator_qDC1 1)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))) (<= Elevator_qCSP 2)) (<= Elevator_min |Elevator_current'|))] [2018-07-23 13:36:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,717 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:36:35,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:36:35,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:35,718 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-23 13:36:35,903 WARN L169 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 45 [2018-07-23 13:36:36,063 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-07-23 13:36:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:36,359 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:36:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:36:36,359 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 13:36:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:36,360 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:36:36,361 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:36:36,361 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:36:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:36:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:36:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:36:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:36:36,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-07-23 13:36:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:36,379 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:36:36,380 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:36:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:36:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:36:36,382 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:36,383 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-07-23 13:36:36,383 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash 763185728, now seen corresponding path program 6 times [2018-07-23 13:36:36,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:37,595 WARN L169 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 31 [2018-07-23 13:36:37,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:37,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:37,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:37,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:37,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:37,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:38,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:38,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:38,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:38,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:38,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:38,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:38,560 WARN L169 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 51 [2018-07-23 13:36:38,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:39,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:39,340 WARN L169 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 69 [2018-07-23 13:36:39,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:39,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:40,171 WARN L169 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 328 DAG size of output: 68 [2018-07-23 13:36:40,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:40,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:41,480 WARN L169 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 422 DAG size of output: 101 [2018-07-23 13:36:42,901 WARN L169 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 428 DAG size of output: 105 [2018-07-23 13:36:44,051 WARN L169 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 285 DAG size of output: 92 [2018-07-23 13:36:45,209 WARN L169 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 286 DAG size of output: 92 [2018-07-23 13:36:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:45,451 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:45,451 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:36:45,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:45,456 INFO L185 omatonBuilderFactory]: Interpolants [365#true, 366#false, 367#(and (= Elevator_qDC1 1) (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 1) (<= |Elevator_goal'| Elevator_max) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|)), 368#(and (<= 1 Elevator_qDC1) (or (= Elevator_qCSP 2) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|))) (<= |Elevator_goal'| Elevator_max) (or (= Elevator_qCSP 2) (= Elevator_qDC2 1)) (<= Elevator_qDC1 1) (or (<= Elevator_qCSP 1) (and (= Elevator_qDC2 2) (<= Elevator_min |Elevator_goal'|))) (or (<= Elevator_qCSP 1) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))), 369#(and (or (= Elevator_qDC2 1) (not (= Elevator_qCSP 1))) (< 0 Elevator_qDC1) (or (<= Elevator_qCSP 1) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= Elevator_min |Elevator_goal'|))) (or (= Elevator_qCSP 2) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qCSP 3)) (<= |Elevator_goal'| Elevator_max) (or (= 1 |Elevator_dir'|) (<= Elevator_qCSP 2) (<= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_qDC1 1) (or (<= Elevator_qCSP 1) (= Elevator_qDC2 2)) (or (<= |Elevator_current'| |Elevator_goal'|) (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2))), 370#(and (or (not (= Elevator_qCSP 1)) (= |Elevator_current'| |Elevator_goal'|)) (or (and (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3)) (not (= Elevator_qCSP 2))) (or (and (or (= 0 (+ |Elevator_dir'| 1)) (= 1 |Elevator_dir'|)) (or (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3)))) (not (= Elevator_qCSP 3))) (or (<= Elevator_qCSP 1) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (or (<= |Elevator_current'| |Elevator_goal'|) (<= Elevator_min |Elevator_goal'|)) (or (= 1 |Elevator_dir'|) (<= Elevator_qCSP 2) (<= |Elevator_goal'| |Elevator_current'|)) (or (<= |Elevator_current'| |Elevator_goal'|) (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2))) (and (= Elevator_qCSP 2) (= Elevator_qDC2 2))) (or (<= Elevator_qCSP 1) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|)) (<= 3 Elevator_qCSP))), 371#(and (or (<= Elevator_min |Elevator_current'|) (not (= Elevator_qCSP 2))) (or (<= Elevator_qCSP 1) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (or (and (or (not (= Elevator_qCSP 1)) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|))) (or (<= Elevator_qCSP 1) (<= 3 Elevator_qCSP))) (and (= Elevator_qCSP 2) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)))) (or (<= |Elevator_current'| |Elevator_goal'|) (<= Elevator_min |Elevator_goal'|)) (or (<= Elevator_qCSP 2) (<= |Elevator_goal'| |Elevator_current'|) (and (or (= 0 (+ |Elevator_dir'| 1)) (= 1 |Elevator_dir'|)) (not (= 0 (+ |Elevator_dir'| 1))))) (or (= Elevator_qDC2 2) (and (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3)) (not (= Elevator_qCSP 2))) (or (not (= Elevator_qCSP 3)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (or (= 0 (+ |Elevator_dir'| 1)) (= 1 |Elevator_dir'|)) (= Elevator_qDC2 3))))) (or (<= |Elevator_current'| |Elevator_goal'|) (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2))), 372#(and (or (not (= Elevator_qCSP 1)) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|))) (or (and (< 0 Elevator_qDC1) (not (= Elevator_qDC2 3)) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_qDC1 1) (or (and (not (= Elevator_qDC2 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (<= Elevator_min |Elevator_goal'|) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_goal'| 1) (+ |Elevator_current'| |Elevator_dir'|)) (= Elevator_qDC2 2)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))))))) (and (< 0 Elevator_qDC1) (not (= Elevator_qDC2 3)) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ Elevator_min 1) |Elevator_goal'|) (<= Elevator_qDC1 1) (or (and (not (= Elevator_qDC2 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (<= Elevator_min |Elevator_goal'|) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_goal'| 1) (+ |Elevator_current'| |Elevator_dir'|)) (= Elevator_qDC2 2)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))))))) (and (or (not (= Elevator_qCSP 2)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|))) (or (and (<= |Elevator_current'| |Elevator_goal'|) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|)) (not (= Elevator_qCSP 3)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|)) (and (<= Elevator_c2 Elevator_c3) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= 2 Elevator_qDC1) (<= 3 Elevator_qDC2) (<= Elevator_qDC2 3) (<= |Elevator_goal'| |Elevator_current'|))) (or (not (= Elevator_qCSP 3)) (<= (+ |Elevator_goal'| 1) (+ |Elevator_current'| |Elevator_dir'|)) (and (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3)) (<= Elevator_min |Elevator_goal'|)) (= Elevator_qDC2 2) (and (<= |Elevator_current'| Elevator_max) (= 0 (+ |Elevator_dir'| 1)) (<= (+ Elevator_min 1) |Elevator_goal'|)) (not (= Elevator_qDC1 1)) (<= (+ |Elevator_current'| 2) |Elevator_goal'|))))), 373#(and (or (and (or (not (= Elevator_qCSP 3)) (<= (+ |Elevator_goal'| 1) (+ |Elevator_current'| |Elevator_dir'|)) (and (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3)) (<= Elevator_min |Elevator_goal'|)) (= Elevator_qDC2 2) (not (= Elevator_qDC1 1)) (and (= 0 (+ |Elevator_dir'| 1)) (<= (+ Elevator_min 1) |Elevator_goal'|)) (<= (+ |Elevator_current'| 2) |Elevator_goal'|)) (not (= Elevator_qCSP 2)) (or (and (<= |Elevator_current'| |Elevator_goal'|) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|)) (not (= Elevator_qCSP 3)) (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|)) (and (<= Elevator_c2 Elevator_c3) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= 2 Elevator_qDC1) (<= 3 Elevator_qDC2) (<= Elevator_qDC2 3) (<= |Elevator_goal'| |Elevator_current'|)))) (and (or (and (or (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= Elevator_min |Elevator_goal'|)) (not (= Elevator_qCSP 2))) (or (not (= Elevator_qCSP 3)) (and (< 0 Elevator_qDC1) (not (= Elevator_qDC2 3)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_qDC1 1) (or (and (not (= Elevator_qDC2 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (<= Elevator_min |Elevator_goal'|) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_goal'| 1) (+ |Elevator_current'| |Elevator_dir'|)) (= Elevator_qDC2 2)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))))))))) (and (< 0 Elevator_qDC1) (not (= Elevator_qDC2 3)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ Elevator_min 1) |Elevator_goal'|) (<= Elevator_qDC1 1) (or (and (not (= Elevator_qDC2 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (<= Elevator_min |Elevator_goal'|) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_goal'| 1) (+ |Elevator_current'| |Elevator_dir'|)) (= Elevator_qDC2 2)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)))))))) (<= |Elevator_goal'| Elevator_max))) (or (and (<= |Elevator_current'| Elevator_max) (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 1)))), 374#(or (<= Elevator_qCSP 1) (and (<= 3 Elevator_qCSP) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)))) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= |Elevator_current'| Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|))) (<= |Elevator_goal'| Elevator_max) (<= Elevator_qCSP 2)) (and (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (<= |Elevator_current'| |Elevator_goal'|) (not (= Elevator_qDC2 1)) (<= 2 Elevator_qDC1) (or (and (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_goal'| |Elevator_dir'| 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)))) (<= 3 Elevator_qCSP)) (and (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)))) (= Elevator_qCSP 3)) (and (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)))) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= |Elevator_current'| Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|))) (<= |Elevator_goal'| Elevator_max)) (and (or (and (= Elevator_qDC1 2) (or (and (<= (+ |Elevator_dir'| 1) 0) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)))) (and (<= Elevator_c2 Elevator_c3) (<= |Elevator_current'| |Elevator_goal'|) (<= Elevator_qDC2 3) (< 2 Elevator_qDC2) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= |Elevator_goal'| Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|))) (<= 3 Elevator_qCSP))), 375#(or (<= Elevator_qCSP 1) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= |Elevator_current'| Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|))) (<= |Elevator_goal'| Elevator_max) (<= Elevator_qCSP 2)) (and (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (<= |Elevator_current'| |Elevator_goal'|) (not (= Elevator_qDC2 1)) (<= 2 Elevator_qDC1) (or (and (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_goal'| |Elevator_dir'| 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)))) (<= 3 Elevator_qCSP)) (and (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)))) (= Elevator_qCSP 3)) (and (or (and (= Elevator_qDC1 2) (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)))) (and (<= Elevator_c2 Elevator_c3) (<= |Elevator_current'| |Elevator_goal'|) (<= Elevator_qDC2 3) (< 2 Elevator_qDC2) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= |Elevator_goal'| Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|))) (<= 3 Elevator_qCSP)) (and (<= 3 Elevator_qCSP) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))))) (and (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)))) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= |Elevator_current'| Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|))) (<= |Elevator_goal'| Elevator_max))), 376#(or (not (= Elevator_qCSP 3)) (and (<= (+ |Elevator_current'| |Elevator_dir'| 1) Elevator_max) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= |Elevator_goal'| |Elevator_current'|)) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (not (= Elevator_qDC1 1)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)))), 377#(and (<= |Elevator_current'| Elevator_max) (or (not (= Elevator_qCSP 3)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (not (= Elevator_qDC1 1)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) (<= |Elevator_goal'| |Elevator_current'|))) (<= Elevator_min |Elevator_current'|)), 378#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|))] [2018-07-23 13:36:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:45,457 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:36:45,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:36:45,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:45,460 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-07-23 13:36:45,749 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 45 [2018-07-23 13:36:45,921 WARN L169 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 56 [2018-07-23 13:36:46,403 WARN L169 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 113 [2018-07-23 13:36:46,568 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-07-23 13:36:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:46,614 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:36:46,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:46,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-07-23 13:36:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:46,615 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:36:46,615 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:36:46,616 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:36:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:36:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:36:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:36:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 13:36:46,632 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-07-23 13:36:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:46,632 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 13:36:46,633 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:36:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 13:36:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:36:46,633 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:46,634 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-07-23 13:36:46,634 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:36:46,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1017916274, now seen corresponding path program 7 times [2018-07-23 13:36:46,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:48,715 WARN L169 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 37 [2018-07-23 13:36:50,213 WARN L169 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 475 DAG size of output: 55 [2018-07-23 13:36:50,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:50,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:50,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:51,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:51,411 WARN L169 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 472 DAG size of output: 53 [2018-07-23 13:36:51,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:53,079 WARN L169 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 428 DAG size of output: 95 [2018-07-23 13:36:53,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,613 WARN L169 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 432 DAG size of output: 95 [2018-07-23 13:36:55,981 WARN L169 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 464 DAG size of output: 117 [2018-07-23 13:36:57,563 WARN L169 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 389 DAG size of output: 132 [2018-07-23 13:36:58,827 WARN L169 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 393 DAG size of output: 128 [2018-07-23 13:36:59,668 WARN L169 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 85 [2018-07-23 13:37:00,397 WARN L169 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 90 [2018-07-23 13:37:00,555 WARN L169 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 39 [2018-07-23 13:37:00,689 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 25 [2018-07-23 13:37:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:37:00,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,725 INFO L185 omatonBuilderFactory]: Interpolants [480#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|)), 465#true, 466#false, 467#(and (= Elevator_qDC1 1) (<= 0 Elevator_c3) (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 1) (<= Elevator_min |Elevator_current'|) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|)), 468#(and (or (and (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|))) (and (<= Elevator_qCSP 1) (= |Elevator_goal'| |Elevator_current'|))) (not (= Elevator_qDC1 2)) (<= 0 Elevator_c3) (or (= |Elevator_goal'| |Elevator_current'|) (= Elevator_qDC2 2)) (<= 1 Elevator_qCSP) (<= Elevator_min |Elevator_current'|) (<= Elevator_min |Elevator_goal'|) (or (and (<= 1 Elevator_qDC1) (not (= |Elevator_goal'| |Elevator_current'|)) (<= |Elevator_goal'| Elevator_max) (<= Elevator_qDC1 1)) (and (<= Elevator_qDC2 1) (< 0 Elevator_qDC2)))), 469#(and (<= 0 Elevator_c3) (or (and (<= Elevator_min |Elevator_current'|) (<= |Elevator_goal'| Elevator_max)) (<= Elevator_qCSP 1) (= Elevator_qCSP 3)) (or (and (= Elevator_qDC2 1) (= Elevator_qCSP 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (or (<= 2 Elevator_qCSP) (= |Elevator_current'| |Elevator_goal'|)) (<= Elevator_min |Elevator_goal'|) (or (= Elevator_qCSP 2) (not (= Elevator_qDC2 2)) (and (< 0 Elevator_qDC1) (or (<= |Elevator_current'| |Elevator_goal'|) (= 0 (+ |Elevator_dir'| 1))) (<= |Elevator_goal'| Elevator_max) (<= Elevator_qDC1 1) (or (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= 1 |Elevator_dir'|)))) (or (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)) (= |Elevator_current'| |Elevator_goal'|))), 470#(and (or (and (<= Elevator_min |Elevator_current'|) (<= |Elevator_goal'| Elevator_max)) (<= Elevator_qCSP 1)) (<= 0 Elevator_c3) (or (and (or (<= Elevator_qCSP 1) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= Elevator_min |Elevator_goal'|)) (< |Elevator_current'| |Elevator_goal'|)) (or (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)) (and (= Elevator_qDC2 1) (= Elevator_qCSP 1))) (or (<= 2 Elevator_qCSP) (= |Elevator_current'| |Elevator_goal'|)) (or (= Elevator_qCSP 2) (not (= Elevator_qDC2 2)) (and (< 0 Elevator_qDC1) (or (and (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (<= Elevator_qDC1 1)))), 471#(and (or (<= 0 Elevator_c3) (= Elevator_qDC2 2)) (or (and (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3))) (= |Elevator_current'| |Elevator_goal'|)) (or (= Elevator_qCSP 2) (and (or (not (= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qDC2 1) (= Elevator_qDC2 3)) (or (= |Elevator_goal'| |Elevator_current'|) (and (or (and (<= |Elevator_goal'| Elevator_max) (= 0 (+ |Elevator_dir'| 1)) (<= (+ Elevator_min 2) |Elevator_current'|)) (and (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|) (<= Elevator_qCSP 2))) (or (and (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (not (= Elevator_qDC2 2)) (and (<= Elevator_qCSP 1) (or (<= |Elevator_current'| |Elevator_goal'|) (<= Elevator_min |Elevator_goal'|) (<= 3 Elevator_qCSP))) (= 1 |Elevator_dir'|)))) (or (and (<= Elevator_qCSP 1) (or (<= |Elevator_current'| |Elevator_goal'|) (<= Elevator_min |Elevator_goal'|) (<= 3 Elevator_qCSP))) (and (or (not (= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qDC1 2)) (or (and (or (<= |Elevator_current'| |Elevator_goal'|) (<= Elevator_min |Elevator_goal'|) (<= 3 Elevator_qCSP)) (or (and (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (not (= Elevator_qCSP 3)) (= 1 |Elevator_dir'|) (not (= Elevator_qDC1 1))) (or (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_min (+ |Elevator_goal'| |Elevator_dir'| 1)) (<= |Elevator_goal'| |Elevator_current'|)) (= 1 |Elevator_dir'|))) (= |Elevator_goal'| |Elevator_current'|)) (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)))))) (or (and (<= Elevator_min |Elevator_current'|) (= |Elevator_current'| |Elevator_goal'|)) (not (= Elevator_qCSP 1))) (or (<= Elevator_qCSP 1) (and (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_min |Elevator_current'|) (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|)) (<= 3 Elevator_qCSP))), 472#(and (or (not (= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qDC2 1) (= Elevator_qDC2 3)) (or (not (= Elevator_qCSP 1)) (= |Elevator_current'| |Elevator_goal'|)) (or (<= 0 Elevator_c3) (= Elevator_qDC2 2)) (or (and (not (= Elevator_qDC2 1)) (not (= Elevator_qDC2 3))) (= |Elevator_current'| |Elevator_goal'|)) (or (<= Elevator_qCSP 1) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= 3 Elevator_qCSP)) (or (= |Elevator_goal'| |Elevator_current'|) (and (or (and (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (and (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= |Elevator_goal'| Elevator_max))) (or (and (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (= Elevator_qCSP 2) (not (= Elevator_qDC2 2)) (<= Elevator_qCSP 1) (= 1 |Elevator_dir'|)))) (or (<= Elevator_qCSP 1) (<= |Elevator_goal'| Elevator_max) (= Elevator_qCSP 3)) (or (and (or (not (= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qDC1 2)) (or (= |Elevator_goal'| |Elevator_current'|) (and (or (<= Elevator_min |Elevator_goal'|) (<= 3 Elevator_qCSP)) (or (and (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (not (= Elevator_qCSP 3)) (= 1 |Elevator_dir'|) (not (= Elevator_qDC1 1))) (or (<= 1 |Elevator_dir'|) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_min (+ |Elevator_goal'| |Elevator_dir'| 1)) (<= |Elevator_goal'| |Elevator_current'|))))) (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (and (or (<= Elevator_min |Elevator_goal'|) (<= 3 Elevator_qCSP)) (<= Elevator_qCSP 2))) (or (<= Elevator_min |Elevator_current'|) (and (not (= |Elevator_goal'| |Elevator_current'|)) (<= 3 Elevator_qCSP)))), 473#(and (or (and (or (<= 0 Elevator_c3) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)) (not (= Elevator_qCSP 2))) (or (= Elevator_qCSP 2) (= Elevator_qCSP 1))) (and (or (<= Elevator_qCSP 1) (and (not (= Elevator_qDC2 1)) (<= Elevator_min |Elevator_goal'|) (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (not (= |Elevator_goal'| |Elevator_current'|)) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|)))) (not (= Elevator_qDC2 1)) (or (and (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| 1) (+ |Elevator_goal'| |Elevator_dir'|))) (and (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (or (<= (+ Elevator_min 2) |Elevator_current'|) (= |Elevator_current'| (+ |Elevator_goal'| 1)))) (and (<= Elevator_min |Elevator_current'|) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (<= Elevator_qCSP 2)) (<= |Elevator_goal'| Elevator_max)) (not (= Elevator_qDC1 1))) (or (not (= Elevator_qCSP 3)) (and (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (= 1 |Elevator_dir'|))))) (= Elevator_qDC2 3)) (or (<= 0 Elevator_c3) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2))))) (or (<= Elevator_min |Elevator_current'|) (not (= Elevator_qCSP 1))) (or (<= Elevator_qCSP 1) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= Elevator_min |Elevator_current'|) (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|)) (<= 3 Elevator_qCSP)) (or (= Elevator_qCSP 2) (and (or (not (= Elevator_qDC1 1)) (and (or (<= Elevator_min |Elevator_goal'|) (<= Elevator_qDC2 3) (and (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (or (<= (+ Elevator_min 2) |Elevator_current'|) (= |Elevator_current'| (+ |Elevator_goal'| 1)))) (and (<= Elevator_min |Elevator_current'|) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|)) (<= Elevator_qCSP 2)) (<= |Elevator_goal'| Elevator_max))) (or (= Elevator_qDC2 2) (= Elevator_qDC2 3) (= |Elevator_current'| |Elevator_goal'|)))) (or (and (or (<= Elevator_c2 Elevator_c3) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))) (and (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= Elevator_min |Elevator_goal'|)) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| |Elevator_current'|)))) (<= Elevator_qCSP 2) (and (<= |Elevator_dir'| 0) (<= Elevator_min |Elevator_goal'|) (<= 0 |Elevator_dir'|) (not (= |Elevator_current'| |Elevator_goal'|))))) (= Elevator_qCSP 1)) (or (<= Elevator_qCSP 1) (<= 2 Elevator_qDC1) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))), 474#(and (or (and (or (<= 0 Elevator_c3) (not (= Elevator_qDC2 3))) (or (and (not (= |Elevator_goal'| |Elevator_current'|)) (or (<= Elevator_c2 Elevator_c3) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'| 1)) (or (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (= |Elevator_current'| |Elevator_goal'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (and (<= (+ |Elevator_dir'| Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (or (= |Elevator_current'| (+ |Elevator_goal'| |Elevator_dir'| 1)) (<= (+ |Elevator_dir'| Elevator_min 2) |Elevator_current'|))))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|)))) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (and (or (and (<= Elevator_min |Elevator_goal'|) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|)) (and (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (= |Elevator_current'| |Elevator_goal'|)) (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)))) (or (<= 3 Elevator_c2) (and (<= |Elevator_dir'| 0) (= |Elevator_goal'| |Elevator_current'|) (<= 0 |Elevator_dir'|)) (not (= Elevator_qDC1 1)) (and (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_min |Elevator_goal'|) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|)) (and (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (and (not (= |Elevator_goal'| |Elevator_current'|)) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= |Elevator_goal'| Elevator_max) (= 0 (+ |Elevator_dir'| 1))) (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|)))))) (or (and (not (= Elevator_qDC2 1)) (or (and (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (<= |Elevator_current'| |Elevator_goal'|))) (<= Elevator_min |Elevator_goal'|) (or (and (<= |Elevator_goal'| (+ |Elevator_current'| |Elevator_dir'|)) (= 0 (+ |Elevator_dir'| 1))) (not (= Elevator_qDC1 1)))) (and (not (= Elevator_qDC2 1)) (or (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (= Elevator_qDC1 2) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))) (and (not (= |Elevator_goal'| |Elevator_current'|)) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (= Elevator_qDC1 2)) (and (= Elevator_qDC1 2) (or (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'| 1)) (or (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (= |Elevator_current'| |Elevator_goal'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (and (<= (+ |Elevator_dir'| Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (or (= |Elevator_current'| (+ |Elevator_goal'| |Elevator_dir'| 1)) (<= (+ |Elevator_dir'| Elevator_min 2) |Elevator_current'|))))) (and (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|)))) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (= 1 |Elevator_dir'|))))))) (= Elevator_qDC2 3))) (<= Elevator_qCSP 2)) (or (<= |Elevator_goal'| Elevator_max) (not (= Elevator_qCSP 2))) (or (not (= Elevator_qCSP 2)) (not (= |Elevator_current'| |Elevator_goal'|))) (or (<= Elevator_min |Elevator_goal'|) (not (= Elevator_qCSP 2)))), 475#(and (or (and (or (<= 0 Elevator_c3) (not (= Elevator_qDC2 3))) (or (and (not (= Elevator_qDC2 1)) (or (and (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (<= |Elevator_current'| |Elevator_goal'|))) (<= Elevator_min |Elevator_goal'|) (or (and (<= |Elevator_goal'| (+ |Elevator_current'| |Elevator_dir'|)) (= 0 (+ |Elevator_dir'| 1))) (not (= Elevator_qDC1 1)))) (and (not (= Elevator_qDC2 1)) (or (and (= Elevator_qDC1 2) (or (and (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))))) (and (or (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'| 1)) (= Elevator_qDC1 2) (or (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (= |Elevator_current'| |Elevator_goal'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (and (= Elevator_qDC1 2) (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (and (or (and (<= |Elevator_dir'| 0) (<= |Elevator_goal'| Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= 0 |Elevator_dir'|)) (and (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| 1) (+ |Elevator_goal'| |Elevator_dir'|)))) (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)))))) (not (= |Elevator_goal'| |Elevator_current'|))))) (= Elevator_qDC2 3)) (or (and (not (= |Elevator_goal'| |Elevator_current'|)) (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (<= 3 Elevator_c2) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= (+ Elevator_min 1) |Elevator_current'|) (<= |Elevator_goal'| Elevator_max) (= 0 (+ |Elevator_dir'| 1))) (and (<= |Elevator_dir'| 0) (= |Elevator_goal'| |Elevator_current'|) (<= 0 |Elevator_dir'|)) (not (= Elevator_qDC1 1)) (and (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_min |Elevator_goal'|) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|)) (and (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)))))) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (and (or (<= Elevator_c2 Elevator_c3) (and (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_dir'| Elevator_min 2) |Elevator_current'|)) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'| 1)) (or (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (= |Elevator_current'| |Elevator_goal'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max))) (not (= |Elevator_goal'| |Elevator_current'|))) (and (or (and (<= Elevator_min |Elevator_goal'|) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_goal'| |Elevator_dir'|) (+ Elevator_max 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (and (<= |Elevator_current'| |Elevator_goal'|) (<= |Elevator_goal'| Elevator_max) (= 1 |Elevator_dir'|)) (and (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (= |Elevator_current'| |Elevator_goal'|)) (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|))))) (<= Elevator_qCSP 2)) (or (<= |Elevator_goal'| Elevator_max) (not (= Elevator_qCSP 2))) (or (not (= Elevator_qCSP 2)) (not (= |Elevator_current'| |Elevator_goal'|))) (or (<= Elevator_min |Elevator_goal'|) (not (= Elevator_qCSP 2)))), 476#(or (and (or (and (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max)) (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (= Elevator_qDC1 2) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (not (= Elevator_qDC2 1)) (= 0 (+ |Elevator_dir'| 1)) (<= |Elevator_goal'| |Elevator_current'|))) (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (not (= |Elevator_goal'| |Elevator_current'|))) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (<= 3 Elevator_c2) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))) (not (= Elevator_qDC1 1)))) (and (<= (+ |Elevator_current'| 1) Elevator_min) (= 0 (+ |Elevator_dir'| 1)))) (<= 3 Elevator_qCSP)) (and (or (not (= Elevator_qCSP 2)) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (not (= |Elevator_goal'| |Elevator_current'|)))) (or (= Elevator_qCSP 2) (<= Elevator_qCSP 1)))), 477#(and (or (and (<= (+ |Elevator_current'| 1) Elevator_min) (or (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (= 0 (+ |Elevator_dir'| 1)))) (and (or (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (not (= |Elevator_goal'| |Elevator_current'|))) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (<= 3 Elevator_c2) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|)) (not (= Elevator_qDC1 1)) (<= Elevator_qCSP 2)) (or (and (not (= |Elevator_goal'| |Elevator_current'|)) (or (and (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))))) (and (= Elevator_qDC1 2) (or (and (<= |Elevator_dir'| 1) (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|))) (and (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (< |Elevator_current'| (+ |Elevator_goal'| 1)) (not (= Elevator_qDC2 1)) (= 0 (+ |Elevator_dir'| 1)) (<= |Elevator_goal'| |Elevator_current'|)))) (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC2 3)) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|)) (<= Elevator_qCSP 2)))) (or (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (not (= Elevator_qCSP 2)))), 478#(or (and (= Elevator_qDC2 3) (<= 3 Elevator_c3)) (and (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max)) (not (= Elevator_qCSP 3)) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_min) (= 0 (+ |Elevator_dir'| 1))) (not (= Elevator_qDC1 1)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (or (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)) (and (<= (+ |Elevator_dir'| 1) 0) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))))) (and (or (<= (+ Elevator_min 1) (+ |Elevator_current'| |Elevator_dir'|)) (and (<= (+ |Elevator_dir'| 1) 0) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)))) (= 0 (+ |Elevator_dir'| 1)))), 479#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|) (or (and (= Elevator_qDC2 3) (<= 3 Elevator_c3)) (not (= Elevator_qCSP 3)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (not (= Elevator_qDC1 1))))] [2018-07-23 13:37:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:37:00,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:37:00,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:00,727 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-07-23 13:37:01,083 WARN L169 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 85 [2018-07-23 13:37:01,451 WARN L169 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 100 [2018-07-23 13:37:01,881 WARN L169 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 110 [2018-07-23 13:37:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,035 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:37:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:02,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-07-23 13:37:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,036 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:37:02,036 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:37:02,037 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=192, Invalid=314, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:37:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:37:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:37:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:37:02,057 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-07-23 13:37:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,058 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:37:02,058 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:37:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:37:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:37:02,058 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,059 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-07-23 13:37:02,059 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0AssertViolationASSERT]=== [2018-07-23 13:37:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1035010908, now seen corresponding path program 8 times [2018-07-23 13:37:02,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,839 WARN L169 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 32 [2018-07-23 13:37:05,216 WARN L169 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 29 [2018-07-23 13:37:06,060 WARN L169 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 420 DAG size of output: 58 [2018-07-23 13:37:06,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:06,666 WARN L169 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 69 [2018-07-23 13:37:07,861 WARN L169 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 625 DAG size of output: 60 [2018-07-23 13:37:10,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:10,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:11,516 WARN L169 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 1219 DAG size of output: 131 [2018-07-23 13:37:15,024 WARN L169 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 1236 DAG size of output: 105 [2018-07-23 13:37:16,313 WARN L169 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 600 DAG size of output: 104 [2018-07-23 13:37:17,169 WARN L169 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 69 [2018-07-23 13:37:17,994 WARN L169 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 67 [2018-07-23 13:37:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:18,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:37:18,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,238 INFO L185 omatonBuilderFactory]: Interpolants [577#true, 578#false, 579#(and (= Elevator_qDC1 1) (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 1) (<= Elevator_min |Elevator_goal'|) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|)), 580#(and (or (not (= Elevator_qDC2 2)) (and (= Elevator_qCSP 2) (<= Elevator_min |Elevator_goal'|))) (<= 1 Elevator_qDC1) (or (= |Elevator_goal'| |Elevator_current'|) (<= |Elevator_goal'| Elevator_max)) (or (= Elevator_qDC2 2) (and (<= Elevator_qCSP 1) (<= 1 Elevator_qCSP) (= |Elevator_goal'| |Elevator_current'|) (= Elevator_qDC2 1) (<= Elevator_min |Elevator_goal'|))) (<= Elevator_qDC1 1) (or (not (= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 2)))), 581#(and (<= 1 Elevator_qDC1) (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|) (<= Elevator_qDC1 1) (or (and (not (= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qDC2 2)) (not (= Elevator_qCSP 2))) (or (= Elevator_qCSP 2) (and (<= Elevator_qCSP 1) (<= 1 Elevator_qCSP) (= |Elevator_goal'| |Elevator_current'|) (= Elevator_qDC2 1)))), 582#(and (or (= Elevator_qCSP 2) (and (or (= 1 |Elevator_dir'|) (<= |Elevator_goal'| |Elevator_current'|)) (= Elevator_qCSP 3)) (and (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= |Elevator_goal'| |Elevator_current'|))) (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= Elevator_qCSP 1)) (< 0 Elevator_qDC1) (or (and (<= Elevator_qDC2 1) (< 0 Elevator_qDC2)) (not (= Elevator_qCSP 1))) (not (= Elevator_qDC2 3)) (<= |Elevator_goal'| Elevator_max) (or (and (<= Elevator_min |Elevator_goal'|) (or (and (not (= Elevator_qCSP 3)) (= Elevator_qDC2 2)) (= Elevator_qCSP 1))) (and (not (= Elevator_qDC2 1)) (<= Elevator_min |Elevator_goal'|) (or (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (= Elevator_qCSP 3))) (<= Elevator_qDC1 1)), 583#(and (or (and (<= 2 Elevator_qCSP) (<= Elevator_qCSP 2)) (and (not (= Elevator_qCSP 3)) (= Elevator_qDC2 1) (not (= Elevator_qCSP 2)) (= |Elevator_current'| |Elevator_goal'|)) (= Elevator_qCSP 3)) (or (<= 0 Elevator_c3) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)) (= Elevator_qDC2 1)) (or (and (or (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_qDC2 1) (<= 3 Elevator_qDC2)) (or (= 0 (+ |Elevator_dir'| 1)) (= 1 |Elevator_dir'|)) (or (<= |Elevator_current'| |Elevator_goal'|) (= 0 (+ |Elevator_dir'| 1))) (or (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 3)) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2))) (= Elevator_qCSP 3)) (and (or (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_qDC2 1) (<= 3 Elevator_qDC2)) (or (= Elevator_qCSP 2) (and (<= Elevator_qCSP 1) (<= 1 Elevator_qCSP))) (or (and (not (= Elevator_qCSP 3)) (= Elevator_qDC2 1) (not (= Elevator_qCSP 2)) (= |Elevator_current'| |Elevator_goal'|)) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2))))) (<= |Elevator_goal'| Elevator_max) (<= Elevator_min |Elevator_goal'|) (or (and (or (and (<= 2 Elevator_qCSP) (<= Elevator_qCSP 2)) (= 1 |Elevator_dir'|)) (or (and (not (= Elevator_qCSP 3)) (= Elevator_qDC2 1) (not (= Elevator_qCSP 2)) (= |Elevator_current'| |Elevator_goal'|)) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)))) (<= |Elevator_goal'| |Elevator_current'|))), 584#(and (or (and (or (and (<= 2 Elevator_qCSP) (<= Elevator_qCSP 2)) (= 1 |Elevator_dir'|)) (= Elevator_qDC2 2)) (<= |Elevator_goal'| |Elevator_current'|)) (or (and (<= 2 Elevator_qCSP) (<= Elevator_qCSP 2)) (<= |Elevator_current'| |Elevator_goal'|) (= 0 (+ |Elevator_dir'| 1))) (or (= Elevator_qDC2 1) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= Elevator_qDC2 3)) (<= |Elevator_goal'| Elevator_max) (or (not (= Elevator_qDC2 3)) (= Elevator_qCSP 3)) (<= Elevator_min |Elevator_goal'|) (or (not (= Elevator_qDC2 1)) (= Elevator_qCSP 1)) (or (= |Elevator_goal'| |Elevator_current'|) (<= 2 Elevator_qCSP) (<= Elevator_qCSP 0)) (or (<= |Elevator_current'| |Elevator_goal'|) (= Elevator_qDC2 2)) (or (not (= Elevator_qDC2 3)) (and (<= 0 Elevator_c3) (<= Elevator_c2 Elevator_c3) (<= 2 Elevator_qDC1)))), 585#(or (and (<= |Elevator_current'| |Elevator_goal'|) (<= 3 Elevator_qDC2) (not (= Elevator_qCSP 2)) (<= Elevator_qDC2 3) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|) (<= 3 Elevator_c3)) (and (or (and (or (<= (+ |Elevator_current'| 1) Elevator_max) (= |Elevator_current'| |Elevator_goal'|)) (= Elevator_qCSP 1)) (not (= Elevator_qCSP 1))) (or (and (or (and (or (<= (+ Elevator_max 1) |Elevator_goal'|) (= |Elevator_goal'| |Elevator_current'|) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= 2 Elevator_qDC2))) (or (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= Elevator_qDC2 2) (not (= |Elevator_goal'| |Elevator_current'|)) (<= 2 Elevator_qDC2)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3) (<= 3 Elevator_qCSP)) (and (or (<= (+ |Elevator_current'| 1) Elevator_max) (= |Elevator_current'| |Elevator_goal'|)) (= Elevator_qCSP 1)) (and (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_min |Elevator_goal'|)))) (< |Elevator_current'| |Elevator_goal'|)) (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2) (or (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (= Elevator_qDC2 2) (= 1 |Elevator_dir'|)) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2) (<= Elevator_qCSP 2))) (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (or (and (or (<= (+ Elevator_max 1) |Elevator_goal'|) (= |Elevator_goal'| |Elevator_current'|) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= 2 Elevator_qDC2))) (or (not (= |Elevator_goal'| |Elevator_current'|)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3) (<= 3 Elevator_qCSP)) (and (= Elevator_qDC1 2) (not (= Elevator_qDC2 1)) (or (and (= (+ |Elevator_dir'| 1) 0) (<= (+ |Elevator_current'| 1) Elevator_max)) (and (= |Elevator_dir'| 1) (<= (+ Elevator_min 1) |Elevator_goal'|))) (not (= Elevator_qDC2 3)) (or (<= Elevator_qDC2 1) (<= 3 Elevator_qDC2)) (= Elevator_qCSP 3)) (and (<= Elevator_c2 Elevator_c3) (<= 2 Elevator_qDC1) (or (<= 0 Elevator_c3) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|))) (<= Elevator_qDC2 3) (< 2 Elevator_qDC2) (<= 3 Elevator_qCSP)))) (< |Elevator_current'| |Elevator_goal'|) (= Elevator_qCSP 1)) (or (not (= Elevator_qCSP 3)) (= 1 |Elevator_dir'|) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|))) (and (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 3)) (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)) (<= |Elevator_goal'| |Elevator_current'|))) (and (or (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (= Elevator_qDC2 2) (= 1 |Elevator_dir'|)) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2) (<= Elevator_qCSP 2))) (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (or (and (or (<= (+ Elevator_max 1) |Elevator_goal'|) (= |Elevator_goal'| |Elevator_current'|) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= 2 Elevator_qDC2))) (or (not (= |Elevator_goal'| |Elevator_current'|)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3) (<= 3 Elevator_qCSP)) (and (= Elevator_qDC1 2) (not (= Elevator_qDC2 1)) (or (and (= (+ |Elevator_dir'| 1) 0) (<= (+ |Elevator_current'| 1) Elevator_max)) (and (= |Elevator_dir'| 1) (<= (+ Elevator_min 1) |Elevator_goal'|))) (not (= Elevator_qDC2 3)) (or (<= Elevator_qDC2 1) (<= 3 Elevator_qDC2)) (= Elevator_qCSP 3)) (and (<= Elevator_c2 Elevator_c3) (<= 2 Elevator_qDC1) (or (<= 0 Elevator_c3) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|))) (<= Elevator_qDC2 3) (< 2 Elevator_qDC2) (<= 3 Elevator_qCSP)))) (< |Elevator_current'| |Elevator_goal'|) (= Elevator_qCSP 1)) (or (not (= Elevator_qCSP 3)) (= 1 |Elevator_dir'|) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|))) (and (or (and (or (<= (+ Elevator_max 1) |Elevator_goal'|) (= |Elevator_goal'| |Elevator_current'|) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= 2 Elevator_qDC2))) (or (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= Elevator_qDC2 2) (not (= |Elevator_goal'| |Elevator_current'|)) (<= 2 Elevator_qDC2)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3) (<= 3 Elevator_qCSP)) (and (or (<= (+ |Elevator_current'| 1) Elevator_max) (= |Elevator_current'| |Elevator_goal'|)) (= Elevator_qCSP 1)) (and (= Elevator_qCSP 2) (not (= |Elevator_goal'| |Elevator_current'|)) (<= Elevator_min |Elevator_goal'|)))) (< |Elevator_current'| |Elevator_goal'|)) (or (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (= Elevator_qDC2 2) (= 1 |Elevator_dir'|)) (= Elevator_qCSP 1) (<= |Elevator_goal'| |Elevator_current'|) (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2) (<= Elevator_qCSP 2))) (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (or (and (or (<= (+ Elevator_max 1) |Elevator_goal'|) (= |Elevator_goal'| |Elevator_current'|) (and (or (< |Elevator_current'| (+ |Elevator_goal'| 1)) (<= Elevator_min |Elevator_goal'|)) (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= 2 Elevator_qDC2))) (or (not (= |Elevator_goal'| |Elevator_current'|)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3) (<= 3 Elevator_qCSP)) (and (= Elevator_qDC1 2) (not (= Elevator_qDC2 1)) (or (and (= (+ |Elevator_dir'| 1) 0) (<= (+ |Elevator_current'| 1) Elevator_max)) (and (= |Elevator_dir'| 1) (<= (+ Elevator_min 1) |Elevator_goal'|))) (not (= Elevator_qDC2 3)) (or (<= Elevator_qDC2 1) (<= 3 Elevator_qDC2)) (= Elevator_qCSP 3)) (and (<= Elevator_c2 Elevator_c3) (<= 2 Elevator_qDC1) (or (<= 0 Elevator_c3) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|))) (<= Elevator_qDC2 3) (< 2 Elevator_qDC2) (<= 3 Elevator_qCSP)))) (< |Elevator_current'| |Elevator_goal'|) (= Elevator_qCSP 1)) (or (not (= Elevator_qCSP 3)) (= 1 |Elevator_dir'|) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|))) (and (or (<= |Elevator_goal'| Elevator_max) (<= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 3)) (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2)) (<= |Elevator_goal'| |Elevator_current'|)))) (not (= Elevator_qCSP 2))) (and (or (and (<= Elevator_qDC2 2) (not (= |Elevator_goal'| |Elevator_current'|)) (<= (+ Elevator_max 1) |Elevator_goal'|) (<= 2 Elevator_qDC2) (<= |Elevator_goal'| |Elevator_current'|)) (not (= Elevator_qCSP 3))) (not (= Elevator_qCSP 2)))))), 586#(or (and (<= |Elevator_current'| Elevator_max) (or (<= (+ |Elevator_current'| 1) Elevator_max) (not (= Elevator_qCSP 1)) (= |Elevator_current'| |Elevator_goal'|)) (or (and (or (= Elevator_qDC2 2) (not (= Elevator_qCSP 2))) (or (and (<= |Elevator_goal'| Elevator_max) (or (and (<= Elevator_qDC2 2) (<= 2 Elevator_qDC2) (or (= 1 |Elevator_dir'|) (<= Elevator_qCSP 2))) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)))) (<= |Elevator_goal'| |Elevator_current'|)) (or (and (= Elevator_qDC1 2) (not (= Elevator_qDC2 1)) (or (and (= (+ |Elevator_dir'| 1) 0) (<= (+ |Elevator_current'| 1) Elevator_max)) (and (= |Elevator_dir'| 1) (<= (+ Elevator_min 1) |Elevator_goal'|))) (not (= Elevator_qDC2 3)) (or (<= Elevator_qDC2 1) (<= 3 Elevator_qDC2))) (not (= |Elevator_goal'| |Elevator_current'|)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) (= Elevator_qDC2 3)) (and (<= Elevator_c2 Elevator_c3) (<= 2 Elevator_qDC1) (or (<= 0 Elevator_c3) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|))) (<= Elevator_qDC2 3) (< 2 Elevator_qDC2))) (or (not (= Elevator_qCSP 3)) (= 1 |Elevator_dir'|) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|)) (or (= |Elevator_goal'| |Elevator_current'|) (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= Elevator_qDC2 2) (or (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_qCSP 2)) (<= 2 Elevator_qDC2) (<= Elevator_min |Elevator_goal'|)))) (and (not (= Elevator_qCSP 3)) (not (= Elevator_qCSP 2))))) (and (<= |Elevator_current'| Elevator_max) (<= |Elevator_current'| |Elevator_goal'|) (<= 3 Elevator_qDC2) (not (= Elevator_qCSP 2)) (<= Elevator_qDC2 3) (not (= Elevator_qDC1 1)) (<= |Elevator_goal'| |Elevator_current'|) (<= 3 Elevator_c3))), 587#(or (and (or (and (= Elevator_qDC2 2) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= |Elevator_current'| (+ |Elevator_goal'| 1))) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 2) |Elevator_current'|))) (= Elevator_qDC2 2) (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (= Elevator_qCSP 3)) (and (or (<= Elevator_qCSP 1) (and (or (not (= Elevator_qCSP 3)) (and (or (and (= Elevator_qDC2 2) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= |Elevator_current'| (+ |Elevator_goal'| 1))) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 2) |Elevator_current'|))) (= 0 (+ |Elevator_dir'| 1))) (not (= Elevator_qDC1 1))) (or (and (or (not (= Elevator_qCSP 2)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)))) (not (= Elevator_qCSP 1)) (or (not (= Elevator_qCSP 3)) (and (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|))) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))))) (and (<= |Elevator_current'| Elevator_max) (<= Elevator_qCSP 1) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= |Elevator_goal'| |Elevator_current'|))))) (and (<= 0 Elevator_c3) (<= 3 Elevator_qDC2) (<= Elevator_qDC2 3) (or (not (= Elevator_qCSP 2)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)))) (not (= Elevator_qCSP 1)) (or (not (= Elevator_qCSP 3)) (and (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|))) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)))))) (or (<= |Elevator_current'| Elevator_max) (and (or (not (= Elevator_qCSP 3)) (and (or (and (= Elevator_qDC2 2) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= |Elevator_current'| (+ |Elevator_goal'| 1))) (and (<= |Elevator_current'| Elevator_max) (<= (+ Elevator_min 2) |Elevator_current'|))) (= 0 (+ |Elevator_dir'| 1))) (not (= Elevator_qDC1 1))) (or (and (or (not (= Elevator_qCSP 2)) (and (or (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)))) (not (= Elevator_qCSP 1)) (or (not (= Elevator_qCSP 3)) (and (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) |Elevator_goal'|) (= 1 |Elevator_dir'|))) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))))) (and (<= |Elevator_current'| Elevator_max) (<= Elevator_qCSP 1) (or (<= (+ |Elevator_current'| 1) Elevator_max) (<= |Elevator_goal'| |Elevator_current'|))))) (= Elevator_qCSP 3))) (and (<= Elevator_c2 Elevator_c3) (<= 2 Elevator_qDC1) (<= 3 Elevator_qDC2) (<= 3 Elevator_qCSP)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (or (<= (+ |Elevator_current'| 2) Elevator_max) (and (= Elevator_qDC2 2) (<= |Elevator_goal'| Elevator_max) (<= Elevator_max |Elevator_goal'|))) (= 1 |Elevator_dir'|) (= Elevator_qCSP 3)) (and (<= |Elevator_current'| Elevator_max) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (= 0 (+ |Elevator_dir'| 1))) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|))) (not (= Elevator_qCSP 2)) (not (= Elevator_qDC1 1))) (and (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (= Elevator_qDC1 2) (not (= Elevator_qDC2 3)) (= 0 (+ |Elevator_dir'| 1)) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)))) (= Elevator_qCSP 3))), 588#(or (and (or (and (<= Elevator_c2 Elevator_c3) (<= (+ |Elevator_dir'| 1) 0) (= Elevator_qDC1 2) (<= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= Elevator_qDC2 3)) (and (or (not (= Elevator_qCSP 3)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (not (= Elevator_qDC2 1)) (<= 2 Elevator_qDC1)) (and (<= |Elevator_dir'| 0) (= Elevator_qDC1 2) (<= 0 |Elevator_dir'|))) (or (not (= Elevator_qCSP 2)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)))) (= Elevator_qCSP 3)) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (or (not (= Elevator_qCSP 3)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (not (= Elevator_qDC2 1)) (<= 2 Elevator_qDC1)) (and (<= |Elevator_dir'| 0) (= Elevator_qDC1 2) (<= 0 |Elevator_dir'|))) (or (not (= Elevator_qCSP 2)) (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)))) (<= Elevator_qCSP 2))) (and (or (and (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (not (= Elevator_qDC2 1)) (<= 3 Elevator_c3)) (and (<= (+ |Elevator_dir'| 1) 0) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)))) (<= 3 Elevator_qCSP))), 589#(or (<= Elevator_qCSP 1) (and (or (not (= Elevator_qCSP 3)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= Elevator_min |Elevator_current'|) (= 1 |Elevator_dir'|))) (or (and (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|)) (<= 3 Elevator_qCSP) (and (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_current'| 1) |Elevator_goal'|)))) (and (or (and (<= Elevator_c2 Elevator_c3) (<= (+ |Elevator_dir'| 1) 0) (= Elevator_qDC1 2) (<= 0 (+ |Elevator_dir'| 1)) (<= (+ |Elevator_current'| 1) Elevator_max) (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (= Elevator_qDC2 3)) (= Elevator_qCSP 3)) (or (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (<= Elevator_qCSP 2))) (and (or (and (or (<= 2 Elevator_qDC1) (<= 3 Elevator_c3)) (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 2)) (not (= Elevator_qDC2 1))) (and (<= (+ |Elevator_dir'| 1) 0) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)))) (<= 3 Elevator_qCSP))), 590#(or (not (= Elevator_qCSP 3)) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) (= 1 |Elevator_dir'|)) (not (= Elevator_qDC1 1)) (and (<= (+ |Elevator_dir'| 1) 0) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|)))), 591#(and (<= |Elevator_current'| Elevator_max) (or (not (= Elevator_qCSP 3)) (and (<= |Elevator_dir'| 0) (<= 0 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'|) Elevator_max) (= 1 |Elevator_dir'|)) (and (<= (+ |Elevator_current'| |Elevator_dir'| 1) Elevator_max) (<= Elevator_min (+ |Elevator_current'| |Elevator_dir'|))) (not (= Elevator_qDC1 1))) (<= Elevator_min |Elevator_current'|)), 592#(and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|))] [2018-07-23 13:37:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:37:18,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:37:18,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:18,239 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2018-07-23 13:37:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:18,528 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 13:37:18,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:37:18,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-07-23 13:37:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:18,529 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:37:18,529 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:37:18,530 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:37:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:37:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:37:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:37:18,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-07-23 13:37:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,531 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:37:18,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:37:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:37:18,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:37:18,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:37:18,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:18,764 WARN L169 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 418 DAG size of output: 373 [2018-07-23 13:37:18,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:18,967 WARN L169 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 419 DAG size of output: 374 [2018-07-23 13:37:19,257 WARN L169 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 68 [2018-07-23 13:37:19,529 WARN L169 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 68 [2018-07-23 13:37:19,532 INFO L421 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-07-23 13:37:19,532 INFO L421 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-07-23 13:37:19,533 INFO L417 ceAbstractionStarter]: At program point L178''(lines 163 183) the Hoare annotation is: (let ((.cse2 (= Elevator_qCSP 3)) (.cse1 (<= Elevator_qCSP 2)) (.cse5 (= 0 (+ |Elevator_dir'| 1))) (.cse7 (= 1 |Elevator_dir'|)) (.cse4 (<= Elevator_qDC2 2)) (.cse0 (= Elevator_qDC2 3)) (.cse8 (= Elevator_qCSP 2))) (and (or (<= 0 Elevator_c3) (not .cse0)) (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|) (or (and (<= 2 Elevator_qCSP) .cse1) (and (= Elevator_qDC2 1) (= |Elevator_current'| |Elevator_goal'|)) .cse2) (let ((.cse3 (not .cse8))) (or (and (not .cse2) .cse3) (let ((.cse6 (= |Elevator_goal'| |Elevator_current'|))) (and (or (and .cse4 (or .cse5 .cse1) (<= Elevator_min |Elevator_goal'|)) .cse6 (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (or (= Elevator_qDC2 2) .cse3) (or (and .cse4 (or .cse7 .cse1) (<= |Elevator_goal'| Elevator_max)) (<= |Elevator_goal'| |Elevator_current'|)) (or (not .cse6) (< 2 Elevator_qDC2)))))) (or (and (or .cse5 .cse7) (or (and .cse4 (<= 2 Elevator_qDC2)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) .cse0))) .cse8 (and (<= Elevator_qCSP 1) (<= 1 Elevator_qCSP))))) [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L155''(lines 145 183) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-07-23 13:37:19,534 INFO L421 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-07-23 13:37:19,535 INFO L421 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-07-23 13:37:19,535 INFO L421 ceAbstractionStarter]: For program point L80''(lines 80 85) no Hoare annotation was computed. [2018-07-23 13:37:19,535 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-07-23 13:37:19,535 INFO L421 ceAbstractionStarter]: For program point L103''(lines 89 142) no Hoare annotation was computed. [2018-07-23 13:37:19,535 INFO L417 ceAbstractionStarter]: At program point ElevatorEXIT(lines 13 188) the Hoare annotation is: (and (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|)) [2018-07-23 13:37:19,535 INFO L421 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-07-23 13:37:19,535 INFO L424 ceAbstractionStarter]: At program point ElevatorENTRY(lines 13 188) the Hoare annotation is: true [2018-07-23 13:37:19,535 INFO L421 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-07-23 13:37:19,536 INFO L417 ceAbstractionStarter]: At program point ElevatorErr0AssertViolationASSERT(line 185) the Hoare annotation is: false [2018-07-23 13:37:19,536 INFO L421 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-07-23 13:37:19,536 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-07-23 13:37:19,536 INFO L417 ceAbstractionStarter]: At program point L48(lines 13 188) the Hoare annotation is: (let ((.cse2 (= Elevator_qCSP 3)) (.cse1 (<= Elevator_qCSP 2)) (.cse5 (= 0 (+ |Elevator_dir'| 1))) (.cse7 (= 1 |Elevator_dir'|)) (.cse4 (<= Elevator_qDC2 2)) (.cse0 (= Elevator_qDC2 3)) (.cse8 (= Elevator_qCSP 2))) (and (or (<= 0 Elevator_c3) (not .cse0)) (<= |Elevator_current'| Elevator_max) (<= Elevator_min |Elevator_current'|) (or (and (<= 2 Elevator_qCSP) .cse1) (and (= Elevator_qDC2 1) (= |Elevator_current'| |Elevator_goal'|)) .cse2) (let ((.cse3 (not .cse8))) (or (and (not .cse2) .cse3) (let ((.cse6 (= |Elevator_goal'| |Elevator_current'|))) (and (or (and .cse4 (or .cse5 .cse1) (<= Elevator_min |Elevator_goal'|)) .cse6 (<= (+ |Elevator_current'| 1) |Elevator_goal'|)) (or (= Elevator_qDC2 2) .cse3) (or (and .cse4 (or .cse7 .cse1) (<= |Elevator_goal'| Elevator_max)) (<= |Elevator_goal'| |Elevator_current'|)) (or (not .cse6) (< 2 Elevator_qDC2)))))) (or (and (or .cse5 .cse7) (or (and .cse4 (<= 2 Elevator_qDC2)) (and (<= Elevator_c2 Elevator_c3) (= Elevator_qDC1 2) .cse0))) .cse8 (and (<= Elevator_qCSP 1) (<= 1 Elevator_qCSP))))) [2018-07-23 13:37:19,541 INFO L421 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-07-23 13:37:19,542 INFO L421 ceAbstractionStarter]: For program point L135''(lines 111 160) no Hoare annotation was computed. [2018-07-23 13:37:19,542 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-07-23 13:37:19,542 INFO L421 ceAbstractionStarter]: For program point L83'(lines 83 108) no Hoare annotation was computed. [2018-07-23 13:37:19,542 INFO L421 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-07-23 13:37:19,562 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:37:19 BoogieIcfgContainer [2018-07-23 13:37:19,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:37:19,563 INFO L168 Benchmark]: Toolchain (without parser) took 53118.21 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -256.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-07-23 13:37:19,564 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:37:19,565 INFO L168 Benchmark]: Boogie Preprocessor took 84.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:37:19,567 INFO L168 Benchmark]: RCFGBuilder took 899.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:37:19,568 INFO L168 Benchmark]: TraceAbstraction took 52129.93 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -288.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-23 13:37:19,573 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 899.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52129.93 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -288.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((0 <= c3 || !(qDC2 == 3)) && current' <= max) && min <= current') && (((2 <= qCSP && qCSP <= 2) || (qDC2 == 1 && current' == goal')) || qCSP == 3)) && ((!(qCSP == 3) && !(qCSP == 2)) || (((((((qDC2 <= 2 && (0 == dir' + 1 || qCSP <= 2)) && min <= goal') || goal' == current') || current' + 1 <= goal') && (qDC2 == 2 || !(qCSP == 2))) && (((qDC2 <= 2 && (1 == dir' || qCSP <= 2)) && goal' <= max) || goal' <= current')) && (!(goal' == current') || 2 < qDC2)))) && ((((0 == dir' + 1 || 1 == dir') && ((qDC2 <= 2 && 2 <= qDC2) || ((c2 <= c3 && qDC1 == 2) && qDC2 == 3))) || qCSP == 2) || (qCSP <= 1 && 1 <= qCSP)) - ProcedureContractResult [Line: 13]: Procedure Contract for Elevator Derived contract for procedure Elevator: current' <= max && min <= current' - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 52.0s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 89 SDslu, 3 SDs, 0 SdLazy, 157 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 41.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/240 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 293 HoareAnnotationTreeSize, 5 FomulaSimplifications, 947 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8165 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 44.3s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 169428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/240 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-37-19-599.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-37-19-599.csv Received shutdown request...