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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:13:44,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:13:44,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:13:44,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:13:44,235 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:13:44,236 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:13:44,237 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:13:44,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:13:44,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:13:44,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:13:44,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:13:44,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:13:44,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:13:44,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:13:44,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:13:44,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:13:44,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:13:44,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:13:44,253 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:13:44,254 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:13:44,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:13:44,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:13:44,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:13:44,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:13:44,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:13:44,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:13:44,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:13:44,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:13:44,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:13:44,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:13:44,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:13:44,265 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:13:44,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:13:44,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:13:44,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:13:44,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:13:44,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:13:44,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:13:44,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:13:44,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:13:44,284 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:13:44,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:13:44,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:13:44,285 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:13:44,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:13:44,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:13:44,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:13:44,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:13:44,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:13:44,287 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:13:44,287 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:13:44,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:13:44,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:13:44,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:13:44,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:13:44,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:13:44,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:13:44,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:13:44,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:13:44,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:44,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:13:44,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:13:44,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:13:44,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:13:44,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:13:44,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:13:44,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:13:44,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:13:44,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:13:44,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:13:44,373 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:13:44,374 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:13:44,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl [2018-10-04 12:13:44,375 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-10-04 12:13:44,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:13:44,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:13:44,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:44,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:13:44,465 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:13:44,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,511 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:13:44,512 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:13:44,512 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:13:44,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:44,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:13:44,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:13:44,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:13:44,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:13:44,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:13:44,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:13:44,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:13:44,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:44,657 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-04 12:13:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-04 12:13:44,657 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-04 12:13:45,266 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:13:45,267 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:45 BoogieIcfgContainer [2018-10-04 12:13:45,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:13:45,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:13:45,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:13:45,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:13:45,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/2) ... [2018-10-04 12:13:45,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6826729f and model type Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:13:45, skipping insertion in model container [2018-10-04 12:13:45,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:45" (2/2) ... [2018-10-04 12:13:45,279 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-10-04 12:13:45,290 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:13:45,300 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:13:45,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:13:45,363 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:13:45,363 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:13:45,363 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:13:45,364 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:13:45,364 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:13:45,364 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:13:45,364 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:13:45,364 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:13:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-10-04 12:13:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:13:45,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:13:45,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:45,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,411 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-10-04 12:13:45,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:45,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:13:45,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:45,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:45,585 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-10-04 12:13:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:45,691 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-10-04 12:13:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:45,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-04 12:13:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:45,712 INFO L225 Difference]: With dead ends: 92 [2018-10-04 12:13:45,712 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 12:13:45,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-04 12:13:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 12:13:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-04 12:13:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:13:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-10-04 12:13:45,761 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-10-04 12:13:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:45,761 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-10-04 12:13:45,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-10-04 12:13:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:13:45,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:13:45,762 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:45,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-10-04 12:13:45,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:45,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:45,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:13:45,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:45,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:45,816 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-10-04 12:13:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:45,908 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-10-04 12:13:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:45,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-04 12:13:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:45,912 INFO L225 Difference]: With dead ends: 64 [2018-10-04 12:13:45,912 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:13:45,913 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-10-04 12:13:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:13:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 12:13:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:13:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-10-04 12:13:45,923 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-10-04 12:13:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:45,923 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-10-04 12:13:45,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-10-04 12:13:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:13:45,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,925 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:45,926 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:45,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,926 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-10-04 12:13:45,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-04 12:13:46,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:46,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:13:46,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:13:46,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:13:46,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:46,274 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-10-04 12:13:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:46,654 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-10-04 12:13:46,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:13:46,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 12:13:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:46,661 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:13:46,663 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 12:13:46,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 12:13:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-10-04 12:13:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 12:13:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-10-04 12:13:46,678 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-10-04 12:13:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:46,683 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-10-04 12:13:46,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:13:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-10-04 12:13:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:13:46,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:46,687 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:46,688 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:46,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-10-04 12:13:46,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:46,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:46,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:46,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:46,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:46,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:46,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:46,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:46,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:46,734 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-10-04 12:13:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:46,946 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-10-04 12:13:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:46,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-04 12:13:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:46,950 INFO L225 Difference]: With dead ends: 205 [2018-10-04 12:13:46,951 INFO L226 Difference]: Without dead ends: 116 [2018-10-04 12:13:46,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:13:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-04 12:13:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-10-04 12:13:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 12:13:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-10-04 12:13:46,967 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-10-04 12:13:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:46,967 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-10-04 12:13:46,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-10-04 12:13:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:13:46,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:46,969 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:46,969 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:46,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-10-04 12:13:46,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:46,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:47,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:47,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:13:47,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:13:47,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:13:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:47,037 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-10-04 12:13:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:47,165 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-10-04 12:13:47,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:13:47,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-04 12:13:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:47,170 INFO L225 Difference]: With dead ends: 297 [2018-10-04 12:13:47,170 INFO L226 Difference]: Without dead ends: 186 [2018-10-04 12:13:47,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-04 12:13:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-10-04 12:13:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-04 12:13:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-10-04 12:13:47,199 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [2018-10-04 12:13:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:47,199 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 310 transitions. [2018-10-04 12:13:47,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:13:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-10-04 12:13:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 12:13:47,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:47,202 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:47,202 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:47,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-10-04 12:13:47,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:47,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:47,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:47,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-04 12:13:47,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:47,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:47,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:47,284 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-10-04 12:13:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:47,372 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-10-04 12:13:47,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:47,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-04 12:13:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:47,377 INFO L225 Difference]: With dead ends: 472 [2018-10-04 12:13:47,377 INFO L226 Difference]: Without dead ends: 283 [2018-10-04 12:13:47,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:13:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-04 12:13:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-10-04 12:13:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-04 12:13:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-10-04 12:13:47,404 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-10-04 12:13:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:47,404 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-10-04 12:13:47,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-10-04 12:13:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:13:47,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:47,407 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:47,407 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:47,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-10-04 12:13:47,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:47,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 12:13:47,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:47,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:47,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:47,461 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-10-04 12:13:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:47,582 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-10-04 12:13:47,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:47,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-04 12:13:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:47,588 INFO L225 Difference]: With dead ends: 480 [2018-10-04 12:13:47,588 INFO L226 Difference]: Without dead ends: 289 [2018-10-04 12:13:47,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:13:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-04 12:13:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-10-04 12:13:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-04 12:13:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-10-04 12:13:47,602 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-10-04 12:13:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:47,603 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-10-04 12:13:47,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-10-04 12:13:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:13:47,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:47,605 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:47,605 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:47,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-10-04 12:13:47,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:47,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-04 12:13:47,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:47,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:47,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:47,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:47,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:47,676 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-10-04 12:13:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:47,988 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-10-04 12:13:47,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:47,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-04 12:13:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:47,991 INFO L225 Difference]: With dead ends: 378 [2018-10-04 12:13:47,991 INFO L226 Difference]: Without dead ends: 181 [2018-10-04 12:13:47,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:13:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-04 12:13:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-10-04 12:13:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 12:13:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-10-04 12:13:48,004 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-10-04 12:13:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:48,004 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-10-04 12:13:48,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-10-04 12:13:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:13:48,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:48,008 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:48,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:48,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:48,008 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-10-04 12:13:48,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:48,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:48,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:48,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:48,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-04 12:13:48,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:48,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:48,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-04 12:13:48,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:13:48,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2018-10-04 12:13:48,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:13:48,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:13:48,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:13:48,570 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 9 states. [2018-10-04 12:13:49,279 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-04 12:13:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:49,798 INFO L93 Difference]: Finished difference Result 588 states and 937 transitions. [2018-10-04 12:13:49,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:13:49,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-10-04 12:13:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:49,803 INFO L225 Difference]: With dead ends: 588 [2018-10-04 12:13:49,803 INFO L226 Difference]: Without dead ends: 408 [2018-10-04 12:13:49,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:13:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-04 12:13:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 315. [2018-10-04 12:13:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-04 12:13:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2018-10-04 12:13:49,822 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 54 [2018-10-04 12:13:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:49,822 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2018-10-04 12:13:49,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:13:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2018-10-04 12:13:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 12:13:49,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:49,824 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:49,824 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:49,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 928707300, now seen corresponding path program 1 times [2018-10-04 12:13:49,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:49,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:49,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:49,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:49,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-04 12:13:49,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:49,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:13:49,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:49,879 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand 3 states. [2018-10-04 12:13:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:49,961 INFO L93 Difference]: Finished difference Result 797 states and 1238 transitions. [2018-10-04 12:13:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:49,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 12:13:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:49,968 INFO L225 Difference]: With dead ends: 797 [2018-10-04 12:13:49,968 INFO L226 Difference]: Without dead ends: 459 [2018-10-04 12:13:49,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-04 12:13:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-04 12:13:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-10-04 12:13:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-04 12:13:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 678 transitions. [2018-10-04 12:13:49,990 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 678 transitions. Word has length 57 [2018-10-04 12:13:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:49,990 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 678 transitions. [2018-10-04 12:13:49,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 678 transitions. [2018-10-04 12:13:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 12:13:49,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:49,992 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:49,992 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:49,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash -139266043, now seen corresponding path program 1 times [2018-10-04 12:13:49,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:49,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:49,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:49,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:49,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-04 12:13:50,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:50,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:50,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:50,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:50,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:50,072 INFO L87 Difference]: Start difference. First operand 455 states and 678 transitions. Second operand 3 states. [2018-10-04 12:13:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:50,296 INFO L93 Difference]: Finished difference Result 909 states and 1355 transitions. [2018-10-04 12:13:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:50,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 12:13:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:50,299 INFO L225 Difference]: With dead ends: 909 [2018-10-04 12:13:50,300 INFO L226 Difference]: Without dead ends: 455 [2018-10-04 12:13:50,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:13:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-04 12:13:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-10-04 12:13:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-04 12:13:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 658 transitions. [2018-10-04 12:13:50,321 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 658 transitions. Word has length 57 [2018-10-04 12:13:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:50,322 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 658 transitions. [2018-10-04 12:13:50,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 658 transitions. [2018-10-04 12:13:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 12:13:50,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:50,323 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:50,324 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:50,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-10-04 12:13:50,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:50,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:50,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:50,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:50,945 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:50,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:50,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:51,737 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-10-04 12:13:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:51,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:51,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-04 12:13:51,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:13:51,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:13:51,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:13:51,920 INFO L87 Difference]: Start difference. First operand 455 states and 658 transitions. Second operand 16 states. [2018-10-04 12:13:53,026 WARN L178 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-10-04 12:13:53,226 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:13:53,398 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:13:53,783 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-04 12:13:53,926 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 12:13:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:54,662 INFO L93 Difference]: Finished difference Result 1533 states and 2192 transitions. [2018-10-04 12:13:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:13:54,663 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-10-04 12:13:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:54,672 INFO L225 Difference]: With dead ends: 1533 [2018-10-04 12:13:54,672 INFO L226 Difference]: Without dead ends: 1532 [2018-10-04 12:13:54,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:13:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-10-04 12:13:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 767. [2018-10-04 12:13:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-10-04 12:13:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1129 transitions. [2018-10-04 12:13:54,713 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1129 transitions. Word has length 59 [2018-10-04 12:13:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:54,715 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1129 transitions. [2018-10-04 12:13:54,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:13:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1129 transitions. [2018-10-04 12:13:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 12:13:54,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:54,717 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:54,717 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:54,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1550465213, now seen corresponding path program 1 times [2018-10-04 12:13:54,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:54,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:54,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 12:13:54,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:54,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:54,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:54,823 INFO L87 Difference]: Start difference. First operand 767 states and 1129 transitions. Second operand 3 states. [2018-10-04 12:13:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:55,003 INFO L93 Difference]: Finished difference Result 1835 states and 2691 transitions. [2018-10-04 12:13:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:55,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-10-04 12:13:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:55,009 INFO L225 Difference]: With dead ends: 1835 [2018-10-04 12:13:55,009 INFO L226 Difference]: Without dead ends: 1069 [2018-10-04 12:13:55,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:13:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-04 12:13:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1018. [2018-10-04 12:13:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2018-10-04 12:13:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1471 transitions. [2018-10-04 12:13:55,057 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1471 transitions. Word has length 80 [2018-10-04 12:13:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:55,058 INFO L480 AbstractCegarLoop]: Abstraction has 1018 states and 1471 transitions. [2018-10-04 12:13:55,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1471 transitions. [2018-10-04 12:13:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 12:13:55,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:55,060 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:55,061 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:55,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-10-04 12:13:55,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:55,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:55,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:13:55,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:55,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:13:55,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:13:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:13:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:55,218 INFO L87 Difference]: Start difference. First operand 1018 states and 1471 transitions. Second operand 4 states. [2018-10-04 12:13:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:55,325 INFO L93 Difference]: Finished difference Result 2065 states and 2971 transitions. [2018-10-04 12:13:55,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:55,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-10-04 12:13:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:55,334 INFO L225 Difference]: With dead ends: 2065 [2018-10-04 12:13:55,334 INFO L226 Difference]: Without dead ends: 1018 [2018-10-04 12:13:55,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2018-10-04 12:13:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1016. [2018-10-04 12:13:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-10-04 12:13:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1414 transitions. [2018-10-04 12:13:55,379 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1414 transitions. Word has length 81 [2018-10-04 12:13:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:55,380 INFO L480 AbstractCegarLoop]: Abstraction has 1016 states and 1414 transitions. [2018-10-04 12:13:55,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:13:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1414 transitions. [2018-10-04 12:13:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 12:13:55,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:55,383 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:55,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:55,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash 571414056, now seen corresponding path program 1 times [2018-10-04 12:13:55,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:55,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-04 12:13:55,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:55,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:55,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:55,465 INFO L87 Difference]: Start difference. First operand 1016 states and 1414 transitions. Second operand 3 states. [2018-10-04 12:13:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:55,591 INFO L93 Difference]: Finished difference Result 1868 states and 2575 transitions. [2018-10-04 12:13:55,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:55,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-04 12:13:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:55,596 INFO L225 Difference]: With dead ends: 1868 [2018-10-04 12:13:55,596 INFO L226 Difference]: Without dead ends: 736 [2018-10-04 12:13:55,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:13:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-04 12:13:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 726. [2018-10-04 12:13:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-10-04 12:13:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 948 transitions. [2018-10-04 12:13:55,630 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 948 transitions. Word has length 97 [2018-10-04 12:13:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:55,630 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 948 transitions. [2018-10-04 12:13:55,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 948 transitions. [2018-10-04 12:13:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 12:13:55,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:55,633 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:55,633 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:55,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-10-04 12:13:55,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:55,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:55,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:55,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:56,070 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-04 12:13:56,469 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:13:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 134 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:13:56,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:56,656 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:56,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:56,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 75 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:57,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:57,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 12:13:57,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:13:57,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:13:57,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:13:57,609 INFO L87 Difference]: Start difference. First operand 726 states and 948 transitions. Second operand 26 states. [2018-10-04 12:13:58,268 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-10-04 12:13:59,182 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-10-04 12:13:59,477 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-10-04 12:13:59,843 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-10-04 12:14:00,176 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-10-04 12:14:00,462 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-10-04 12:14:00,768 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-10-04 12:14:00,907 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2018-10-04 12:14:01,294 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2018-10-04 12:14:01,572 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-10-04 12:14:01,820 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-10-04 12:14:02,017 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-10-04 12:14:02,289 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-10-04 12:14:02,519 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-10-04 12:14:03,019 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-10-04 12:14:03,525 WARN L178 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-10-04 12:14:03,811 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-10-04 12:14:03,975 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-10-04 12:14:04,289 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-10-04 12:14:05,067 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-10-04 12:14:05,323 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-10-04 12:14:05,787 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2018-10-04 12:14:05,960 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-10-04 12:14:06,165 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-10-04 12:14:06,945 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2018-10-04 12:14:07,339 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-10-04 12:14:07,541 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-10-04 12:14:07,926 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-10-04 12:14:08,081 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-04 12:14:08,219 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-10-04 12:14:08,407 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-10-04 12:14:08,634 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-04 12:14:08,814 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-10-04 12:14:09,022 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-10-04 12:14:09,520 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-10-04 12:14:09,726 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-10-04 12:14:09,870 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-04 12:14:10,075 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-10-04 12:14:10,512 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2018-10-04 12:14:10,732 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-10-04 12:14:11,039 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2018-10-04 12:14:11,593 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2018-10-04 12:14:11,842 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-10-04 12:14:12,047 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-10-04 12:14:12,374 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-10-04 12:14:12,542 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-10-04 12:14:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:12,637 INFO L93 Difference]: Finished difference Result 6073 states and 7615 transitions. [2018-10-04 12:14:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 12:14:12,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-10-04 12:14:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:12,658 INFO L225 Difference]: With dead ends: 6073 [2018-10-04 12:14:12,658 INFO L226 Difference]: Without dead ends: 6072 [2018-10-04 12:14:12,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3572 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=2220, Invalid=9552, Unknown=0, NotChecked=0, Total=11772 [2018-10-04 12:14:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2018-10-04 12:14:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 1176. [2018-10-04 12:14:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-04 12:14:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1565 transitions. [2018-10-04 12:14:12,765 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1565 transitions. Word has length 99 [2018-10-04 12:14:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:12,765 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1565 transitions. [2018-10-04 12:14:12,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:14:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1565 transitions. [2018-10-04 12:14:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 12:14:12,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:12,768 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:12,768 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:12,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1497402593, now seen corresponding path program 1 times [2018-10-04 12:14:12,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:12,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:12,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 12:14:12,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:12,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:12,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:14:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:14:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:14:12,843 INFO L87 Difference]: Start difference. First operand 1176 states and 1565 transitions. Second operand 3 states. [2018-10-04 12:14:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:13,052 INFO L93 Difference]: Finished difference Result 2107 states and 2774 transitions. [2018-10-04 12:14:13,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:14:13,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-10-04 12:14:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:13,056 INFO L225 Difference]: With dead ends: 2107 [2018-10-04 12:14:13,056 INFO L226 Difference]: Without dead ends: 887 [2018-10-04 12:14:13,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:14:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-10-04 12:14:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 691. [2018-10-04 12:14:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-10-04 12:14:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 882 transitions. [2018-10-04 12:14:13,101 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 882 transitions. Word has length 99 [2018-10-04 12:14:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:13,102 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 882 transitions. [2018-10-04 12:14:13,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:14:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 882 transitions. [2018-10-04 12:14:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-04 12:14:13,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:13,104 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:13,105 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:13,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-10-04 12:14:13,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:13,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:13,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:13,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:13,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-04 12:14:13,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:13,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:13,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:14:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:14:13,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:14:13,189 INFO L87 Difference]: Start difference. First operand 691 states and 882 transitions. Second operand 3 states. [2018-10-04 12:14:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:13,525 INFO L93 Difference]: Finished difference Result 1137 states and 1433 transitions. [2018-10-04 12:14:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:14:13,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-10-04 12:14:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:13,526 INFO L225 Difference]: With dead ends: 1137 [2018-10-04 12:14:13,526 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:14:13,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-04 12:14:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:14:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:14:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:14:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:14:13,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-10-04 12:14:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:13,528 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:14:13,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:14:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:14:13,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:14:13,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:14:13,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:14,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:14,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:14,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:14,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:14,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:15,378 WARN L178 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 502 DAG size of output: 432 [2018-10-04 12:14:21,854 WARN L178 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 414 DAG size of output: 142 [2018-10-04 12:14:21,858 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-10-04 12:14:21,858 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-10-04 12:14:21,858 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-10-04 12:14:21,858 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-10-04 12:14:21,859 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-10-04 12:14:21,860 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-10-04 12:14:21,860 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-10-04 12:14:21,861 INFO L421 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse16 (<= Elevator_current Elevator_max)) (.cse40 (+ Elevator_current 1))) (let ((.cse9 (and .cse16 (< Elevator_min .cse40) (<= Elevator_qDC1 1))) (.cse14 (= Elevator_qCSP 1)) (.cse7 (<= Elevator_goal Elevator_max)) (.cse8 (<= Elevator_min Elevator_goal))) (let ((.cse6 (<= Elevator_min |Elevator_current'|)) (.cse31 (= |Elevator_dir'| 1)) (.cse35 (+ |Elevator_dir'| 1)) (.cse37 (+ Elevator_dir Elevator_goal)) (.cse38 (+ Elevator_min 1)) (.cse13 (<= Elevator_min Elevator_current)) (.cse5 (= Elevator_qDC2 1)) (.cse39 (and (and .cse9 .cse14) .cse7 .cse8))) (let ((.cse1 (and .cse5 .cse39)) (.cse26 (or (and .cse16 (<= .cse38 Elevator_current)) (and (<= .cse40 Elevator_max) .cse13))) (.cse29 (= Elevator_current Elevator_goal)) (.cse30 (<= (+ Elevator_dir Elevator_current 2) Elevator_max)) (.cse28 (<= 1 Elevator_dir)) (.cse36 (and (not .cse5) .cse39)) (.cse21 (or (<= Elevator_current .cse37) (= (+ Elevator_dir 1) 0))) (.cse22 (or (<= .cse37 Elevator_current) (= Elevator_dir 1))) (.cse23 (or (= .cse35 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse24 (or .cse31 (<= |Elevator_goal'| |Elevator_current'|))) (.cse33 (<= .cse38 |Elevator_current'|)) (.cse34 (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse6)) (.cse25 (not (= .cse37 Elevator_current))) (.cse20 (not Elevator_newgoal)) (.cse11 (= Elevator_qDC2 3)) (.cse17 (= Elevator_qDC1 2)) (.cse12 (not Elevator_stop)) (.cse19 (= Elevator_qDC2 2)) (.cse18 (not (= Elevator_qCSP 3))) (.cse3 (<= |Elevator_current'| Elevator_max)) (.cse4 (not (= Elevator_goal Elevator_current))) (.cse0 (<= |Elevator_goal'| Elevator_max)) (.cse2 (<= Elevator_min |Elevator_goal'|)) (.cse15 (not Elevator_passed)) (.cse10 (not (= |Elevator_current'| |Elevator_goal'|)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse6 .cse0 .cse2 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse12 (and .cse3 .cse13 .cse6 .cse0 .cse11 .cse7 .cse8 .cse14 .cse15 .cse16 .cse17 .cse2)) (and .cse12 (and .cse17 (and (and .cse3 .cse18 .cse13 .cse16 .cse6 .cse0 .cse2 .cse7 .cse8 .cse15) .cse19))) (and .cse12 .cse20 (and .cse3 .cse21 .cse4 .cse6 .cse0 .cse7 .cse8 .cse22 .cse10 .cse23 .cse24 .cse19 .cse2 .cse25 .cse9)) (and .cse26 .cse1 (let ((.cse27 (+ Elevator_dir Elevator_current))) (or (and (<= .cse27 Elevator_max) .cse28) .cse29 (and (<= Elevator_min .cse27) .cse30)))) (and .cse12 (and .cse3 .cse6 .cse0 .cse2 .cse11 .cse7 .cse8 .cse9) .cse20) (and .cse12 (let ((.cse32 (+ |Elevator_goal'| |Elevator_dir'|))) (and (or .cse31 (<= .cse32 |Elevator_current'|)) .cse21 (and .cse26 .cse0 .cse7 .cse8) (not (= .cse32 |Elevator_current'|)) (or (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (or .cse33 .cse34) .cse22 (or (= 0 .cse35) (<= |Elevator_current'| .cse32)) .cse17 .cse19 .cse2 .cse25 (or .cse29 .cse30 .cse28))) .cse20) (and .cse20 (and .cse3 .cse13 .cse16 .cse17 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse14 .cse15)) (and .cse12 (and .cse36 .cse0 .cse2 .cse11)) (and .cse12 (and (and .cse19 .cse36) .cse0 .cse2) .cse20) (and .cse12 (and .cse21 .cse4 .cse13 .cse0 .cse7 .cse8 .cse22 .cse15 .cse10 .cse23 .cse16 .cse17 .cse24 .cse19 .cse2 (or (and .cse3 .cse33) .cse34) .cse25) .cse20) (and (and .cse12 (and (or (and Elevator_passed .cse17 .cse11) (and .cse3 .cse13 .cse16 .cse17 .cse6 .cse11)) .cse0 .cse2 .cse7 .cse8)) .cse20) (and .cse3 .cse4 .cse13 .cse6 .cse0 .cse11 .cse7 .cse8 .cse15 .cse10 .cse16 .cse17 .cse2) (and .cse12 (and .cse2 (and .cse19 (and .cse3 (and .cse18 .cse9) .cse6 .cse0 .cse7 .cse8)))) (and .cse3 .cse4 .cse13 .cse16 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse15 .cse10)))))) [2018-10-04 12:14:21,861 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-10-04 12:14:21,861 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-10-04 12:14:21,861 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-04 12:14:21,861 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-10-04 12:14:21,862 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-10-04 12:14:21,863 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-10-04 12:14:21,863 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-10-04 12:14:21,863 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-10-04 12:14:21,863 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-10-04 12:14:21,885 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:14:21 BoogieIcfgContainer [2018-10-04 12:14:21,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:14:21,886 INFO L168 Benchmark]: Toolchain (without parser) took 37424.06 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 375.9 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 103.5 MB). Peak memory consumption was 846.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:14:21,887 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.78 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-10-04 12:14:21,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.32 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-10-04 12:14:21,888 INFO L168 Benchmark]: Boogie Preprocessor took 55.12 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-10-04 12:14:21,888 INFO L168 Benchmark]: RCFGBuilder took 696.50 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-10-04 12:14:21,889 INFO L168 Benchmark]: TraceAbstraction took 36616.98 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 375.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 71.8 MB). Peak memory consumption was 814.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:14:21,892 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.78 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 50.32 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 55.12 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 696.50 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 36616.98 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 375.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 71.8 MB). Peak memory consumption was 814.3 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: (((((((((((((((((goal' <= max && qDC2 == 1 && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && min <= goal') || (((((((((current' <= max && !(goal == current)) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || (((((((((current' <= max && !(goal == current)) && min <= current') && goal' <= max) && min <= goal') && qDC2 == 3) && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || (!stop && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && qCSP == 1) && !passed) && current <= max) && qDC1 == 2) && min <= goal')) || (!stop && qDC1 == 2 && (((((((((current' <= max && !(qCSP == 3)) && min <= current) && current <= max) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !passed) && qDC2 == 2)) || ((!stop && !newgoal) && (((((((((((((current' <= max && (current <= dir + goal || dir + 1 == 0)) && !(goal == current)) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && (current <= max && min < current + 1) && qDC1 <= 1)) || ((((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && qDC2 == 1 && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && (((dir + current <= max && 1 <= dir) || current == goal) || (min <= dir + current && dir + current + 2 <= max)))) || ((!stop && ((((((current' <= max && min <= current') && goal' <= max) && min <= goal') && qDC2 == 3) && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !newgoal)) || ((!stop && ((((((((((((dir' == 1 || goal' + dir' <= current') && (current <= dir + goal || dir + 1 == 0)) && ((((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && goal' <= max) && goal <= max) && min <= goal) && !(goal' + dir' == current')) && (1 <= dir' || current' + dir' + 2 <= max)) && (min + 1 <= current' || (current' + 1 <= max && min <= current'))) && (dir + goal <= current || dir == 1)) && (0 == dir' + 1 || current' <= goal' + dir')) && qDC1 == 2) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && ((current == goal || dir + current + 2 <= max) || 1 <= dir)) && !newgoal)) || (!newgoal && ((((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && qCSP == 1) && !passed)) || (!stop && (((!(qDC2 == 1) && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && goal' <= max) && min <= goal') && qDC2 == 3)) || ((!stop && ((qDC2 == 2 && !(qDC2 == 1) && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && goal' <= max) && min <= goal') && !newgoal)) || ((!stop && ((((((((((((((((current <= dir + goal || dir + 1 == 0) && !(goal == current)) && min <= current) && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !passed) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && qDC1 == 2) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && !(dir + goal == current)) && !newgoal)) || ((!stop && ((((((passed && qDC1 == 2) && qDC2 == 3) || (((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && min <= current') && qDC2 == 3)) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || ((((((((((((current' <= max && !(goal == current)) && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && !passed) && !(current' == goal')) && current <= max) && qDC1 == 2) && min <= goal')) || (!stop && min <= goal' && qDC2 == 2 && ((((current' <= max && !(qCSP == 3) && (current <= max && min < current + 1) && qDC1 <= 1) && min <= current') && goal' <= max) && goal <= max) && min <= goal)) || (((((((((((current' <= max && !(goal == current)) && min <= current) && current <= max) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !passed) && !(current' == goal')) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 36.5s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 21.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1306 SDtfs, 3380 SDslu, 5274 SDs, 0 SdLazy, 1671 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3703 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1176occurred in iteration=16, 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 6236 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 42 NumberOfFragments, 929 HoareAnnotationTreeSize, 1 FomulaSimplifications, 49544 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 1 FomulaSimplificationsInter, 211987 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1219 ConstructedInterpolants, 0 QuantifiedInterpolants, 755265 SizeOfPredicates, 35 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 1304/1655 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_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-14-21-915.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-14-21-915.csv Received shutdown request...