java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:04,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:04,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:04,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:04,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:04,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:04,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:04,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:04,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:04,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:04,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:04,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:04,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:04,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:04,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:04,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:04,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:04,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:04,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:04,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:04,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:04,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:04,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:04,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:04,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:04,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:04,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:04,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:04,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:04,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:04,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:04,301 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:04,301 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:04,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:04,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:04,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:04,306 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:04,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:04,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:04,325 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:04,325 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:04,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:04,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:04,326 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:04,326 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:04,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:04,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:04,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:04,403 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:04,404 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:04,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl [2018-09-26 08:06:04,405 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-09-26 08:06:04,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:04,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:04,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:04,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:04,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,535 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:04,535 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:04,536 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:04,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:04,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:04,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:04,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:04,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:04,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-26 08:06:04,674 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-26 08:06:04,675 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-26 08:06:05,448 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:05,449 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:05 BoogieIcfgContainer [2018-09-26 08:06:05,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:05,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:05,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:05,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:05,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/2) ... [2018-09-26 08:06:05,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32006b2b and model type Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:05, skipping insertion in model container [2018-09-26 08:06:05,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:05" (2/2) ... [2018-09-26 08:06:05,460 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-09-26 08:06:05,471 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:05,484 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:06:05,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:05,538 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:05,538 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:05,539 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:05,539 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:05,539 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:05,539 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:05,539 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:05,540 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:06:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:06:05,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,573 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:06:05,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash 35150, now seen corresponding path program 1 times [2018-09-26 08:06:05,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,703 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:05,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:06:05,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:06:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:06:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:05,723 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:06:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,763 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:05,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:06:05,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:06:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,776 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:05,776 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:06:05,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:06:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:06:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:06:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:06:05,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-09-26 08:06:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,826 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:06:05,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:06:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:06:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:05,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,827 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:06:05,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash 33951723, now seen corresponding path program 1 times [2018-09-26 08:06:05,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:06:05,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:05,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:05,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:05,960 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2018-09-26 08:06:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,040 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:06,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:06,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-26 08:06:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,041 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:06,041 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:06:06,043 INFO L605 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-09-26 08:06:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:06:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:06:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:06:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:06:06,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-09-26 08:06:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,051 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:06:06,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:06:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:06,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,053 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-09-26 08:06:06,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1731959992, now seen corresponding path program 2 times [2018-09-26 08:06:06,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:06:06,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:06,170 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-09-26 08:06:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,254 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:06:06,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:06,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-09-26 08:06:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,255 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:06:06,255 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:06:06,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:06:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:06:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:06:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:06:06,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-09-26 08:06:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,264 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:06:06,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:06:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:06,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,266 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-09-26 08:06:06,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2033931109, now seen corresponding path program 3 times [2018-09-26 08:06:06,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:06,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:06,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:06,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:06,495 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2018-09-26 08:06:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,584 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:06:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:06,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-09-26 08:06:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,585 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:06:06,586 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:06:06,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:06:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:06:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:06:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:06:06,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-26 08:06:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,595 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:06:06,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:06:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:06,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,596 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-09-26 08:06:06,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,597 INFO L82 PathProgramCache]: Analyzing trace with hash 397848642, now seen corresponding path program 4 times [2018-09-26 08:06:06,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:06,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:06,967 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2018-09-26 08:06:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,089 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:06:07,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:07,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:06:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,090 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:06:07,091 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:06:07,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:06:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:06:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:06:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:06:07,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-26 08:06:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,105 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:06:07,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:06:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:07,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,106 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-09-26 08:06:07,107 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 80628191, now seen corresponding path program 5 times [2018-09-26 08:06:07,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,909 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 55 [2018-09-26 08:06:08,291 WARN L178 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 61 [2018-09-26 08:06:08,540 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 50 [2018-09-26 08:06:08,810 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-09-26 08:06:08,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:08,993 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 28 [2018-09-26 08:06:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:09,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:09,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:09,101 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-09-26 08:06:09,375 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 22 [2018-09-26 08:06:09,533 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2018-09-26 08:06:09,677 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-09-26 08:06:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,000 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:06:10,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:10,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-26 08:06:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,002 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:06:10,002 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:06:10,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:06:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:06:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:06:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:06:10,016 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-26 08:06:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,018 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:06:10,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:06:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:10,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,019 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-09-26 08:06:10,021 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash 174452796, now seen corresponding path program 6 times [2018-09-26 08:06:10,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,055 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 44 [2018-09-26 08:06:11,421 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 65 [2018-09-26 08:06:11,782 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 65 [2018-09-26 08:06:12,041 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 42 [2018-09-26 08:06:12,340 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 45 [2018-09-26 08:06:12,697 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 28 [2018-09-26 08:06:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:12,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:06:12,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:06:12,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:06:12,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:12,845 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-09-26 08:06:13,190 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-09-26 08:06:13,331 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2018-09-26 08:06:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,541 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:06:13,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:13,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-09-26 08:06:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,542 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:06:13,542 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:06:13,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:06:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:06:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:06:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:06:13,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-26 08:06:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,558 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:06:13,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:06:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:06:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:06:13,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,560 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-09-26 08:06:13,561 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash 145584985, now seen corresponding path program 7 times [2018-09-26 08:06:13,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,036 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 27 [2018-09-26 08:06:15,313 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 42 [2018-09-26 08:06:15,576 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 50 [2018-09-26 08:06:16,135 WARN L178 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 65 [2018-09-26 08:06:16,991 WARN L178 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 81 [2018-09-26 08:06:17,920 WARN L178 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 96 [2018-09-26 08:06:18,746 WARN L178 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 93 [2018-09-26 08:06:19,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:19,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:19,361 WARN L178 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 60 [2018-09-26 08:06:19,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:06:20,010 WARN L178 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 65 [2018-09-26 08:06:20,270 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 42 [2018-09-26 08:06:20,628 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 45 [2018-09-26 08:06:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:06:20,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:06:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:06:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:20,685 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-09-26 08:06:21,244 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 85 [2018-09-26 08:06:21,521 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 99 [2018-09-26 08:06:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,549 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:06:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:06:21,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-09-26 08:06:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,551 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:06:21,551 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:06:21,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:06:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:06:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:06:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:06:21,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-09-26 08:06:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,553 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:06:21,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:06:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:06:21,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:06:21,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:06:21,673 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 205 [2018-09-26 08:06:21,960 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 83 [2018-09-26 08:06:22,261 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 94 [2018-09-26 08:06:22,265 INFO L426 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-09-26 08:06:22,265 INFO L426 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-09-26 08:06:22,266 INFO L422 ceAbstractionStarter]: At program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) the Hoare annotation is: false [2018-09-26 08:06:22,266 INFO L426 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-09-26 08:06:22,266 INFO L426 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-09-26 08:06:22,266 INFO L426 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-09-26 08:06:22,266 INFO L426 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-09-26 08:06:22,266 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-09-26 08:06:22,266 INFO L426 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-09-26 08:06:22,267 INFO L426 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-09-26 08:06:22,267 INFO L426 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-09-26 08:06:22,267 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-09-26 08:06:22,267 INFO L426 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-09-26 08:06:22,267 INFO L426 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-09-26 08:06:22,267 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-09-26 08:06:22,269 INFO L422 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse4 (+ Elevator_current 1))) (let ((.cse0 (<= Elevator_current Elevator_max)) (.cse8 (= 0 (+ Elevator_dir 1))) (.cse6 (<= Elevator_qCSP 2)) (.cse3 (<= (+ Elevator_goal 1) Elevator_current)) (.cse14 (<= .cse4 Elevator_goal)) (.cse7 (<= Elevator_goal Elevator_max)) (.cse9 (<= Elevator_goal Elevator_current)) (.cse5 (= 1 Elevator_dir))) (let ((.cse1 (and .cse0 (or .cse8 (<= Elevator_current Elevator_goal) .cse6) (or (<= Elevator_qCSP 1) .cse3 .cse14) .cse7 (or (not (= Elevator_qCSP 3)) .cse9 .cse5))) (.cse2 (<= 4 Elevator_qCSP)) (.cse10 (not (= Elevator_qDC2 1)))) (and (<= Elevator_min Elevator_current) .cse0 (or .cse1 (and (or (<= Elevator_c2 Elevator_c3) (not (= Elevator_qDC2 3))) (= Elevator_qDC1 2)) .cse2) (or (<= 0.0 Elevator_c2) .cse3 (and (<= .cse4 Elevator_max) .cse5) .cse2 (<= 3 Elevator_qDC2) .cse6) .cse7 (<= Elevator_min Elevator_goal) (or .cse1 .cse2 (and (or (and (<= .cse4 (+ Elevator_dir Elevator_goal)) .cse5) .cse8) .cse9 .cse10)) (let ((.cse11 (+ Elevator_dir Elevator_current)) (.cse12 (not (= Elevator_qCSP 2)))) (or (and (<= Elevator_min .cse11) (<= (+ Elevator_dir Elevator_current 2) Elevator_max) .cse10 .cse12) (let ((.cse13 (= Elevator_goal Elevator_current))) (and (or (and (<= 2 Elevator_qCSP) .cse6) (and .cse3 .cse8) (and .cse13 .cse10) (and .cse5 (not (= Elevator_max Elevator_current))) (= Elevator_qCSP 1) (and (<= 0 Elevator_dir) (<= .cse11 Elevator_max) .cse14)) (or (not .cse13) .cse12))))))))) [2018-09-26 08:06:22,269 INFO L426 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-09-26 08:06:22,269 INFO L426 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-09-26 08:06:22,269 INFO L426 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-09-26 08:06:22,269 INFO L426 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-09-26 08:06:22,269 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-09-26 08:06:22,270 INFO L426 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-09-26 08:06:22,270 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-09-26 08:06:22,271 INFO L422 ceAbstractionStarter]: At program point L74-2(lines 70 77) the Hoare annotation is: (let ((.cse1 (+ Elevator_current 1))) (let ((.cse15 (= Elevator_qDC2 3)) (.cse5 (<= Elevator_current Elevator_max)) (.cse7 (= 0 (+ Elevator_dir 1))) (.cse4 (<= Elevator_qCSP 2)) (.cse14 (<= Elevator_qCSP 1)) (.cse0 (<= (+ Elevator_goal 1) Elevator_current)) (.cse12 (<= .cse1 Elevator_goal)) (.cse6 (<= Elevator_goal Elevator_current)) (.cse2 (= 1 Elevator_dir))) (let ((.cse11 (not (= Elevator_qDC2 2))) (.cse9 (not (= Elevator_qDC2 1))) (.cse8 (and .cse5 (or .cse7 (<= Elevator_current Elevator_goal) .cse4) (or .cse14 .cse0 .cse12) (or (not (= Elevator_qCSP 3)) .cse6 .cse2))) (.cse13 (not .cse15)) (.cse3 (<= 4 Elevator_qCSP))) (and (or .cse0 (and (<= .cse1 Elevator_max) .cse2) .cse3 (<= 3 Elevator_qDC2) (< 0.0 Elevator_c2) .cse4) (<= Elevator_min Elevator_current) .cse5 (or .cse6 .cse3 .cse4 (not .cse7)) (or .cse8 (and (or .cse9 .cse3) (<= 3 Elevator_qCSP))) (or (and (<= .cse1 (+ Elevator_dir Elevator_goal)) .cse2) .cse7 .cse3 .cse4) (let ((.cse10 (+ Elevator_dir Elevator_current))) (or (= Elevator_qCSP 2) (and (<= Elevator_min .cse10) (<= (+ Elevator_dir Elevator_current 2) Elevator_max) .cse9) (and (= Elevator_goal Elevator_current) .cse11 .cse9) (and .cse0 .cse7) (and .cse2 (not (= Elevator_max Elevator_current))) (= Elevator_qCSP 1) (and (<= (+ Elevator_dir Elevator_min 2) Elevator_current) .cse9 .cse7) (and (<= 0 Elevator_dir) (<= .cse10 Elevator_max) .cse12))) (or (and .cse11 .cse13) .cse14 .cse0 .cse3 (and (< Elevator_c2 2.0) .cse15) .cse12) (<= Elevator_goal Elevator_max) (<= Elevator_min Elevator_goal) (or .cse3 (not (= Elevator_qDC1 1)) (and .cse9 .cse13) .cse4) (or .cse8 (and (or (<= Elevator_c2 Elevator_c3) .cse13) (= Elevator_qDC1 2)) .cse3))))) [2018-09-26 08:06:22,271 INFO L426 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-09-26 08:06:22,271 INFO L426 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-09-26 08:06:22,272 INFO L429 ceAbstractionStarter]: At program point ElevatorEXIT(lines 13 197) the Hoare annotation is: true [2018-09-26 08:06:22,272 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-09-26 08:06:22,272 INFO L426 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-09-26 08:06:22,272 INFO L426 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-09-26 08:06:22,272 INFO L429 ceAbstractionStarter]: At program point ElevatorENTRY(lines 13 197) the Hoare annotation is: true [2018-09-26 08:06:22,272 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-09-26 08:06:22,304 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:06:22 BoogieIcfgContainer [2018-09-26 08:06:22,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:06:22,306 INFO L168 Benchmark]: Toolchain (without parser) took 17818.43 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -28.0 MB). Peak memory consumption was 412.9 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:22,308 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:06:22,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:06:22,309 INFO L168 Benchmark]: Boogie Preprocessor took 50.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:06:22,313 INFO L168 Benchmark]: RCFGBuilder took 859.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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-09-26 08:06:22,314 INFO L168 Benchmark]: TraceAbstraction took 16853.50 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -59.7 MB). Peak memory consumption was 381.2 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:22,323 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 859.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 16853.50 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -59.7 MB). Peak memory consumption was 381.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: 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: ((((((min <= current && current <= max) && ((((((current <= max && ((0 == dir + 1 || current <= goal) || qCSP <= 2)) && ((qCSP <= 1 || goal + 1 <= current) || current + 1 <= goal)) && goal <= max) && ((!(qCSP == 3) || goal <= current) || 1 == dir)) || ((c2 <= c3 || !(qDC2 == 3)) && qDC1 == 2)) || 4 <= qCSP)) && (((((0.0 <= c2 || goal + 1 <= current) || (current + 1 <= max && 1 == dir)) || 4 <= qCSP) || 3 <= qDC2) || qCSP <= 2)) && goal <= max) && min <= goal) && ((((((current <= max && ((0 == dir + 1 || current <= goal) || qCSP <= 2)) && ((qCSP <= 1 || goal + 1 <= current) || current + 1 <= goal)) && goal <= max) && ((!(qCSP == 3) || goal <= current) || 1 == dir)) || 4 <= qCSP) || ((((current + 1 <= dir + goal && 1 == dir) || 0 == dir + 1) && goal <= current) && !(qDC2 == 1)))) && ((((min <= dir + current && dir + current + 2 <= max) && !(qDC2 == 1)) && !(qCSP == 2)) || (((((((2 <= qCSP && qCSP <= 2) || (goal + 1 <= current && 0 == dir + 1)) || (goal == current && !(qDC2 == 1))) || (1 == dir && !(max == current))) || qCSP == 1) || ((0 <= dir && dir + current <= max) && current + 1 <= goal)) && (!(goal == current) || !(qCSP == 2)))) - ProcedureContractResult [Line: 13]: Procedure Contract for Elevator Derived contract for procedure Elevator: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 16.7s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 36 SDslu, 3 SDs, 0 SdLazy, 113 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 19 NumberOfFragments, 586 HoareAnnotationTreeSize, 5 FomulaSimplifications, 417 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3652 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 51880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/168 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.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-06-22-344.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-06-22-344.csv Received shutdown request...