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_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:08,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:08,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:08,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:08,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:08,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:08,374 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:08,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:08,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:08,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:08,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:08,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:08,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:08,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:08,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:08,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:08,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:08,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:08,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:08,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:08,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:08,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:08,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:08,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:08,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:08,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:08,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:08,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:08,432 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:08,433 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:08,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:08,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:08,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:08,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:08,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:08,440 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:08,441 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:11:08,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:08,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:08,468 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:08,468 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:08,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:08,469 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:08,469 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:08,469 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:08,469 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:08,470 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:08,470 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:08,470 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:08,470 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:08,470 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:08,471 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:08,472 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:08,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:08,472 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:08,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:08,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:08,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:08,473 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:08,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:08,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:08,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:08,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:08,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:08,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:08,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:08,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:08,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:08,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:08,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:08,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:08,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:08,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:08,478 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:08,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:08,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:08,478 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:08,479 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:08,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:08,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:08,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:08,537 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:08,538 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:08,539 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl [2018-12-03 16:11:08,539 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-12-03 16:11:08,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:08,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:08,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:08,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:08,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,632 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:08,633 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:08,633 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:08,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:08,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:08,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:08,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:08,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:08,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (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 16:11:08,749 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 16:11:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 16:11:08,749 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 16:11:09,269 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:09,270 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:11:09,270 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:09 BoogieIcfgContainer [2018-12-03 16:11:09,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:09,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:09,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:09,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:09,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/2) ... [2018-12-03 16:11:09,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d3d5a8 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:09, skipping insertion in model container [2018-12-03 16:11:09,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:09" (2/2) ... [2018-12-03 16:11:09,278 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-12-03 16:11:09,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:09,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:11:09,317 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:11:09,351 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:09,352 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:09,352 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:09,352 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:09,352 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:09,352 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:09,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:09,353 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-03 16:11:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-03 16:11:09,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-03 16:11:09,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:09,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,388 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-03 16:11:09,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:09,550 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 16:11:09,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:09,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:11:09,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:09,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:09,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:09,569 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-12-03 16:11:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:09,774 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-12-03 16:11:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:09,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-03 16:11:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:09,789 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:11:09,789 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:11:09,793 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 16:11:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:11:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-03 16:11:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:11:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-12-03 16:11:09,836 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-12-03 16:11:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:09,837 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-12-03 16:11:09,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-12-03 16:11:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:11:09,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:09,839 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:09,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-12-03 16:11:09,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:09,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:09,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:09,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:09,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:09,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:09,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:09,876 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-12-03 16:11:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,001 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-12-03 16:11:10,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:10,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:11:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,004 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:11:10,005 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:11:10,006 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 16:11:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:11:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-03 16:11:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:11:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-12-03 16:11:10,023 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-12-03 16:11:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,024 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-12-03 16:11:10,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-12-03 16:11:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:11:10,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:10,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-12-03 16:11:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:10,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:10,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,069 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-12-03 16:11:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,399 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-12-03 16:11:10,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:10,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:11:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,401 INFO L225 Difference]: With dead ends: 205 [2018-12-03 16:11:10,401 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:11:10,403 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 16:11:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:11:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-12-03 16:11:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:11:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-12-03 16:11:10,417 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-12-03 16:11:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,417 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-12-03 16:11:10,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-12-03 16:11:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:11:10,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,426 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:10,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-12-03 16:11:10,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:10,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:10,628 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-12-03 16:11:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,793 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-12-03 16:11:10,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:10,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 16:11:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,798 INFO L225 Difference]: With dead ends: 321 [2018-12-03 16:11:10,798 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 16:11:10,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 16:11:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-12-03 16:11:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 16:11:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-12-03 16:11:10,831 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-12-03 16:11:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,832 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-12-03 16:11:10,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-12-03 16:11:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:11:10,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,834 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,835 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:10,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-12-03 16:11:10,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:11:10,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:10,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,920 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-12-03 16:11:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,040 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-12-03 16:11:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:11,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 16:11:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,046 INFO L225 Difference]: With dead ends: 522 [2018-12-03 16:11:11,047 INFO L226 Difference]: Without dead ends: 310 [2018-12-03 16:11:11,048 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 16:11:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-03 16:11:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-12-03 16:11:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 16:11:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-12-03 16:11:11,067 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-12-03 16:11:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,067 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-12-03 16:11:11,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-12-03 16:11:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:11:11,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,069 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 16:11:11,070 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:11,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-12-03 16:11:11,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 16:11:11,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:11,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,123 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-12-03 16:11:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,335 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-12-03 16:11:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:11,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 16:11:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,342 INFO L225 Difference]: With dead ends: 588 [2018-12-03 16:11:11,342 INFO L226 Difference]: Without dead ends: 367 [2018-12-03 16:11:11,343 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 16:11:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-12-03 16:11:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-12-03 16:11:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 16:11:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-12-03 16:11:11,387 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-12-03 16:11:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,388 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-12-03 16:11:11,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-12-03 16:11:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:11:11,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,390 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 16:11:11,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:11,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-12-03 16:11:11,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:11:11,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:11,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,482 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-12-03 16:11:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,744 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-12-03 16:11:11,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:11,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 16:11:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,748 INFO L225 Difference]: With dead ends: 880 [2018-12-03 16:11:11,748 INFO L226 Difference]: Without dead ends: 542 [2018-12-03 16:11:11,749 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 16:11:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-12-03 16:11:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-12-03 16:11:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-03 16:11:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-12-03 16:11:11,773 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-12-03 16:11:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-12-03 16:11:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-12-03 16:11:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:11:11,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,776 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 16:11:11,776 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:11,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,776 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-12-03 16:11:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:11:11,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:11,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:11,887 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-12-03 16:11:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:12,023 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-12-03 16:11:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:12,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-03 16:11:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:12,031 INFO L225 Difference]: With dead ends: 1096 [2018-12-03 16:11:12,031 INFO L226 Difference]: Without dead ends: 731 [2018-12-03 16:11:12,032 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 16:11:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-03 16:11:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-12-03 16:11:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-12-03 16:11:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-12-03 16:11:12,061 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-12-03 16:11:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:12,062 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-12-03 16:11:12,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-12-03 16:11:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:11:12,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:12,064 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 16:11:12,064 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:12,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-12-03 16:11:12,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:12,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:12,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:12,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:12,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:12,558 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-03 16:11:12,560 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [11], [17], [23], [26], [28], [33], [36], [38], [43], [46], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [106], [109], [111], [114] [2018-12-03 16:11:12,604 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:12,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:13,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:13,388 INFO L272 AbstractInterpreter]: Visited 28 different actions 142 times. Merged at 27 different actions 85 times. Widened at 1 different actions 1 times. Found 23 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 16:11:13,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:13,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:13,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:13,434 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 16:11:13,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:13,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:13,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:13,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:14,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:14,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 16:11:14,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:14,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:14,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:14,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:11:14,142 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-12-03 16:11:14,657 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 16:11:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:15,047 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-12-03 16:11:15,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:11:15,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-03 16:11:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:15,054 INFO L225 Difference]: With dead ends: 1293 [2018-12-03 16:11:15,055 INFO L226 Difference]: Without dead ends: 1292 [2018-12-03 16:11:15,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:11:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-12-03 16:11:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-12-03 16:11:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-12-03 16:11:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-12-03 16:11:15,099 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-12-03 16:11:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:15,099 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-12-03 16:11:15,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-12-03 16:11:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:11:15,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:15,102 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-12-03 16:11:15,103 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:15,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:15,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-12-03 16:11:15,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 16:11:15,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:15,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:15,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:15,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:15,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:15,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:15,284 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-12-03 16:11:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:15,463 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-12-03 16:11:15,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:15,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 16:11:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:15,472 INFO L225 Difference]: With dead ends: 2655 [2018-12-03 16:11:15,473 INFO L226 Difference]: Without dead ends: 1510 [2018-12-03 16:11:15,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-03 16:11:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-12-03 16:11:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-12-03 16:11:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-12-03 16:11:15,524 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-12-03 16:11:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:15,525 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-12-03 16:11:15,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-12-03 16:11:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:11:15,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:15,528 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:15,528 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:15,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-12-03 16:11:15,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:15,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:15,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 16:11:15,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:15,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:15,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:15,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:15,704 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-12-03 16:11:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:15,862 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-12-03 16:11:15,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:15,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-03 16:11:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:15,871 INFO L225 Difference]: With dead ends: 2726 [2018-12-03 16:11:15,871 INFO L226 Difference]: Without dead ends: 1469 [2018-12-03 16:11:15,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-12-03 16:11:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-12-03 16:11:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-12-03 16:11:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-12-03 16:11:15,927 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-12-03 16:11:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:15,927 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-12-03 16:11:15,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-12-03 16:11:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:11:15,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:15,930 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:15,931 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:15,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-12-03 16:11:15,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 16:11:16,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:16,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:16,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:16,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:16,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:16,010 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-12-03 16:11:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:16,456 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-12-03 16:11:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:16,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-03 16:11:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:16,464 INFO L225 Difference]: With dead ends: 2942 [2018-12-03 16:11:16,465 INFO L226 Difference]: Without dead ends: 1457 [2018-12-03 16:11:16,467 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 16:11:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-12-03 16:11:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-12-03 16:11:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-12-03 16:11:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-12-03 16:11:16,516 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-12-03 16:11:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:16,516 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-12-03 16:11:16,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-12-03 16:11:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:11:16,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:16,520 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:16,520 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:16,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:16,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-12-03 16:11:16,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:16,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:16,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 16:11:16,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:16,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:16,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:16,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:16,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:16,609 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-12-03 16:11:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:16,757 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-12-03 16:11:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:16,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-03 16:11:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:16,766 INFO L225 Difference]: With dead ends: 3297 [2018-12-03 16:11:16,767 INFO L226 Difference]: Without dead ends: 1830 [2018-12-03 16:11:16,769 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 16:11:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-12-03 16:11:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-12-03 16:11:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-12-03 16:11:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-12-03 16:11:16,825 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-12-03 16:11:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:16,826 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-12-03 16:11:16,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-12-03 16:11:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:11:16,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:16,829 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:16,830 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:16,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:16,830 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-12-03 16:11:16,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:16,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,355 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:11:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:11:17,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:17,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:17,601 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-12-03 16:11:17,601 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [17], [23], [26], [28], [33], [36], [38], [41], [43], [46], [57], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [90], [95], [98], [106], [109], [111], [114] [2018-12-03 16:11:17,604 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:17,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:17,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:17,862 INFO L272 AbstractInterpreter]: Visited 34 different actions 165 times. Merged at 31 different actions 86 times. Widened at 1 different actions 1 times. Found 33 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 16:11:17,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:17,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:17,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:17,901 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 16:11:17,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:17,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 16:11:18,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:31,446 WARN L180 SmtUtils]: Spent 12.80 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 16:11:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 4 proven. 127 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 16:11:31,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:31,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 16:11:31,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:31,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:11:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:11:31,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:11:31,908 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 13 states. [2018-12-03 16:11:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:33,384 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-12-03 16:11:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:11:33,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-12-03 16:11:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:33,399 INFO L225 Difference]: With dead ends: 3128 [2018-12-03 16:11:33,399 INFO L226 Difference]: Without dead ends: 3127 [2018-12-03 16:11:33,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:11:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-12-03 16:11:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-12-03 16:11:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-12-03 16:11:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-12-03 16:11:33,453 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-12-03 16:11:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:33,454 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-12-03 16:11:33,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:11:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-12-03 16:11:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:11:33,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:33,457 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:33,458 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:33,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-12-03 16:11:33,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-03 16:11:33,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:33,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:33,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:33,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:33,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:33,536 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-12-03 16:11:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:33,802 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-12-03 16:11:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:33,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-12-03 16:11:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:33,807 INFO L225 Difference]: With dead ends: 2399 [2018-12-03 16:11:33,807 INFO L226 Difference]: Without dead ends: 1130 [2018-12-03 16:11:33,809 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 16:11:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-12-03 16:11:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-12-03 16:11:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-12-03 16:11:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-12-03 16:11:33,847 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-12-03 16:11:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:33,847 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-12-03 16:11:33,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-12-03 16:11:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:11:33,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:33,850 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-12-03 16:11:33,850 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:33,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-12-03 16:11:33,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 16:11:33,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:33,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:33,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:33,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:33,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:33,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:33,929 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-12-03 16:11:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:34,300 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-12-03 16:11:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:34,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-12-03 16:11:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:34,304 INFO L225 Difference]: With dead ends: 2013 [2018-12-03 16:11:34,304 INFO L226 Difference]: Without dead ends: 850 [2018-12-03 16:11:34,305 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 16:11:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-03 16:11:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-12-03 16:11:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 16:11:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-12-03 16:11:34,327 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-12-03 16:11:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:34,328 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-12-03 16:11:34,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-12-03 16:11:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:11:34,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:34,330 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-12-03 16:11:34,330 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:34,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-12-03 16:11:34,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:34,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:34,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 16:11:34,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:34,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:34,513 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-12-03 16:11:34,513 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [15], [17], [23], [26], [28], [33], [36], [38], [41], [43], [46], [57], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [90], [95], [98], [106], [109], [111], [114], [116], [119], [121], [124] [2018-12-03 16:11:34,515 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:34,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:34,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:34,751 INFO L272 AbstractInterpreter]: Visited 39 different actions 220 times. Merged at 34 different actions 111 times. Widened at 1 different actions 1 times. Found 51 fixpoints after 18 different actions. Largest state had 0 variables. [2018-12-03 16:11:34,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:34,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:34,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:34,788 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:34,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:34,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:34,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 16:11:34,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 16:11:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2018-12-03 16:11:35,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:35,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:11:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:11:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:11:35,078 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-12-03 16:11:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:35,783 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-12-03 16:11:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:11:35,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-12-03 16:11:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:35,787 INFO L225 Difference]: With dead ends: 1537 [2018-12-03 16:11:35,787 INFO L226 Difference]: Without dead ends: 1017 [2018-12-03 16:11:35,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:11:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-12-03 16:11:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-12-03 16:11:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-12-03 16:11:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-12-03 16:11:35,814 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-12-03 16:11:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:35,814 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-12-03 16:11:35,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:11:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-12-03 16:11:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:11:35,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:35,817 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:35,817 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:35,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-12-03 16:11:35,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:35,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:35,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:35,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:11:36,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:36,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:36,018 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 16:11:36,018 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [17], [23], [26], [28], [33], [36], [38], [43], [46], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [90], [95], [98], [106], [109], [111], [114] [2018-12-03 16:11:36,020 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:36,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:36,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:36,170 INFO L272 AbstractInterpreter]: Visited 32 different actions 144 times. Merged at 30 different actions 78 times. Widened at 1 different actions 1 times. Found 24 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 16:11:36,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:36,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:36,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:36,207 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:36,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:36,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:36,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:11:36,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:11:36,586 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:11:36,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 16:11:36,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:36,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:36,588 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 3 states. [2018-12-03 16:11:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:36,856 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-12-03 16:11:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:36,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-03 16:11:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:36,859 INFO L225 Difference]: With dead ends: 1396 [2018-12-03 16:11:36,860 INFO L226 Difference]: Without dead ends: 661 [2018-12-03 16:11:36,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-12-03 16:11:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-12-03 16:11:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-12-03 16:11:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 804 transitions. [2018-12-03 16:11:36,883 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 804 transitions. Word has length 99 [2018-12-03 16:11:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:36,884 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 804 transitions. [2018-12-03 16:11:36,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 804 transitions. [2018-12-03 16:11:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:11:36,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:36,886 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:36,886 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:36,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-12-03 16:11:36,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:36,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:36,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:36,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:36,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-03 16:11:36,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:36,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:36,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:36,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:36,967 INFO L87 Difference]: Start difference. First operand 661 states and 804 transitions. Second operand 3 states. [2018-12-03 16:11:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:37,284 INFO L93 Difference]: Finished difference Result 1306 states and 1576 transitions. [2018-12-03 16:11:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:37,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-12-03 16:11:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:37,287 INFO L225 Difference]: With dead ends: 1306 [2018-12-03 16:11:37,287 INFO L226 Difference]: Without dead ends: 667 [2018-12-03 16:11:37,288 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 16:11:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-12-03 16:11:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-12-03 16:11:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-12-03 16:11:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 712 transitions. [2018-12-03 16:11:37,308 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 712 transitions. Word has length 103 [2018-12-03 16:11:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:37,308 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 712 transitions. [2018-12-03 16:11:37,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 712 transitions. [2018-12-03 16:11:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:11:37,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:37,311 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:37,311 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:37,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:37,311 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-12-03 16:11:37,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:37,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:37,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:37,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:37,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 16:11:37,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:37,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:37,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:37,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:37,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:37,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:37,629 INFO L87 Difference]: Start difference. First operand 607 states and 712 transitions. Second operand 5 states. [2018-12-03 16:11:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:38,215 INFO L93 Difference]: Finished difference Result 930 states and 1090 transitions. [2018-12-03 16:11:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:38,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-03 16:11:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:38,216 INFO L225 Difference]: With dead ends: 930 [2018-12-03 16:11:38,216 INFO L226 Difference]: Without dead ends: 336 [2018-12-03 16:11:38,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-03 16:11:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-12-03 16:11:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 16:11:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 388 transitions. [2018-12-03 16:11:38,229 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 388 transitions. Word has length 108 [2018-12-03 16:11:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:38,229 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 388 transitions. [2018-12-03 16:11:38,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 388 transitions. [2018-12-03 16:11:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:11:38,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:38,231 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:38,231 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:38,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-12-03 16:11:38,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:38,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:38,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:38,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:38,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-03 16:11:38,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:38,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:38,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:38,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:38,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:38,311 INFO L87 Difference]: Start difference. First operand 335 states and 388 transitions. Second operand 3 states. [2018-12-03 16:11:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:38,550 INFO L93 Difference]: Finished difference Result 663 states and 769 transitions. [2018-12-03 16:11:38,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:38,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-03 16:11:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:38,552 INFO L225 Difference]: With dead ends: 663 [2018-12-03 16:11:38,552 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 16:11:38,552 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 16:11:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 16:11:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-12-03 16:11:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-03 16:11:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 379 transitions. [2018-12-03 16:11:38,566 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 379 transitions. Word has length 116 [2018-12-03 16:11:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:38,566 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 379 transitions. [2018-12-03 16:11:38,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 379 transitions. [2018-12-03 16:11:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 16:11:38,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:38,568 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:38,569 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:11:38,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:38,569 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-12-03 16:11:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:38,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:38,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:39,201 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-12-03 16:11:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 16:11:39,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:39,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:39,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:11:39,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:11:39,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:39,539 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:39,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:11:39,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:11:39,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:11:39,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:11:39,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 41 proven. 256 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:11:40,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:04,688 WARN L180 SmtUtils]: Spent 24.23 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-03 16:12:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 277 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:12:05,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:05,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2018-12-03 16:12:05,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:05,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:12:05,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:12:05,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:12:05,030 INFO L87 Difference]: Start difference. First operand 331 states and 379 transitions. Second operand 19 states. [2018-12-03 16:12:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:06,454 INFO L93 Difference]: Finished difference Result 1146 states and 1314 transitions. [2018-12-03 16:12:06,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:12:06,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-12-03 16:12:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:06,461 INFO L225 Difference]: With dead ends: 1146 [2018-12-03 16:12:06,461 INFO L226 Difference]: Without dead ends: 1145 [2018-12-03 16:12:06,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:12:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-12-03 16:12:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 419. [2018-12-03 16:12:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 16:12:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 477 transitions. [2018-12-03 16:12:06,475 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 477 transitions. Word has length 121 [2018-12-03 16:12:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:06,476 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 477 transitions. [2018-12-03 16:12:06,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:12:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 477 transitions. [2018-12-03 16:12:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:12:06,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:06,478 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 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 16:12:06,478 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:12:06,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-12-03 16:12:06,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-03 16:12:06,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:06,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:06,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:12:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:12:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:12:06,597 INFO L87 Difference]: Start difference. First operand 419 states and 477 transitions. Second operand 5 states. [2018-12-03 16:12:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:06,671 INFO L93 Difference]: Finished difference Result 673 states and 765 transitions. [2018-12-03 16:12:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:12:06,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-12-03 16:12:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:06,677 INFO L225 Difference]: With dead ends: 673 [2018-12-03 16:12:06,677 INFO L226 Difference]: Without dead ends: 468 [2018-12-03 16:12:06,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-03 16:12:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-12-03 16:12:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-03 16:12:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 469 transitions. [2018-12-03 16:12:06,694 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 469 transitions. Word has length 122 [2018-12-03 16:12:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:06,694 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 469 transitions. [2018-12-03 16:12:06,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:12:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 469 transitions. [2018-12-03 16:12:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:12:06,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:06,696 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 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] [2018-12-03 16:12:06,696 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:12:06,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-12-03 16:12:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 202 proven. 50 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 16:12:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:07,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:07,047 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-12-03 16:12:07,048 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [15], [17], [23], [26], [28], [33], [36], [38], [43], [46], [48], [51], [59], [62], [64], [67], [69], [72], [74], [77], [83], [85], [88], [90], [93], [95], [98], [106], [109], [111], [114], [116], [119], [121], [126], [129] [2018-12-03 16:12:07,050 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:07,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:07,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:07,258 INFO L272 AbstractInterpreter]: Visited 42 different actions 241 times. Merged at 36 different actions 127 times. Widened at 1 different actions 1 times. Found 49 fixpoints after 18 different actions. Largest state had 0 variables. [2018-12-03 16:12:07,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:07,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:07,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:07,296 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:07,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:07,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:07,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 16:12:07,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 79 proven. 191 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 16:12:08,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:08,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 16:12:08,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:08,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:12:08,110 INFO L87 Difference]: Start difference. First operand 412 states and 469 transitions. Second operand 9 states. [2018-12-03 16:12:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:08,638 INFO L93 Difference]: Finished difference Result 845 states and 962 transitions. [2018-12-03 16:12:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:12:08,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-12-03 16:12:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:08,643 INFO L225 Difference]: With dead ends: 845 [2018-12-03 16:12:08,643 INFO L226 Difference]: Without dead ends: 844 [2018-12-03 16:12:08,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-12-03 16:12:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-12-03 16:12:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 16:12:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 644 transitions. [2018-12-03 16:12:08,674 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 644 transitions. Word has length 123 [2018-12-03 16:12:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:08,675 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 644 transitions. [2018-12-03 16:12:08,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 644 transitions. [2018-12-03 16:12:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:12:08,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:08,678 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:08,678 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:12:08,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-12-03 16:12:08,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-12-03 16:12:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:12:08,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:08,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:12:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:12:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:12:08,775 INFO L87 Difference]: Start difference. First operand 570 states and 644 transitions. Second operand 3 states. [2018-12-03 16:12:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:08,893 INFO L93 Difference]: Finished difference Result 1086 states and 1225 transitions. [2018-12-03 16:12:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:12:08,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-12-03 16:12:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:08,895 INFO L225 Difference]: With dead ends: 1086 [2018-12-03 16:12:08,895 INFO L226 Difference]: Without dead ends: 479 [2018-12-03 16:12:08,896 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 16:12:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-12-03 16:12:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-12-03 16:12:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-03 16:12:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 419 transitions. [2018-12-03 16:12:08,913 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 419 transitions. Word has length 159 [2018-12-03 16:12:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:08,913 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 419 transitions. [2018-12-03 16:12:08,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:12:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 419 transitions. [2018-12-03 16:12:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:12:08,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:08,915 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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] [2018-12-03 16:12:08,915 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 16:12:08,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-12-03 16:12:08,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:08,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:09,295 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 16:12:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 471 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 16:12:10,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:10,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:10,042 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-12-03 16:12:10,042 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [15], [17], [23], [26], [28], [33], [36], [38], [41], [43], [46], [48], [51], [57], [59], [62], [64], [67], [69], [72], [74], [77], [83], [85], [88], [90], [93], [95], [98], [106], [109], [111], [114], [116], [119], [121], [126], [129] [2018-12-03 16:12:10,045 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:10,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:10,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:10,333 INFO L272 AbstractInterpreter]: Visited 44 different actions 338 times. Merged at 40 different actions 180 times. Widened at 2 different actions 2 times. Found 88 fixpoints after 21 different actions. Largest state had 0 variables. [2018-12-03 16:12:10,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:10,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:10,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:10,374 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:10,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:10,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:10,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:11,288 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:12:11,764 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 16:12:12,206 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2018-12-03 16:12:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 308 proven. 86 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-03 16:12:12,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:12,908 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-03 16:12:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 297 proven. 97 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-03 16:12:13,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:13,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2018-12-03 16:12:13,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:13,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:12:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:12:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:12:13,063 INFO L87 Difference]: Start difference. First operand 382 states and 419 transitions. Second operand 21 states. [2018-12-03 16:12:13,742 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-12-03 16:12:14,131 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2018-12-03 16:12:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:15,299 INFO L93 Difference]: Finished difference Result 1164 states and 1289 transitions. [2018-12-03 16:12:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:12:15,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-12-03 16:12:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:15,300 INFO L225 Difference]: With dead ends: 1164 [2018-12-03 16:12:15,300 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:12:15,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:12:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:12:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:12:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:12:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:12:15,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-12-03 16:12:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:15,302 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:12:15,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:12:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:12:15,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:12:15,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:12:15,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:15,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:12:16,854 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 552 DAG size of output: 441 [2018-12-03 16:12:23,142 WARN L180 SmtUtils]: Spent 6.28 s on a formula simplification. DAG size of input: 415 DAG size of output: 136 [2018-12-03 16:12:23,146 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-12-03 16:12:23,146 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-12-03 16:12:23,146 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-12-03 16:12:23,147 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-12-03 16:12:23,148 INFO L444 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse32 (+ Elevator_dir 1))) (let ((.cse35 (+ Elevator_min 1)) (.cse23 (+ Elevator_dir Elevator_goal)) (.cse26 (= .cse32 0)) (.cse34 (+ Elevator_dir Elevator_current)) (.cse10 (<= Elevator_min Elevator_current)) (.cse11 (<= Elevator_current Elevator_max)) (.cse12 (= Elevator_qDC1 2)) (.cse36 (= Elevator_qCSP 1)) (.cse24 (= Elevator_dir 1))) (let ((.cse9 (= Elevator_qDC2 3)) (.cse14 (<= 3 Elevator_qCSP)) (.cse25 (<= Elevator_current Elevator_goal)) (.cse27 (or (<= Elevator_goal Elevator_current) .cse24)) (.cse28 (and .cse10 .cse11 .cse12 .cse36)) (.cse31 (= Elevator_min Elevator_current)) (.cse29 (<= Elevator_min .cse34)) (.cse30 (<= Elevator_dir 1)) (.cse0 (or (<= Elevator_current .cse23) .cse26)) (.cse1 (or (and .cse11 (<= .cse35 Elevator_current)) (and (<= (+ Elevator_current 1) Elevator_max) .cse10))) (.cse2 (or (<= (+ Elevator_min 2) .cse34) (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2)))) (.cse33 (= Elevator_qDC2 1)) (.cse22 (<= Elevator_qDC1 1)) (.cse7 (not Elevator_passed)) (.cse13 (not Elevator_newgoal)) (.cse16 (not (= .cse23 Elevator_current))) (.cse17 (or (<= .cse23 Elevator_current) .cse24)) (.cse3 (<= Elevator_goal Elevator_max)) (.cse15 (<= Elevator_min Elevator_goal)) (.cse4 (<= Elevator_c2 2)) (.cse8 (not Elevator_stop)) (.cse19 (not (= Elevator_current Elevator_goal))) (.cse20 (not (= Elevator_qCSP 3))) (.cse21 (= Elevator_qDC2 2)) (.cse5 (<= Elevator_c2 Elevator_c3)) (.cse18 (not Elevator_start))) (or (and .cse0 .cse1 .cse2 .cse3 (and (and .cse4 .cse5 (and (let ((.cse6 (and .cse8 .cse9 (and .cse10 .cse11 .cse12)))) (or (and (<= 0 Elevator_c3) .cse6 (<= Elevator_c2 0)) (and .cse6 .cse7))) .cse13 .cse14)) .cse15) .cse16 .cse17 .cse18) (and .cse3 .cse15 (and (and .cse8 (and .cse19 .cse20 .cse21 .cse22 .cse7)) .cse10 .cse11 .cse5) .cse18) (and .cse13 .cse22 .cse14 .cse8 .cse5 (<= .cse23 (+ Elevator_max 1)) (= Elevator_current Elevator_min) .cse24 .cse21 (< Elevator_current Elevator_goal)) (and .cse8 .cse5 .cse12 (and .cse19 .cse10 .cse11) .cse9 .cse7) (and (and (and .cse4 (and (and .cse8 (and .cse19 .cse10 .cse11 .cse12 .cse21)) .cse13 .cse14)) .cse3 .cse15) (or .cse25 .cse26) .cse27) (and .cse8 .cse28 .cse5 .cse9 .cse7) (and .cse29 .cse30 (and .cse8 .cse5 (and (and (and .cse20 .cse31 .cse22) (not (= Elevator_min Elevator_goal))) .cse21)) .cse25 .cse3 .cse18) (and (and .cse3 (or .cse26 .cse24) .cse15 (and (and .cse8 (and .cse10 .cse11 .cse21 (and .cse19 .cse22 .cse7))) .cse13 .cse14)) (or (<= .cse32 0) .cse25) .cse27) (and .cse0 .cse1 .cse2 (and .cse4 .cse5 .cse15 (and .cse28 .cse33 .cse13)) .cse3 .cse16 .cse17 .cse18) (and (<= .cse34 Elevator_goal) (and .cse3 (and .cse33 (and .cse5 (and .cse31 (<= .cse35 Elevator_max) .cse22 .cse36)))) .cse29 .cse30) (and .cse0 .cse1 .cse2 (and .cse5 (and .cse33 (and .cse36 .cse22 .cse7) .cse13) .cse15) .cse3 .cse16 .cse17 .cse18) (and .cse3 .cse15 (and .cse4 (and .cse8 (and .cse19 .cse20 .cse12 .cse21)) .cse10 .cse11 .cse5) .cse18))))) [2018-12-03 16:12:23,148 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-12-03 16:12:23,148 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-12-03 16:12:23,148 INFO L448 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-12-03 16:12:23,148 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-12-03 16:12:23,148 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-12-03 16:12:23,148 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-12-03 16:12:23,148 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-12-03 16:12:23,149 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-12-03 16:12:23,164 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:12:23 BoogieIcfgContainer [2018-12-03 16:12:23,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:12:23,165 INFO L168 Benchmark]: Toolchain (without parser) took 74571.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -956.6 MB). Peak memory consumption was 982.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:12:23,166 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:12:23,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.81 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 16:12:23,167 INFO L168 Benchmark]: Boogie Preprocessor took 32.80 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 16:12:23,168 INFO L168 Benchmark]: RCFGBuilder took 601.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:12:23,168 INFO L168 Benchmark]: TraceAbstraction took 73892.93 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -988.3 MB). Peak memory consumption was 950.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:12:23,172 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.81 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 32.80 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 601.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73892.93 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -988.3 MB). Peak memory consumption was 950.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && goal <= max) && ((c2 <= 2 && c2 <= c3) && ((((0 <= c3 && (!stop && qDC2 == 3) && (min <= current && current <= max) && qDC1 == 2) && c2 <= 0) || (((!stop && qDC2 == 3) && (min <= current && current <= max) && qDC1 == 2) && !passed)) && !newgoal) && 3 <= qCSP) && min <= goal) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start) || (((goal <= max && min <= goal) && (((!stop && (((!(current == goal) && !(qCSP == 3)) && qDC2 == 2) && qDC1 <= 1) && !passed) && min <= current) && current <= max) && c2 <= c3) && !start)) || (((((((((!newgoal && qDC1 <= 1) && 3 <= qCSP) && !stop) && c2 <= c3) && dir + goal <= max + 1) && current == min) && dir == 1) && qDC2 == 2) && current < goal)) || (((((!stop && c2 <= c3) && qDC1 == 2) && (!(current == goal) && min <= current) && current <= max) && qDC2 == 3) && !passed)) || (((((c2 <= 2 && ((!stop && (((!(current == goal) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !newgoal) && 3 <= qCSP) && goal <= max) && min <= goal) && (current <= goal || dir + 1 == 0)) && (goal <= current || dir == 1))) || ((((!stop && ((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && c2 <= c3) && qDC2 == 3) && !passed)) || (((((min <= dir + current && dir <= 1) && (!stop && c2 <= c3) && (((!(qCSP == 3) && min == current) && qDC1 <= 1) && !(min == goal)) && qDC2 == 2) && current <= goal) && goal <= max) && !start)) || (((((goal <= max && (dir + 1 == 0 || dir == 1)) && min <= goal) && ((!stop && ((min <= current && current <= max) && qDC2 == 2) && (!(current == goal) && qDC1 <= 1) && !passed) && !newgoal) && 3 <= qCSP) && (dir + 1 <= 0 || current <= goal)) && (goal <= current || dir == 1))) || ((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && ((c2 <= 2 && c2 <= c3) && min <= goal) && ((((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && qDC2 == 1) && !newgoal) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || (((dir + current <= goal && goal <= max && qDC2 == 1 && c2 <= c3 && ((min == current && min + 1 <= max) && qDC1 <= 1) && qCSP == 1) && min <= dir + current) && dir <= 1)) || ((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && (c2 <= c3 && (qDC2 == 1 && (qCSP == 1 && qDC1 <= 1) && !passed) && !newgoal) && min <= goal) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || (((goal <= max && min <= goal) && (((c2 <= 2 && !stop && ((!(current == goal) && !(qCSP == 3)) && qDC1 == 2) && qDC2 == 2) && min <= current) && current <= max) && c2 <= c3) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 73.8s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 7.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1786 SDtfs, 4180 SDslu, 4736 SDs, 0 SdLazy, 2548 SolverSat, 348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1447 SyntacticMatches, 13 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 50.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1612occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4291 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 68 NumberOfFragments, 680 HoareAnnotationTreeSize, 1 FomulaSimplifications, 527964 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 154448 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 49.2s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3430 ConstructedInterpolants, 47 QuantifiedInterpolants, 3978092 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 40 InterpolantComputations, 21 PerfectInterpolantSequences, 5087/7371 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...