java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/real-life/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:33:51,507 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:33:51,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:33:51,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:33:51,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:33:51,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:33:51,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:33:51,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:33:51,543 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:33:51,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:33:51,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:33:51,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:33:51,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:33:51,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:33:51,555 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:33:51,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:33:51,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:33:51,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:33:51,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:33:51,565 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:33:51,567 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:33:51,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:33:51,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:33:51,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:33:51,574 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:33:51,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:33:51,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:33:51,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:33:51,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:33:51,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:33:51,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:33:51,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:33:51,585 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:33:51,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:33:51,586 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:33:51,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:33:51,588 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:33:51,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:33:51,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:33:51,618 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:33:51,618 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:33:51,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:33:51,622 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:33:51,622 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:33:51,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:33:51,622 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:33:51,623 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:33:51,623 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:33:51,623 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:33:51,623 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:33:51,623 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:33:51,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:33:51,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:33:51,627 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:33:51,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:33:51,628 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:33:51,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:33:51,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:33:51,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:33:51,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:33:51,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:33:51,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:33:51,631 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:33:51,631 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:33:51,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:33:51,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:33:51,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:33:51,632 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:33:51,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:33:51,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:33:51,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:33:51,633 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:33:51,633 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:33:51,634 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:33:51,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:33:51,634 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:33:51,634 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:33:51,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:33:51,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:33:51,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:33:51,693 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:33:51,693 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:33:51,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl [2018-12-03 18:33:51,695 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-12-03 18:33:51,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:33:51,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:33:51,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:33:51,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:33:51,752 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:33:51,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,788 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:33:51,788 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:33:51,789 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:33:51,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:33:51,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:33:51,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:33:51,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:33:51,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/1) ... [2018-12-03 18:33:51,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:33:51,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:33:51,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:33:51,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:33:51,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (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-12-03 18:33:51,897 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 18:33:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 18:33:51,897 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 18:33:52,689 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:33:52,689 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:33:52,690 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:33:52 BoogieIcfgContainer [2018-12-03 18:33:52,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:33:52,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:33:52,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:33:52,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:33:52,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:51" (1/2) ... [2018-12-03 18:33:52,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c7d210 and model type Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:33:52, skipping insertion in model container [2018-12-03 18:33:52,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:33:52" (2/2) ... [2018-12-03 18:33:52,698 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-12-03 18:33:52,709 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:33:52,718 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:33:52,736 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:33:52,776 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:33:52,776 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:33:52,776 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:33:52,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:33:52,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:33:52,777 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:33:52,777 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:33:52,777 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:33:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-03 18:33:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:33:52,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:52,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:33:52,806 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:52,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-12-03 18:33:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:52,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:52,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:33:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:52,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:33:52,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:33:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:33:52,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:33:52,997 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-12-03 18:33:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:53,103 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-12-03 18:33:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:33:53,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 18:33:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:53,120 INFO L225 Difference]: With dead ends: 92 [2018-12-03 18:33:53,120 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 18:33:53,124 INFO L631 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-12-03 18:33:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 18:33:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-03 18:33:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:33:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-12-03 18:33:53,168 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-12-03 18:33:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:53,168 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-12-03 18:33:53,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:33:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-12-03 18:33:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:33:53,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:53,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:33:53,169 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:53,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-12-03 18:33:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:53,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:33:53,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:53,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 18:33:53,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:53,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:33:53,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:33:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:33:53,247 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-12-03 18:33:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:53,318 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-12-03 18:33:53,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:33:53,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 18:33:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:53,320 INFO L225 Difference]: With dead ends: 64 [2018-12-03 18:33:53,321 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:33:53,322 INFO L631 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-12-03 18:33:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:33:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 18:33:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 18:33:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-12-03 18:33:53,332 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-12-03 18:33:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:53,332 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-12-03 18:33:53,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:33:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-12-03 18:33:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:33:53,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:53,334 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:33:53,334 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:53,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:53,335 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-12-03 18:33:53,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:53,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:53,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:53,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:33:53,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:53,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:33:53,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:53,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:33:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:33:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:33:53,535 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-12-03 18:33:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:53,706 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-12-03 18:33:53,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:33:53,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 18:33:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:53,711 INFO L225 Difference]: With dead ends: 95 [2018-12-03 18:33:53,711 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 18:33:53,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:33:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 18:33:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-12-03 18:33:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:33:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-12-03 18:33:53,741 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-12-03 18:33:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:53,742 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-12-03 18:33:53,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:33:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-12-03 18:33:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:33:53,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:53,746 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:33:53,746 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:53,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-12-03 18:33:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:53,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:53,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:33:53,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:53,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:33:53,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:53,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:33:53,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:33:53,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:33:53,865 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-12-03 18:33:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:54,069 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-12-03 18:33:54,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:33:54,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 18:33:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:54,074 INFO L225 Difference]: With dead ends: 205 [2018-12-03 18:33:54,075 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 18:33:54,079 INFO L631 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-12-03 18:33:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 18:33:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-12-03 18:33:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 18:33:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-12-03 18:33:54,094 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-12-03 18:33:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:54,094 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-12-03 18:33:54,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:33:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-12-03 18:33:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:33:54,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:54,096 INFO L402 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-12-03 18:33:54,097 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:54,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-12-03 18:33:54,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:54,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:54,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:33:54,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:33:54,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:54,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:33:54,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:33:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:33:54,200 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-12-03 18:33:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:54,328 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-12-03 18:33:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:33:54,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-03 18:33:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:54,334 INFO L225 Difference]: With dead ends: 297 [2018-12-03 18:33:54,334 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 18:33:54,338 INFO L631 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-12-03 18:33:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 18:33:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 18:33:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 18:33:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-12-03 18:33:54,369 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [2018-12-03 18:33:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:54,370 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 310 transitions. [2018-12-03 18:33:54,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:33:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-12-03 18:33:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:33:54,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:54,372 INFO L402 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-12-03 18:33:54,373 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:54,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:54,373 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-12-03 18:33:54,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:54,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:54,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 18:33:54,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:54,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:33:54,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:54,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:33:54,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:33:54,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:33:54,447 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-12-03 18:33:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:54,552 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-12-03 18:33:54,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:33:54,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-03 18:33:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:54,555 INFO L225 Difference]: With dead ends: 472 [2018-12-03 18:33:54,555 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 18:33:54,557 INFO L631 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-12-03 18:33:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 18:33:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-12-03 18:33:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 18:33:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-12-03 18:33:54,573 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-12-03 18:33:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:54,573 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-12-03 18:33:54,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:33:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-12-03 18:33:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:33:54,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:54,576 INFO L402 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-12-03 18:33:54,576 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:54,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-12-03 18:33:54,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 18:33:54,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:54,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:33:54,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:54,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:33:54,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:33:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:33:54,624 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-12-03 18:33:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:54,733 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-12-03 18:33:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:33:54,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 18:33:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:54,738 INFO L225 Difference]: With dead ends: 480 [2018-12-03 18:33:54,738 INFO L226 Difference]: Without dead ends: 289 [2018-12-03 18:33:54,739 INFO L631 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-12-03 18:33:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-03 18:33:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-12-03 18:33:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 18:33:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-12-03 18:33:54,753 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-12-03 18:33:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:54,754 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-12-03 18:33:54,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:33:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-12-03 18:33:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:33:54,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:54,756 INFO L402 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-12-03 18:33:54,757 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:54,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-12-03 18:33:54,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:54,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:54,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 18:33:54,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:33:54,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:54,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:33:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:33:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:33:54,818 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-12-03 18:33:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:55,191 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-12-03 18:33:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:33:55,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 18:33:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:55,197 INFO L225 Difference]: With dead ends: 378 [2018-12-03 18:33:55,198 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 18:33:55,199 INFO L631 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-12-03 18:33:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 18:33:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-12-03 18:33:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 18:33:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-12-03 18:33:55,219 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-12-03 18:33:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:55,222 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-12-03 18:33:55,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:33:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-12-03 18:33:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:33:55,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:55,225 INFO L402 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-12-03 18:33:55,225 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:55,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-12-03 18:33:55,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:55,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:55,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:55,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:55,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:33:55,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:33:55,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:33:55,515 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-12-03 18:33:55,517 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [27], [28], [33], [36], [38], [43], [46], [48], [53], [56], [69], [72], [74], [77], [79], [84], [87], [93], [96], [98], [116], [119], [146] [2018-12-03 18:33:55,584 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:33:55,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:33:56,212 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:33:56,213 INFO L272 AbstractInterpreter]: Visited 28 different actions 118 times. Merged at 25 different actions 68 times. Never widened. Found 14 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 18:33:56,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:56,252 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:33:56,518 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 25.31% of their original sizes. [2018-12-03 18:33:56,518 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:33:58,155 INFO L418 sIntCurrentIteration]: We unified 53 AI predicates to 53 [2018-12-03 18:33:58,155 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:33:58,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:33:58,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [8] total 29 [2018-12-03 18:33:58,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:58,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:33:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:33:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:33:58,158 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 23 states. [2018-12-03 18:34:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:04,838 INFO L93 Difference]: Finished difference Result 570 states and 889 transitions. [2018-12-03 18:34:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:34:04,839 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-12-03 18:34:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:04,841 INFO L225 Difference]: With dead ends: 570 [2018-12-03 18:34:04,842 INFO L226 Difference]: Without dead ends: 390 [2018-12-03 18:34:04,843 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=562, Invalid=1330, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:34:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-12-03 18:34:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 322. [2018-12-03 18:34:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-12-03 18:34:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 487 transitions. [2018-12-03 18:34:04,861 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 487 transitions. Word has length 54 [2018-12-03 18:34:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:04,861 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 487 transitions. [2018-12-03 18:34:04,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:34:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 487 transitions. [2018-12-03 18:34:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:34:04,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:04,863 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:04,864 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:04,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash -831478527, now seen corresponding path program 1 times [2018-12-03 18:34:04,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:04,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:04,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 18:34:04,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:04,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:04,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:04,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:34:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:34:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:34:04,926 INFO L87 Difference]: Start difference. First operand 322 states and 487 transitions. Second operand 3 states. [2018-12-03 18:34:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:05,125 INFO L93 Difference]: Finished difference Result 649 states and 1001 transitions. [2018-12-03 18:34:05,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:34:05,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 18:34:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:05,129 INFO L225 Difference]: With dead ends: 649 [2018-12-03 18:34:05,129 INFO L226 Difference]: Without dead ends: 475 [2018-12-03 18:34:05,132 INFO L631 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-12-03 18:34:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-12-03 18:34:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 460. [2018-12-03 18:34:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 18:34:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 688 transitions. [2018-12-03 18:34:05,161 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 688 transitions. Word has length 54 [2018-12-03 18:34:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:05,161 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 688 transitions. [2018-12-03 18:34:05,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:34:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 688 transitions. [2018-12-03 18:34:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:34:05,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:05,165 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:05,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:05,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash -6028891, now seen corresponding path program 1 times [2018-12-03 18:34:05,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:05,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 18:34:05,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:05,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:34:05,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:05,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:34:05,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:34:05,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:34:05,289 INFO L87 Difference]: Start difference. First operand 460 states and 688 transitions. Second operand 4 states. [2018-12-03 18:34:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:05,566 INFO L93 Difference]: Finished difference Result 1195 states and 1797 transitions. [2018-12-03 18:34:05,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:34:05,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 18:34:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:05,570 INFO L225 Difference]: With dead ends: 1195 [2018-12-03 18:34:05,571 INFO L226 Difference]: Without dead ends: 716 [2018-12-03 18:34:05,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:34:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-12-03 18:34:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 586. [2018-12-03 18:34:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-12-03 18:34:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 882 transitions. [2018-12-03 18:34:05,596 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 882 transitions. Word has length 55 [2018-12-03 18:34:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:05,597 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 882 transitions. [2018-12-03 18:34:05,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:34:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 882 transitions. [2018-12-03 18:34:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:34:05,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:05,598 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:05,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:05,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash -258049078, now seen corresponding path program 1 times [2018-12-03 18:34:05,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 18:34:05,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:05,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:05,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:05,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:34:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:34:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:34:05,677 INFO L87 Difference]: Start difference. First operand 586 states and 882 transitions. Second operand 3 states. [2018-12-03 18:34:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:05,944 INFO L93 Difference]: Finished difference Result 1307 states and 1959 transitions. [2018-12-03 18:34:05,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:34:05,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 18:34:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:05,949 INFO L225 Difference]: With dead ends: 1307 [2018-12-03 18:34:05,949 INFO L226 Difference]: Without dead ends: 746 [2018-12-03 18:34:05,950 INFO L631 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-12-03 18:34:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-03 18:34:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 715. [2018-12-03 18:34:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-12-03 18:34:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1053 transitions. [2018-12-03 18:34:05,976 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1053 transitions. Word has length 59 [2018-12-03 18:34:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:05,976 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1053 transitions. [2018-12-03 18:34:05,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:34:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1053 transitions. [2018-12-03 18:34:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:34:05,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:05,978 INFO L402 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-12-03 18:34:05,978 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:05,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-12-03 18:34:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:06,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:06,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:06,267 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 18:34:06,267 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [15], [18], [27], [28], [33], [36], [38], [43], [46], [48], [53], [56], [69], [72], [74], [77], [79], [84], [87], [93], [96], [98], [116], [120], [123], [126], [129], [146] [2018-12-03 18:34:06,270 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:06,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:06,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:34:06,410 INFO L272 AbstractInterpreter]: Visited 33 different actions 172 times. Merged at 32 different actions 100 times. Never widened. Found 24 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 18:34:06,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:06,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:34:06,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:06,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-03 18:34:06,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:06,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:06,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:07,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:07,769 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-12-03 18:34:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:07,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:07,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2018-12-03 18:34:07,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:07,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:34:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:34:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:34:07,832 INFO L87 Difference]: Start difference. First operand 715 states and 1053 transitions. Second operand 14 states. [2018-12-03 18:34:08,522 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-12-03 18:34:09,058 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 18:34:09,478 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-03 18:34:10,375 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-03 18:34:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:10,972 INFO L93 Difference]: Finished difference Result 2543 states and 3693 transitions. [2018-12-03 18:34:10,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:34:10,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-12-03 18:34:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:10,989 INFO L225 Difference]: With dead ends: 2543 [2018-12-03 18:34:10,989 INFO L226 Difference]: Without dead ends: 2542 [2018-12-03 18:34:10,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:34:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2018-12-03 18:34:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1283. [2018-12-03 18:34:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-12-03 18:34:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1918 transitions. [2018-12-03 18:34:11,057 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1918 transitions. Word has length 59 [2018-12-03 18:34:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:11,058 INFO L480 AbstractCegarLoop]: Abstraction has 1283 states and 1918 transitions. [2018-12-03 18:34:11,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:34:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1918 transitions. [2018-12-03 18:34:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 18:34:11,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:11,061 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 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] [2018-12-03 18:34:11,061 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:11,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1560627404, now seen corresponding path program 1 times [2018-12-03 18:34:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 18:34:11,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:11,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:11,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:11,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:34:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:34:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:34:11,119 INFO L87 Difference]: Start difference. First operand 1283 states and 1918 transitions. Second operand 3 states. [2018-12-03 18:34:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:11,411 INFO L93 Difference]: Finished difference Result 2348 states and 3502 transitions. [2018-12-03 18:34:11,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:34:11,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 18:34:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:11,417 INFO L225 Difference]: With dead ends: 2348 [2018-12-03 18:34:11,417 INFO L226 Difference]: Without dead ends: 1018 [2018-12-03 18:34:11,419 INFO L631 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-12-03 18:34:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2018-12-03 18:34:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1000. [2018-12-03 18:34:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 18:34:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1447 transitions. [2018-12-03 18:34:11,462 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1447 transitions. Word has length 80 [2018-12-03 18:34:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:11,463 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1447 transitions. [2018-12-03 18:34:11,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:34:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1447 transitions. [2018-12-03 18:34:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 18:34:11,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:11,465 INFO L402 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-12-03 18:34:11,465 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:11,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-12-03 18:34:11,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:34:11,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:11,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:34:11,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:11,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:34:11,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:34:11,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:34:11,542 INFO L87 Difference]: Start difference. First operand 1000 states and 1447 transitions. Second operand 4 states. [2018-12-03 18:34:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:11,646 INFO L93 Difference]: Finished difference Result 2005 states and 2895 transitions. [2018-12-03 18:34:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:34:11,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 18:34:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:11,652 INFO L225 Difference]: With dead ends: 2005 [2018-12-03 18:34:11,652 INFO L226 Difference]: Without dead ends: 1000 [2018-12-03 18:34:11,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:34:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-12-03 18:34:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2018-12-03 18:34:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-12-03 18:34:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1393 transitions. [2018-12-03 18:34:11,704 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1393 transitions. Word has length 81 [2018-12-03 18:34:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:11,704 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1393 transitions. [2018-12-03 18:34:11,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:34:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1393 transitions. [2018-12-03 18:34:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 18:34:11,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:11,707 INFO L402 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, 1] [2018-12-03 18:34:11,707 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:11,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1878047832, now seen corresponding path program 1 times [2018-12-03 18:34:11,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-03 18:34:11,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:11,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:11,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:11,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:34:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:34:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:34:11,804 INFO L87 Difference]: Start difference. First operand 998 states and 1393 transitions. Second operand 3 states. [2018-12-03 18:34:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:12,102 INFO L93 Difference]: Finished difference Result 2069 states and 2893 transitions. [2018-12-03 18:34:12,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:34:12,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-03 18:34:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:12,108 INFO L225 Difference]: With dead ends: 2069 [2018-12-03 18:34:12,109 INFO L226 Difference]: Without dead ends: 986 [2018-12-03 18:34:12,111 INFO L631 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-12-03 18:34:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-12-03 18:34:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 830. [2018-12-03 18:34:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-12-03 18:34:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1144 transitions. [2018-12-03 18:34:12,152 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1144 transitions. Word has length 98 [2018-12-03 18:34:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:12,152 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1144 transitions. [2018-12-03 18:34:12,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:34:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1144 transitions. [2018-12-03 18:34:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:34:12,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:12,155 INFO L402 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-12-03 18:34:12,155 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:12,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-12-03 18:34:12,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:12,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:12,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 134 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 18:34:12,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:12,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:12,815 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 18:34:12,816 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [15], [18], [27], [28], [33], [36], [38], [43], [46], [48], [51], [53], [56], [67], [69], [72], [74], [77], [79], [84], [87], [93], [96], [98], [101], [104], [109], [116], [120], [123], [126], [129], [146] [2018-12-03 18:34:12,821 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:12,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:12,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:34:12,960 INFO L272 AbstractInterpreter]: Visited 38 different actions 206 times. Merged at 35 different actions 110 times. Never widened. Found 33 fixpoints after 18 different actions. Largest state had 0 variables. [2018-12-03 18:34:12,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:12,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:34:12,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:12,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-03 18:34:13,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:13,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:13,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 75 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:13,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:14,514 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 26 [2018-12-03 18:34:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 51 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:14,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:14,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 38 [2018-12-03 18:34:14,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:14,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:34:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:34:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:34:14,701 INFO L87 Difference]: Start difference. First operand 830 states and 1144 transitions. Second operand 26 states. [2018-12-03 18:34:15,193 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-12-03 18:34:15,874 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-12-03 18:34:16,055 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-12-03 18:34:16,322 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-12-03 18:34:16,559 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-12-03 18:34:16,862 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-12-03 18:34:17,132 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-12-03 18:34:17,292 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2018-12-03 18:34:17,724 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2018-12-03 18:34:18,035 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-12-03 18:34:18,301 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-12-03 18:34:18,536 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-12-03 18:34:18,763 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 18:34:19,077 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-12-03 18:34:19,752 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 18:34:19,974 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 18:34:20,164 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-03 18:34:20,581 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-12-03 18:34:20,851 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-12-03 18:34:20,992 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-12-03 18:34:21,699 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-12-03 18:34:22,114 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-03 18:34:22,478 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2018-12-03 18:34:22,651 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-03 18:34:22,871 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-12-03 18:34:23,478 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2018-12-03 18:34:23,964 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-12-03 18:34:24,454 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-12-03 18:34:24,648 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-12-03 18:34:24,788 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-12-03 18:34:25,093 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-12-03 18:34:25,277 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 18:34:25,670 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-12-03 18:34:25,913 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-12-03 18:34:26,094 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-12-03 18:34:26,601 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-12-03 18:34:26,787 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 18:34:27,135 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-12-03 18:34:27,415 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2018-12-03 18:34:27,689 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-12-03 18:34:28,299 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 18:34:28,498 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 18:34:29,418 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2018-12-03 18:34:29,813 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-12-03 18:34:30,182 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-03 18:34:30,426 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-03 18:34:30,796 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-12-03 18:34:31,008 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 18:34:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:31,293 INFO L93 Difference]: Finished difference Result 6565 states and 8499 transitions. [2018-12-03 18:34:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 18:34:31,294 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-12-03 18:34:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:31,317 INFO L225 Difference]: With dead ends: 6565 [2018-12-03 18:34:31,317 INFO L226 Difference]: Without dead ends: 6564 [2018-12-03 18:34:31,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=3682, Invalid=14678, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:34:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2018-12-03 18:34:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 1209. [2018-12-03 18:34:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2018-12-03 18:34:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1673 transitions. [2018-12-03 18:34:31,430 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1673 transitions. Word has length 99 [2018-12-03 18:34:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:31,431 INFO L480 AbstractCegarLoop]: Abstraction has 1209 states and 1673 transitions. [2018-12-03 18:34:31,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:34:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1673 transitions. [2018-12-03 18:34:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 18:34:31,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:31,433 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:31,433 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:31,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash -667579402, now seen corresponding path program 1 times [2018-12-03 18:34:31,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:31,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:31,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:31,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:31,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-03 18:34:31,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:31,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 18:34:31,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:31,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:34:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:34:31,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:34:31,687 INFO L87 Difference]: Start difference. First operand 1209 states and 1673 transitions. Second operand 5 states. [2018-12-03 18:34:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:31,939 INFO L93 Difference]: Finished difference Result 2855 states and 3928 transitions. [2018-12-03 18:34:31,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:34:31,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 18:34:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:31,945 INFO L225 Difference]: With dead ends: 2855 [2018-12-03 18:34:31,945 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 18:34:31,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:34:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 18:34:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1273. [2018-12-03 18:34:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1273 states. [2018-12-03 18:34:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1748 transitions. [2018-12-03 18:34:32,017 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1748 transitions. Word has length 104 [2018-12-03 18:34:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:32,018 INFO L480 AbstractCegarLoop]: Abstraction has 1273 states and 1748 transitions. [2018-12-03 18:34:32,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:34:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1748 transitions. [2018-12-03 18:34:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 18:34:32,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:32,020 INFO L402 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-12-03 18:34:32,021 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:32,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-12-03 18:34:32,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:32,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:32,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-03 18:34:32,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:32,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:32,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:32,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:34:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:34:32,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:34:32,102 INFO L87 Difference]: Start difference. First operand 1273 states and 1748 transitions. Second operand 3 states. [2018-12-03 18:34:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:32,189 INFO L93 Difference]: Finished difference Result 2396 states and 3276 transitions. [2018-12-03 18:34:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:34:32,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-03 18:34:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:32,193 INFO L225 Difference]: With dead ends: 2396 [2018-12-03 18:34:32,193 INFO L226 Difference]: Without dead ends: 1144 [2018-12-03 18:34:32,195 INFO L631 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-12-03 18:34:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-12-03 18:34:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 714. [2018-12-03 18:34:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-12-03 18:34:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 940 transitions. [2018-12-03 18:34:32,248 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 940 transitions. Word has length 117 [2018-12-03 18:34:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:32,248 INFO L480 AbstractCegarLoop]: Abstraction has 714 states and 940 transitions. [2018-12-03 18:34:32,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:34:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 940 transitions. [2018-12-03 18:34:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 18:34:32,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:32,252 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:32,252 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:32,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash 819829688, now seen corresponding path program 1 times [2018-12-03 18:34:32,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:32,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:32,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:32,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-03 18:34:32,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:32,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:32,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:32,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:34:32,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:34:32,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:34:32,387 INFO L87 Difference]: Start difference. First operand 714 states and 940 transitions. Second operand 3 states. [2018-12-03 18:34:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:32,464 INFO L93 Difference]: Finished difference Result 950 states and 1227 transitions. [2018-12-03 18:34:32,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:34:32,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-12-03 18:34:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:32,465 INFO L225 Difference]: With dead ends: 950 [2018-12-03 18:34:32,465 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:34:32,466 INFO L631 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-12-03 18:34:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:34:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:34:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:34:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:34:32,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2018-12-03 18:34:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:32,469 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:34:32,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:34:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:34:32,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:34:32,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:34:32,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:34:37,279 WARN L180 SmtUtils]: Spent 4.80 s on a formula simplification. DAG size of input: 638 DAG size of output: 622 [2018-12-03 18:34:49,005 WARN L180 SmtUtils]: Spent 11.72 s on a formula simplification. DAG size of input: 619 DAG size of output: 155 [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-12-03 18:34:49,010 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-12-03 18:34:49,011 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-12-03 18:34:49,011 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-12-03 18:34:49,011 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-12-03 18:34:49,011 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-12-03 18:34:49,011 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-12-03 18:34:49,011 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L444 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse27 (<= Elevator_current Elevator_max)) (.cse40 (+ Elevator_current 1))) (let ((.cse36 (not (= Elevator_qCSP 3))) (.cse14 (and .cse27 (< Elevator_min .cse40) (<= Elevator_qDC1 1)))) (let ((.cse28 (not Elevator_passed)) (.cse21 (<= |Elevator_current'| Elevator_max)) (.cse38 (+ |Elevator_current'| 1)) (.cse22 (<= Elevator_min |Elevator_current'|)) (.cse10 (+ Elevator_min 1)) (.cse26 (<= Elevator_min Elevator_current)) (.cse39 (+ Elevator_dir Elevator_goal)) (.cse41 (+ |Elevator_goal'| |Elevator_dir'|)) (.cse37 (= Elevator_qCSP 1)) (.cse29 (and .cse36 .cse14)) (.cse23 (= Elevator_qDC2 2))) (let ((.cse16 (and .cse29 .cse23)) (.cse0 (<= Elevator_c2 Elevator_c3)) (.cse4 (<= 2 (+ Elevator_qDC1 Elevator_qDC2))) (.cse5 (<= 0.0 (+ Elevator_c2 (to_real (- Elevator_qDC2)) 1.0))) (.cse9 (<= Elevator_qDC2 Elevator_qDC1)) (.cse1 (and .cse14 .cse37)) (.cse30 (or (= |Elevator_dir'| 1) (<= .cse41 |Elevator_current'|))) (.cse31 (or (<= Elevator_current .cse39) (= (+ Elevator_dir 1) 0))) (.cse33 (not (= .cse41 |Elevator_current'|))) (.cse34 (or (<= .cse39 Elevator_current) (= Elevator_dir 1))) (.cse32 (or (= 0 (+ |Elevator_dir'| 1)) (<= |Elevator_current'| .cse41))) (.cse24 (or (and .cse27 (<= .cse10 Elevator_current)) (and (<= .cse40 Elevator_max) .cse26))) (.cse25 (or (and .cse21 (<= .cse10 |Elevator_current'|)) (and (<= .cse38 Elevator_max) .cse22))) (.cse35 (not (= .cse39 Elevator_current))) (.cse11 (not (= Elevator_goal Elevator_current))) (.cse12 (or (<= .cse38 |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (.cse18 (= Elevator_qDC2 1)) (.cse17 (not Elevator_newgoal)) (.cse19 (and .cse21 .cse26 .cse27 .cse22 .cse37 .cse28)) (.cse13 (= Elevator_qDC2 3)) (.cse15 (not Elevator_stop)) (.cse20 (= Elevator_qDC1 2)) (.cse2 (<= |Elevator_goal'| Elevator_max)) (.cse3 (<= Elevator_min |Elevator_goal'|)) (.cse7 (<= Elevator_goal Elevator_max)) (.cse8 (<= Elevator_min Elevator_goal))) (or (and .cse0 (let ((.cse6 (<= .cse10 Elevator_max))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= Elevator_goal Elevator_current) .cse1 .cse4 .cse5 .cse6 (<= Elevator_current Elevator_goal) .cse9)))) (and .cse11 .cse12 .cse13 .cse14) (and (and .cse15 .cse16 .cse2 .cse3 .cse7 .cse8) .cse17) (and .cse18 .cse17 (and .cse19 .cse20 .cse2 .cse3 .cse7 .cse8)) (and .cse15 .cse3 (and .cse21 .cse16 .cse22 .cse2 .cse7 .cse8)) (and (and .cse1 .cse2 .cse3 .cse7 .cse8) .cse18 .cse17) (and .cse17 (and .cse2 (and .cse23 .cse1) .cse3 .cse7 .cse8)) (and (and .cse0 (and .cse2 .cse3 .cse7 .cse8 (or (and .cse15 (and .cse24 .cse25) .cse20 .cse13) (and .cse15 .cse21 .cse26 .cse27 .cse20 .cse22 .cse13 .cse28))) (< Elevator_c2 2.0)) .cse17) (and .cse21 .cse11 .cse26 .cse27 .cse12 .cse22 .cse13 .cse28) (and .cse11 .cse12 (and .cse2 .cse3 .cse4 .cse29 .cse5 .cse7 .cse8 (<= Elevator_qCSP (+ Elevator_qDC2 2)) (<= 2 (+ Elevator_qDC1 Elevator_qCSP)) (<= 1.0 (+ Elevator_c3 (to_real Elevator_qDC2))) .cse9)) (and .cse1 .cse13) (and .cse17 (and .cse15 (and .cse2 (and .cse23 .cse14) .cse7 .cse8) .cse30 .cse31 .cse32 .cse33 .cse3 .cse34 .cse25 .cse35)) (and .cse18 (and .cse15 (and .cse21 .cse11 .cse29 .cse12 .cse22 .cse2 .cse3 .cse7 .cse8))) (and (and .cse30 .cse31 .cse33 .cse34 .cse15 .cse32 .cse20 (and .cse23 .cse24 .cse2 .cse7 .cse8) .cse3 .cse25 .cse35) .cse17) (and (and .cse15 .cse20 (and .cse21 .cse36 .cse11 .cse26 .cse27 .cse12 .cse22 .cse2 .cse3 .cse7 .cse8 .cse28)) .cse18) (and (and (and (and .cse19 .cse23) .cse20) .cse2 .cse3 .cse7 .cse8) .cse17) (and .cse20 .cse19 .cse13) (and .cse15 .cse20 (and .cse2 .cse3 (and .cse21 .cse36 .cse26 .cse27 .cse23 .cse22 .cse28) .cse7 .cse8))))))) [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-12-03 18:34:49,012 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-12-03 18:34:49,013 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-12-03 18:34:49,019 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: todo: implement more comprehensive to_real at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:235) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 18:34:49,022 INFO L168 Benchmark]: Toolchain (without parser) took 57271.74 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -331.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 18:34:49,023 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-12-03 18:34:49,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.44 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-12-03 18:34:49,024 INFO L168 Benchmark]: Boogie Preprocessor took 35.82 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-12-03 18:34:49,024 INFO L168 Benchmark]: RCFGBuilder took 862.08 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-12-03 18:34:49,025 INFO L168 Benchmark]: TraceAbstraction took 56329.94 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -363.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 18:34:49,028 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.23 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 39.44 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 35.82 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 862.08 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 56329.94 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -363.2 MB). Peak memory consumption was 1.1 GB. 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 - ExceptionOrErrorResult: UnsupportedOperationException: todo: implement more comprehensive to_real de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: todo: implement more comprehensive to_real: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...