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_oct_cong.epf -i ../../../trunk/examples/programs/real-life/Elevator-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:10,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:10,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:10,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:10,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:10,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:10,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:10,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:10,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:10,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:10,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:10,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:10,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:10,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:10,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:10,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:10,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:10,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:10,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:10,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:10,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:10,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:10,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:10,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:10,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:10,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:10,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:10,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:10,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:10,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:10,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:10,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:10,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:10,419 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:10,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:10,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:10,421 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:13:10,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:10,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:10,446 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:10,447 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:10,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:10,447 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:10,447 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:10,447 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:10,448 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:10,448 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:10,449 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:10,449 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:10,449 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:10,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:10,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:10,450 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:10,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:10,452 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:10,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:10,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:10,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:10,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:10,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:10,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:10,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:10,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:10,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:10,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:10,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:10,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:10,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:10,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:10,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:10,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:10,456 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:10,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:10,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:10,457 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:10,458 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:10,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:10,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:10,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:10,525 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:10,526 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:10,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-12-03 17:13:10,527 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-12-03 17:13:10,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:10,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:10,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:10,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:10,575 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:10,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,613 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:10,613 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:10,613 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:10,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:10,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:10,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:10,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:10,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:10,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:10,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:10,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:10,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (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 17:13:10,757 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 17:13:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 17:13:10,758 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 17:13:11,333 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:11,333 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:13:11,334 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:11 BoogieIcfgContainer [2018-12-03 17:13:11,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:11,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:11,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:11,338 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:11,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/2) ... [2018-12-03 17:13:11,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c23f32 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:13:11, skipping insertion in model container [2018-12-03 17:13:11,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:11" (2/2) ... [2018-12-03 17:13:11,342 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-12-03 17:13:11,350 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:11,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:13:11,375 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:13:11,407 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:11,408 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:11,408 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:11,408 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:11,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:11,408 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:11,409 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:11,409 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-03 17:13:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:11,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:11,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:11,436 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:11,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-12-03 17:13:11,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:11,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:11,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:11,595 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 17:13:11,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:11,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:13:11,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:11,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:11,621 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-12-03 17:13:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:11,761 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-12-03 17:13:11,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:11,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 17:13:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:11,778 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:13:11,778 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:13:11,782 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 17:13:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:13:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-03 17:13:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:13:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-12-03 17:13:11,824 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-12-03 17:13:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:11,825 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-12-03 17:13:11,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-12-03 17:13:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:11,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:11,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:11,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:11,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-12-03 17:13:11,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:11,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:11,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:11,906 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 17:13:11,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:11,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:13:11,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:11,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:11,910 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-12-03 17:13:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,231 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-12-03 17:13:12,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:12,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 17:13:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,235 INFO L225 Difference]: With dead ends: 154 [2018-12-03 17:13:12,237 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:13:12,239 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 17:13:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:13:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-03 17:13:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:13:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-12-03 17:13:12,262 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-12-03 17:13:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,262 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-12-03 17:13:12,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-12-03 17:13:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:12,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:12,268 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:12,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-12-03 17:13:12,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,375 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 17:13:12,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:12,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:12,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:12,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:12,378 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-12-03 17:13:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,682 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-12-03 17:13:12,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:12,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 17:13:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,685 INFO L225 Difference]: With dead ends: 233 [2018-12-03 17:13:12,686 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 17:13:12,687 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 17:13:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 17:13:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-12-03 17:13:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:13:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-12-03 17:13:12,702 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-12-03 17:13:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,702 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-12-03 17:13:12,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-12-03 17:13:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:13:12,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:12,704 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:12,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-12-03 17:13:12,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,852 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 17:13:12,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:13:12,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:12,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:12,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:12,854 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-12-03 17:13:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,024 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-12-03 17:13:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:13:13,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 17:13:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,029 INFO L225 Difference]: With dead ends: 144 [2018-12-03 17:13:13,029 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 17:13:13,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 17:13:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-12-03 17:13:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 17:13:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-12-03 17:13:13,044 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-12-03 17:13:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,045 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-12-03 17:13:13,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-12-03 17:13:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:13:13,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:13,047 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:13,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-12-03 17:13:13,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,176 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 17:13:13,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:13,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:13,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:13,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:13,178 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-12-03 17:13:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,340 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-12-03 17:13:13,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:13,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-03 17:13:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,344 INFO L225 Difference]: With dead ends: 459 [2018-12-03 17:13:13,344 INFO L226 Difference]: Without dead ends: 286 [2018-12-03 17:13:13,346 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 17:13:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-03 17:13:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-12-03 17:13:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-03 17:13:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-12-03 17:13:13,371 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-12-03 17:13:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,371 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-12-03 17:13:13,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-12-03 17:13:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:13:13,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,374 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:13,374 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:13,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-12-03 17:13:13,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 17:13:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:13,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,427 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-12-03 17:13:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,744 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-12-03 17:13:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-03 17:13:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,748 INFO L225 Difference]: With dead ends: 695 [2018-12-03 17:13:13,748 INFO L226 Difference]: Without dead ends: 402 [2018-12-03 17:13:13,750 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 17:13:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-03 17:13:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-12-03 17:13:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 17:13:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-12-03 17:13:13,776 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-12-03 17:13:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,777 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-12-03 17:13:13,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-12-03 17:13:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:13:13,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,783 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:13,786 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:13,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-12-03 17:13:13,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 17:13:13,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:13,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,883 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-12-03 17:13:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,996 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-12-03 17:13:13,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 17:13:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:14,001 INFO L225 Difference]: With dead ends: 711 [2018-12-03 17:13:14,002 INFO L226 Difference]: Without dead ends: 414 [2018-12-03 17:13:14,006 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 17:13:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-03 17:13:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-12-03 17:13:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 17:13:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-12-03 17:13:14,033 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-12-03 17:13:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:14,033 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-12-03 17:13:14,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-12-03 17:13:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:13:14,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:14,037 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:14,038 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:14,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-12-03 17:13:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:14,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:14,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 17:13:14,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:14,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:14,198 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 17:13:14,200 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [15], [21], [24], [26], [31], [34], [36], [41], [44], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [102], [131], [132] [2018-12-03 17:13:14,272 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:14,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:15,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:15,071 INFO L272 AbstractInterpreter]: Visited 25 different actions 100 times. Merged at 23 different actions 56 times. Never widened. Found 14 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:13:15,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:15,085 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:15,388 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 29.42% of their original sizes. [2018-12-03 17:13:15,389 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:17,371 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-03 17:13:17,371 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:17,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:17,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 22 [2018-12-03 17:13:17,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:17,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:13:17,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:13:17,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:17,374 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 19 states. [2018-12-03 17:13:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:35,037 INFO L93 Difference]: Finished difference Result 1064 states and 1630 transitions. [2018-12-03 17:13:35,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:13:35,038 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-12-03 17:13:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:35,042 INFO L225 Difference]: With dead ends: 1064 [2018-12-03 17:13:35,042 INFO L226 Difference]: Without dead ends: 735 [2018-12-03 17:13:35,044 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=465, Invalid=1427, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:13:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-03 17:13:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 500. [2018-12-03 17:13:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-12-03 17:13:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 783 transitions. [2018-12-03 17:13:35,074 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 783 transitions. Word has length 43 [2018-12-03 17:13:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:35,074 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 783 transitions. [2018-12-03 17:13:35,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:13:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 783 transitions. [2018-12-03 17:13:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:13:35,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:35,076 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 17:13:35,077 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:35,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1711532042, now seen corresponding path program 1 times [2018-12-03 17:13:35,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:35,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:35,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 17:13:35,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:35,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:35,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:35,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:35,163 INFO L87 Difference]: Start difference. First operand 500 states and 783 transitions. Second operand 3 states. [2018-12-03 17:13:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:35,335 INFO L93 Difference]: Finished difference Result 940 states and 1456 transitions. [2018-12-03 17:13:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:35,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 17:13:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:35,338 INFO L225 Difference]: With dead ends: 940 [2018-12-03 17:13:35,338 INFO L226 Difference]: Without dead ends: 445 [2018-12-03 17:13:35,340 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 17:13:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-12-03 17:13:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 379. [2018-12-03 17:13:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-12-03 17:13:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 581 transitions. [2018-12-03 17:13:35,358 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 581 transitions. Word has length 44 [2018-12-03 17:13:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:35,358 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 581 transitions. [2018-12-03 17:13:35,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 581 transitions. [2018-12-03 17:13:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:13:35,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:35,362 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 17:13:35,362 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:35,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 739115210, now seen corresponding path program 1 times [2018-12-03 17:13:35,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 17:13:35,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:35,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:35,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:35,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:35,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:35,494 INFO L87 Difference]: Start difference. First operand 379 states and 581 transitions. Second operand 3 states. [2018-12-03 17:13:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:35,824 INFO L93 Difference]: Finished difference Result 961 states and 1486 transitions. [2018-12-03 17:13:35,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:35,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 17:13:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:35,827 INFO L225 Difference]: With dead ends: 961 [2018-12-03 17:13:35,828 INFO L226 Difference]: Without dead ends: 568 [2018-12-03 17:13:35,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 17:13:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-03 17:13:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 567. [2018-12-03 17:13:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-03 17:13:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 866 transitions. [2018-12-03 17:13:35,849 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 866 transitions. Word has length 44 [2018-12-03 17:13:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:35,850 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 866 transitions. [2018-12-03 17:13:35,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 866 transitions. [2018-12-03 17:13:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:13:35,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:35,851 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 17:13:35,852 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:35,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2125318604, now seen corresponding path program 2 times [2018-12-03 17:13:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:13:35,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:35,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:35,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:35,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:35,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:35,929 INFO L87 Difference]: Start difference. First operand 567 states and 866 transitions. Second operand 3 states. [2018-12-03 17:13:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:36,170 INFO L93 Difference]: Finished difference Result 1127 states and 1721 transitions. [2018-12-03 17:13:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:36,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 17:13:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:36,173 INFO L225 Difference]: With dead ends: 1127 [2018-12-03 17:13:36,174 INFO L226 Difference]: Without dead ends: 568 [2018-12-03 17:13:36,175 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 17:13:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-03 17:13:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 567. [2018-12-03 17:13:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-03 17:13:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 822 transitions. [2018-12-03 17:13:36,195 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 822 transitions. Word has length 44 [2018-12-03 17:13:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:36,196 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 822 transitions. [2018-12-03 17:13:36,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 822 transitions. [2018-12-03 17:13:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:13:36,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:36,197 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:36,198 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:36,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-12-03 17:13:36,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:36,487 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-03 17:13:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:36,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:36,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:36,899 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-03 17:13:36,899 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [15], [21], [24], [26], [31], [34], [36], [41], [44], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [104], [107], [109], [112], [131], [132] [2018-12-03 17:13:36,902 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:36,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:37,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:37,072 INFO L272 AbstractInterpreter]: Visited 28 different actions 144 times. Merged at 26 different actions 83 times. Never widened. Found 20 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 17:13:37,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:37,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:37,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:37,078 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 17:13:37,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:37,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:37,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:37,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:38,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:38,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2018-12-03 17:13:38,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:38,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:13:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:13:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:13:38,331 INFO L87 Difference]: Start difference. First operand 567 states and 822 transitions. Second operand 16 states. [2018-12-03 17:13:39,444 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:13:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:40,568 INFO L93 Difference]: Finished difference Result 2782 states and 3943 transitions. [2018-12-03 17:13:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:13:40,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-12-03 17:13:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:40,580 INFO L225 Difference]: With dead ends: 2782 [2018-12-03 17:13:40,581 INFO L226 Difference]: Without dead ends: 2163 [2018-12-03 17:13:40,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=333, Invalid=999, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:13:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2018-12-03 17:13:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1105. [2018-12-03 17:13:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2018-12-03 17:13:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1638 transitions. [2018-12-03 17:13:40,639 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1638 transitions. Word has length 48 [2018-12-03 17:13:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:40,640 INFO L480 AbstractCegarLoop]: Abstraction has 1105 states and 1638 transitions. [2018-12-03 17:13:40,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:13:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1638 transitions. [2018-12-03 17:13:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:13:40,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:40,642 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:40,642 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:40,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-12-03 17:13:40,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:40,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:40,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 17:13:40,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:40,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:40,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:40,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:40,821 INFO L87 Difference]: Start difference. First operand 1105 states and 1638 transitions. Second operand 4 states. [2018-12-03 17:13:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:41,004 INFO L93 Difference]: Finished difference Result 2203 states and 3265 transitions. [2018-12-03 17:13:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:41,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 17:13:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:41,010 INFO L225 Difference]: With dead ends: 2203 [2018-12-03 17:13:41,011 INFO L226 Difference]: Without dead ends: 1106 [2018-12-03 17:13:41,012 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 17:13:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-12-03 17:13:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1102. [2018-12-03 17:13:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2018-12-03 17:13:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1569 transitions. [2018-12-03 17:13:41,057 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1569 transitions. Word has length 67 [2018-12-03 17:13:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:41,057 INFO L480 AbstractCegarLoop]: Abstraction has 1102 states and 1569 transitions. [2018-12-03 17:13:41,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1569 transitions. [2018-12-03 17:13:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:13:41,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:41,059 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:41,060 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:41,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-12-03 17:13:41,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:41,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:13:41,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:41,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:41,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:41,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:41,140 INFO L87 Difference]: Start difference. First operand 1102 states and 1569 transitions. Second operand 3 states. [2018-12-03 17:13:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:41,237 INFO L93 Difference]: Finished difference Result 2206 states and 3133 transitions. [2018-12-03 17:13:41,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:41,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-03 17:13:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:41,243 INFO L225 Difference]: With dead ends: 2206 [2018-12-03 17:13:41,243 INFO L226 Difference]: Without dead ends: 1022 [2018-12-03 17:13:41,245 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 17:13:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-12-03 17:13:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1000. [2018-12-03 17:13:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 17:13:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1371 transitions. [2018-12-03 17:13:41,288 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1371 transitions. Word has length 68 [2018-12-03 17:13:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:41,289 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1371 transitions. [2018-12-03 17:13:41,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1371 transitions. [2018-12-03 17:13:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:13:41,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:41,291 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 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 17:13:41,292 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:41,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-12-03 17:13:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:41,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:41,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 17:13:42,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:42,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:42,205 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-12-03 17:13:42,206 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [15], [21], [24], [26], [31], [34], [36], [39], [41], [44], [55], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [88], [93], [96], [104], [107], [109], [112], [131], [132] [2018-12-03 17:13:42,208 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:42,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:42,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:42,514 INFO L272 AbstractInterpreter]: Visited 34 different actions 196 times. Merged at 31 different actions 100 times. Never widened. Found 35 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 17:13:42,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:42,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:42,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:42,555 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 17:13:42,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:42,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:42,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:13:43,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:44,083 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2018-12-03 17:13:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 5 proven. 122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 17:13:44,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:44,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 38 [2018-12-03 17:13:44,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:44,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:13:44,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:13:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:13:44,269 INFO L87 Difference]: Start difference. First operand 1000 states and 1371 transitions. Second operand 27 states. [2018-12-03 17:13:45,561 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-03 17:13:46,634 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2018-12-03 17:13:46,868 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-12-03 17:13:47,163 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-03 17:13:47,372 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-03 17:13:47,600 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2018-12-03 17:13:47,775 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-12-03 17:13:48,025 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-03 17:13:48,815 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2018-12-03 17:13:49,115 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 75 [2018-12-03 17:13:49,363 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-03 17:13:49,609 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-03 17:13:49,872 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-12-03 17:13:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:50,260 INFO L93 Difference]: Finished difference Result 3806 states and 4994 transitions. [2018-12-03 17:13:50,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:13:50,261 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-12-03 17:13:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:50,271 INFO L225 Difference]: With dead ends: 3806 [2018-12-03 17:13:50,271 INFO L226 Difference]: Without dead ends: 2772 [2018-12-03 17:13:50,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1130, Invalid=4420, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:13:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2018-12-03 17:13:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 1083. [2018-12-03 17:13:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-12-03 17:13:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1491 transitions. [2018-12-03 17:13:50,349 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1491 transitions. Word has length 84 [2018-12-03 17:13:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:50,350 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 1491 transitions. [2018-12-03 17:13:50,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:13:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1491 transitions. [2018-12-03 17:13:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:13:50,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:50,352 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:50,353 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:50,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-12-03 17:13:50,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:50,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:50,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 17:13:50,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:50,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:50,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:50,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:50,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:50,467 INFO L87 Difference]: Start difference. First operand 1083 states and 1491 transitions. Second operand 3 states. [2018-12-03 17:13:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:50,756 INFO L93 Difference]: Finished difference Result 2159 states and 2971 transitions. [2018-12-03 17:13:50,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:50,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-03 17:13:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:50,762 INFO L225 Difference]: With dead ends: 2159 [2018-12-03 17:13:50,762 INFO L226 Difference]: Without dead ends: 1084 [2018-12-03 17:13:50,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 17:13:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2018-12-03 17:13:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1028. [2018-12-03 17:13:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-12-03 17:13:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1384 transitions. [2018-12-03 17:13:50,826 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1384 transitions. Word has length 85 [2018-12-03 17:13:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:50,827 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1384 transitions. [2018-12-03 17:13:50,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1384 transitions. [2018-12-03 17:13:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:13:50,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:50,831 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 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 17:13:50,831 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:50,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:50,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1131673137, now seen corresponding path program 1 times [2018-12-03 17:13:50,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:50,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-03 17:13:50,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:50,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:50,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:50,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:50,920 INFO L87 Difference]: Start difference. First operand 1028 states and 1384 transitions. Second operand 3 states. [2018-12-03 17:13:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:51,030 INFO L93 Difference]: Finished difference Result 1693 states and 2267 transitions. [2018-12-03 17:13:51,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:51,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-03 17:13:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:51,033 INFO L225 Difference]: With dead ends: 1693 [2018-12-03 17:13:51,033 INFO L226 Difference]: Without dead ends: 648 [2018-12-03 17:13:51,034 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 17:13:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-12-03 17:13:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 555. [2018-12-03 17:13:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-03 17:13:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 720 transitions. [2018-12-03 17:13:51,072 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 720 transitions. Word has length 86 [2018-12-03 17:13:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:51,072 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 720 transitions. [2018-12-03 17:13:51,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 720 transitions. [2018-12-03 17:13:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:13:51,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:51,074 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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 17:13:51,074 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:51,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-12-03 17:13:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 17:13:51,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:51,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:51,197 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-12-03 17:13:51,197 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [15], [21], [24], [26], [31], [34], [36], [39], [41], [44], [55], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [88], [93], [96], [104], [107], [109], [112], [114], [117], [119], [122], [131], [132] [2018-12-03 17:13:51,199 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:51,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:51,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:51,494 INFO L272 AbstractInterpreter]: Visited 39 different actions 318 times. Merged at 37 different actions 168 times. Widened at 1 different actions 1 times. Found 73 fixpoints after 22 different actions. Largest state had 0 variables. [2018-12-03 17:13:51,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:51,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:51,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:51,523 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 17:13:51,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:51,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:51,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 17:13:51,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 17:13:51,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:51,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:13:51,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:51,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:51,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:51,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:13:51,729 INFO L87 Difference]: Start difference. First operand 555 states and 720 transitions. Second operand 7 states. [2018-12-03 17:13:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:51,879 INFO L93 Difference]: Finished difference Result 1399 states and 1807 transitions. [2018-12-03 17:13:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:13:51,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 17:13:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:51,883 INFO L225 Difference]: With dead ends: 1399 [2018-12-03 17:13:51,883 INFO L226 Difference]: Without dead ends: 728 [2018-12-03 17:13:51,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:13:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-03 17:13:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 325. [2018-12-03 17:13:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 17:13:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 411 transitions. [2018-12-03 17:13:51,912 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 411 transitions. Word has length 89 [2018-12-03 17:13:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:51,912 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 411 transitions. [2018-12-03 17:13:51,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 411 transitions. [2018-12-03 17:13:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:13:51,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:51,913 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:51,914 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:51,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:51,914 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-12-03 17:13:51,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:51,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:51,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-03 17:13:51,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:51,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:51,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:51,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:51,998 INFO L87 Difference]: Start difference. First operand 325 states and 411 transitions. Second operand 3 states. [2018-12-03 17:13:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:52,356 INFO L93 Difference]: Finished difference Result 568 states and 707 transitions. [2018-12-03 17:13:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:52,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-03 17:13:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:52,357 INFO L225 Difference]: With dead ends: 568 [2018-12-03 17:13:52,357 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:13:52,358 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 17:13:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:13:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:13:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:13:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:13:52,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-12-03 17:13:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:52,360 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:13:52,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:13:52,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:13:52,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:13:52,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:52,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:53,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:53,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:53,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:53,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:53,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:54,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:54,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:54,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:54,713 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 641 DAG size of output: 533 [2018-12-03 17:14:00,645 WARN L180 SmtUtils]: Spent 5.92 s on a formula simplification. DAG size of input: 510 DAG size of output: 114 [2018-12-03 17:14:00,649 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-12-03 17:14:00,649 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-12-03 17:14:00,649 INFO L448 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-12-03 17:14:00,649 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-12-03 17:14:00,649 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-12-03 17:14:00,649 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-12-03 17:14:00,650 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-12-03 17:14:00,651 INFO L444 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse16 (<= |Elevator_goal'| |Elevator_current'|)) (.cse15 (<= |Elevator_current'| |Elevator_goal'|)) (.cse0 (<= Elevator_c2 Elevator_c3))) (let ((.cse7 (= Elevator_qCSP 1)) (.cse5 (<= Elevator_qDC2 1)) (.cse29 (or (<= Elevator_c2 2) .cse0)) (.cse19 (<= |Elevator_current'| (+ |Elevator_dir'| Elevator_max))) (.cse25 (or (<= (+ |Elevator_goal'| 1) |Elevator_current'|) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|)))) (.cse20 (or (= (+ |Elevator_dir'| 1) 0) .cse15)) (.cse26 (or (= |Elevator_dir'| 1) .cse16)) (.cse21 (<= Elevator_qDC2 2)) (.cse23 (<= 2 Elevator_qDC2)) (.cse18 (<= Elevator_qDC1 1)) (.cse27 (not Elevator_passed)) (.cse28 (not (= Elevator_qCSP 3))) (.cse24 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse14 (not Elevator_stop)) (.cse13 (= Elevator_qDC2 3)) (.cse1 (= Elevator_qDC1 2)) (.cse2 (<= |Elevator_current'| Elevator_max)) (.cse3 (<= Elevator_min Elevator_current)) (.cse4 (<= Elevator_current Elevator_max)) (.cse6 (<= Elevator_min |Elevator_current'|)) (.cse8 (<= |Elevator_goal'| Elevator_max)) (.cse9 (<= Elevator_min |Elevator_goal'|)) (.cse10 (<= Elevator_goal Elevator_max)) (.cse11 (<= Elevator_min Elevator_goal)) (.cse12 (not Elevator_newgoal))) (or (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) .cse12) (and .cse0 (and .cse2 .cse3 .cse6 .cse8 .cse10 .cse13 .cse11 .cse7 .cse14 .cse4 .cse1 .cse9)) (and .cse0 (let ((.cse17 (and .cse7 (and .cse2 .cse5 .cse6 .cse18)))) (or (and (and (<= Elevator_qDC1 (+ Elevator_c2 1)) .cse15 .cse16 (<= (+ Elevator_qDC1 Elevator_c3) 1)) .cse17 (and (<= (+ Elevator_min 1) Elevator_max) (<= 2 (+ Elevator_qDC1 Elevator_qDC2)))) (and .cse8 .cse9 .cse10 .cse11 (and .cse3 .cse4 .cse17))))) (and (and .cse14 (let ((.cse22 (and .cse2 .cse3 .cse4 .cse18 .cse27))) (or (and .cse19 .cse20 (and .cse21 .cse22 .cse23 .cse8 .cse9 .cse24) .cse25 .cse26 .cse10 .cse11) (and .cse21 .cse23 .cse6 .cse8 .cse10 .cse11 (or (<= (+ Elevator_goal 1) Elevator_current) (<= (+ Elevator_current 1) Elevator_goal)) .cse24 .cse20 .cse22 .cse26 .cse9)))) .cse12) (and .cse14 (and .cse21 .cse1 .cse23 (and .cse2 .cse28 .cse3 .cse4 .cse6) .cse8 .cse9 .cse10 .cse11 .cse24) .cse29) (and (and .cse14 .cse29 (or (and .cse19 .cse20 .cse25 .cse26 (and .cse21 .cse3 .cse4 .cse1 .cse23 .cse8 .cse9 .cse24) .cse10 .cse11) (and .cse20 .cse1 .cse26 (and .cse2 (not (= Elevator_goal Elevator_current)) .cse21 .cse3 .cse23 .cse6 .cse8 .cse10 .cse11 .cse24 .cse4 .cse9)))) .cse12) (and .cse14 (and .cse2 .cse21 .cse3 .cse23 .cse6 .cse8 .cse10 .cse11 .cse18 .cse27 .cse24 .cse28 .cse4 .cse9)) (and .cse2 .cse3 .cse6 .cse8 .cse10 .cse13 .cse11 .cse24 .cse14 .cse0 .cse4 .cse1 .cse9) (and (and .cse14 .cse0 .cse13 (and (and .cse1 (and .cse2 .cse3 .cse4 .cse6)) .cse8 .cse9 .cse10 .cse11)) .cse12)))) [2018-12-03 17:14:00,651 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-12-03 17:14:00,651 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-12-03 17:14:00,651 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-12-03 17:14:00,651 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-12-03 17:14:00,651 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-12-03 17:14:00,651 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-12-03 17:14:00,651 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-12-03 17:14:00,652 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-12-03 17:14:00,652 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-12-03 17:14:00,652 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-12-03 17:14:00,652 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-12-03 17:14:00,675 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:14:00 BoogieIcfgContainer [2018-12-03 17:14:00,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:14:00,677 INFO L168 Benchmark]: Toolchain (without parser) took 50104.56 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -590.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:14:00,678 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:00,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:00,680 INFO L168 Benchmark]: Boogie Preprocessor took 56.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:00,681 INFO L168 Benchmark]: RCFGBuilder took 657.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:14:00,682 INFO L168 Benchmark]: TraceAbstraction took 49340.15 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -622.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:14:00,687 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 657.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49340.15 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -622.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((c2 <= c3 && ((((qDC1 == 2 && ((((current' <= max && min <= current) && current <= max) && qDC2 <= 1) && min <= current') && qCSP == 1) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal) || (c2 <= c3 && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && goal <= max) && qDC2 == 3) && min <= goal) && qCSP == 1) && !stop) && current <= max) && qDC1 == 2) && min <= goal')) || (c2 <= c3 && ((((((qDC1 <= c2 + 1 && current' <= goal') && goal' <= current') && qDC1 + c3 <= 1) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && min + 1 <= max && 2 <= qDC1 + qDC2) || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && (min <= current && current <= max) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1)))) || ((!stop && (((((((current' <= dir' + max && (dir' + 1 == 0 || current' <= goal')) && ((((qDC2 <= 2 && (((current' <= max && min <= current) && current <= max) && qDC1 <= 1) && !passed) && 2 <= qDC2) && goal' <= max) && min <= goal') && !(current' == goal')) && (goal' + 1 <= current' || min + 2 <= current' + dir')) && (dir' == 1 || goal' <= current')) && goal <= max) && min <= goal) || (((((((((((qDC2 <= 2 && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (goal + 1 <= current || current + 1 <= goal)) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && (((current' <= max && min <= current) && current <= max) && qDC1 <= 1) && !passed) && (dir' == 1 || goal' <= current')) && min <= goal'))) && !newgoal)) || ((!stop && (((((((qDC2 <= 2 && qDC1 == 2) && 2 <= qDC2) && (((current' <= max && !(qCSP == 3)) && min <= current) && current <= max) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !(current' == goal')) && (c2 <= 2 || c2 <= c3))) || (((!stop && (c2 <= 2 || c2 <= c3)) && (((((((current' <= dir' + max && (dir' + 1 == 0 || current' <= goal')) && (goal' + 1 <= current' || min + 2 <= current' + dir')) && (dir' == 1 || goal' <= current')) && ((((((qDC2 <= 2 && min <= current) && current <= max) && qDC1 == 2) && 2 <= qDC2) && goal' <= max) && min <= goal') && !(current' == goal')) && goal <= max) && min <= goal) || ((((dir' + 1 == 0 || current' <= goal') && qDC1 == 2) && (dir' == 1 || goal' <= current')) && ((((((((((current' <= max && !(goal == current)) && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && !(current' == goal')) && current <= max) && min <= goal'))) && !newgoal)) || (!stop && ((((((((((((current' <= max && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && !(current' == goal')) && !(qCSP == 3)) && current <= max) && min <= goal')) || ((((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && goal <= max) && qDC2 == 3) && min <= goal) && !(current' == goal')) && !stop) && c2 <= c3) && current <= max) && qDC1 == 2) && min <= goal')) || ((((!stop && c2 <= c3) && qDC2 == 3) && ((((qDC1 == 2 && ((current' <= max && min <= current) && current <= max) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 49.2s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 29.5s AutomataDifference, 0.0s DeadEndRemovalTime, 8.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1098 SDtfs, 2148 SDslu, 3167 SDs, 0 SdLazy, 2693 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 641 GetRequests, 443 SyntacticMatches, 17 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1105occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9605820105820106 AbsIntWeakeningRatio, 0.5952380952380952 AbsIntAvgWeakeningVarsNumRemoved, 13.952380952380953 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 3869 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 640 HoareAnnotationTreeSize, 1 FomulaSimplifications, 565099 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 1 FomulaSimplificationsInter, 206195 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1355 ConstructedInterpolants, 0 QuantifiedInterpolants, 748552 SizeOfPredicates, 38 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 1386/1781 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...