java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/Elevator-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:08,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:08,458 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:08,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:08,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:08,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:08,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:08,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:08,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:08,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:08,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:08,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:08,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:08,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:08,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:08,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:08,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:08,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:08,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:08,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:08,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:08,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:08,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:08,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:08,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:08,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:08,517 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:08,518 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:08,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:08,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:08,524 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:08,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:08,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:08,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:08,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:08,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:08,530 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:11:08,556 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:08,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:08,560 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:08,561 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:08,561 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:08,561 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:08,562 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:08,562 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:08,562 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:08,562 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:08,563 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:08,563 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:08,563 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:08,563 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:08,563 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:08,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:08,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:08,567 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:08,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:08,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:08,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:08,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:08,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:08,568 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:08,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:08,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:08,571 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:08,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:08,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:08,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:08,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:08,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:08,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:08,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:08,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:08,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:08,573 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:08,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:08,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:08,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:08,574 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:08,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:08,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:08,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:08,653 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:08,654 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:08,654 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 16:11:08,655 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-12-03 16:11:08,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:08,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:08,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:08,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:08,743 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,755 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,764 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:08,765 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:08,765 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:08,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:08,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:08,793 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,794 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,798 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,799 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,810 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,819 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,821 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 04:11:08" (1/1) ... [2018-12-03 16:11:08,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:08,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:08,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:08,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:08,918 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 16:11:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 16:11:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 16:11:09,571 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:09,572 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:11:09,572 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:09 BoogieIcfgContainer [2018-12-03 16:11:09,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:09,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:09,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:09,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:09,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/2) ... [2018-12-03 16:11:09,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d457d1 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:09, skipping insertion in model container [2018-12-03 16:11:09,579 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 04:11:09" (2/2) ... [2018-12-03 16:11:09,581 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-12-03 16:11:09,591 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:09,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:11:09,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:11:09,659 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:09,659 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:09,659 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:09,660 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:09,660 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:09,660 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:09,660 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:09,660 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-03 16:11:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:11:09,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:09,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:09,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-12-03 16:11:09,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:09,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:09,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:09,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:09,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:09,891 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-12-03 16:11:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:09,998 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-12-03 16:11:09,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:10,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 16:11:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,015 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:11:10,016 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:11:10,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:11:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-03 16:11:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:11:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-12-03 16:11:10,065 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-12-03 16:11:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,066 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-12-03 16:11:10,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-12-03 16:11:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:11:10,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,068 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:10,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-12-03 16:11:10,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:10,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:10,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:10,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,148 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-12-03 16:11:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,424 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-12-03 16:11:10,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:10,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 16:11:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,428 INFO L225 Difference]: With dead ends: 154 [2018-12-03 16:11:10,428 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:11:10,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:11:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-03 16:11:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:11:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-12-03 16:11:10,444 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-12-03 16:11:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,445 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-12-03 16:11:10,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-12-03 16:11:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:11:10,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,448 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:10,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-12-03 16:11:10,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:10,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:10,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:10,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,531 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-12-03 16:11:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,865 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-12-03 16:11:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:10,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 16:11:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,868 INFO L225 Difference]: With dead ends: 233 [2018-12-03 16:11:10,868 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:11:10,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:11:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-12-03 16:11:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:11:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-12-03 16:11:10,885 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-12-03 16:11:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,886 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-12-03 16:11:10,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-12-03 16:11:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:11:10,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:10,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-12-03 16:11:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:11,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:11,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:11,010 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-12-03 16:11:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,254 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-12-03 16:11:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:11:11,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 16:11:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,260 INFO L225 Difference]: With dead ends: 144 [2018-12-03 16:11:11,260 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:11:11,261 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 16:11:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:11:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-12-03 16:11:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 16:11:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-12-03 16:11:11,277 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-12-03 16:11:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,277 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-12-03 16:11:11,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-12-03 16:11:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:11:11,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,279 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 16:11:11,279 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:11,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-12-03 16:11:11,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:11,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:11,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:11,380 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-12-03 16:11:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,598 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-12-03 16:11:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:11,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-03 16:11:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,601 INFO L225 Difference]: With dead ends: 459 [2018-12-03 16:11:11,602 INFO L226 Difference]: Without dead ends: 286 [2018-12-03 16:11:11,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-03 16:11:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-12-03 16:11:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-03 16:11:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-12-03 16:11:11,629 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-12-03 16:11:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,629 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-12-03 16:11:11,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-12-03 16:11:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:11:11,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,632 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 16:11:11,633 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:11,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-12-03 16:11:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,693 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 16:11:11,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:11,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,695 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-12-03 16:11:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:12,016 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-12-03 16:11:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:12,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-03 16:11:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:12,019 INFO L225 Difference]: With dead ends: 695 [2018-12-03 16:11:12,020 INFO L226 Difference]: Without dead ends: 402 [2018-12-03 16:11:12,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-03 16:11:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-12-03 16:11:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 16:11:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-12-03 16:11:12,047 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-12-03 16:11:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:12,047 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-12-03 16:11:12,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-12-03 16:11:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:11:12,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:12,050 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 16:11:12,051 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:12,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-12-03 16:11:12,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:12,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:12,112 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 16:11:12,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:12,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:12,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:12,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:12,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:12,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:12,115 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-12-03 16:11:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:12,235 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-12-03 16:11:12,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:12,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 16:11:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:12,238 INFO L225 Difference]: With dead ends: 711 [2018-12-03 16:11:12,239 INFO L226 Difference]: Without dead ends: 414 [2018-12-03 16:11:12,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-03 16:11:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-12-03 16:11:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 16:11:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-12-03 16:11:12,259 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-12-03 16:11:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:12,259 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-12-03 16:11:12,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-12-03 16:11:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:11:12,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:12,262 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 16:11:12,262 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:12,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:12,263 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-12-03 16:11:12,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:12,477 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 16:11:12,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:12,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:12,479 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 16:11:12,481 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 16:11:12,524 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:12,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:13,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:13,281 INFO L272 AbstractInterpreter]: Visited 25 different actions 102 times. Merged at 24 different actions 59 times. Never widened. Found 16 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 16:11:13,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:13,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:13,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:13,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:13,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:13,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:13,493 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 16:11:13,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:13,500 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 16:11:13,530 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:11:13,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-12-03 16:11:13,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:13,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:13,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:13,533 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 3 states. [2018-12-03 16:11:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:13,649 INFO L93 Difference]: Finished difference Result 722 states and 1121 transitions. [2018-12-03 16:11:13,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:13,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 16:11:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:13,655 INFO L225 Difference]: With dead ends: 722 [2018-12-03 16:11:13,655 INFO L226 Difference]: Without dead ends: 417 [2018-12-03 16:11:13,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-03 16:11:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 372. [2018-12-03 16:11:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 16:11:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 571 transitions. [2018-12-03 16:11:13,672 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 571 transitions. Word has length 43 [2018-12-03 16:11:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:13,672 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 571 transitions. [2018-12-03 16:11:13,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 571 transitions. [2018-12-03 16:11:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:11:13,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:13,675 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 16:11:13,675 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:13,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash 739115210, now seen corresponding path program 1 times [2018-12-03 16:11:13,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:13,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:13,779 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 16:11:13,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:13,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:13,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:13,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:13,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:13,781 INFO L87 Difference]: Start difference. First operand 372 states and 571 transitions. Second operand 3 states. [2018-12-03 16:11:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:14,132 INFO L93 Difference]: Finished difference Result 954 states and 1476 transitions. [2018-12-03 16:11:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:14,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 16:11:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:14,136 INFO L225 Difference]: With dead ends: 954 [2018-12-03 16:11:14,136 INFO L226 Difference]: Without dead ends: 561 [2018-12-03 16:11:14,137 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 16:11:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-03 16:11:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2018-12-03 16:11:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-12-03 16:11:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 856 transitions. [2018-12-03 16:11:14,158 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 856 transitions. Word has length 44 [2018-12-03 16:11:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:14,158 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 856 transitions. [2018-12-03 16:11:14,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 856 transitions. [2018-12-03 16:11:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:11:14,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:14,160 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:14,161 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:14,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:14,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2125318604, now seen corresponding path program 1 times [2018-12-03 16:11:14,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:14,221 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 16:11:14,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:14,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:14,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:14,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:14,224 INFO L87 Difference]: Start difference. First operand 560 states and 856 transitions. Second operand 3 states. [2018-12-03 16:11:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:14,282 INFO L93 Difference]: Finished difference Result 1120 states and 1711 transitions. [2018-12-03 16:11:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:14,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 16:11:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:14,288 INFO L225 Difference]: With dead ends: 1120 [2018-12-03 16:11:14,288 INFO L226 Difference]: Without dead ends: 561 [2018-12-03 16:11:14,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-03 16:11:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2018-12-03 16:11:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-12-03 16:11:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 812 transitions. [2018-12-03 16:11:14,308 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 812 transitions. Word has length 44 [2018-12-03 16:11:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:14,309 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 812 transitions. [2018-12-03 16:11:14,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 812 transitions. [2018-12-03 16:11:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:11:14,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:14,310 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 16:11:14,311 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:14,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-12-03 16:11:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:14,705 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-03 16:11:15,199 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 16:11:15,213 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 16:11:15,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:15,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:15,214 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-03 16:11:15,215 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 16:11:15,217 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:15,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:15,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:15,525 INFO L272 AbstractInterpreter]: Visited 28 different actions 148 times. Merged at 27 different actions 92 times. Never widened. Found 24 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 16:11:15,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:15,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:15,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:15,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:15,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:15,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:15,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:16,256 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 16:11:16,611 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 16:11:16,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:17,101 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 16:11:17,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:17,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2018-12-03 16:11:17,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:17,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:11:17,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:11:17,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:11:17,122 INFO L87 Difference]: Start difference. First operand 560 states and 812 transitions. Second operand 16 states. [2018-12-03 16:11:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:19,724 INFO L93 Difference]: Finished difference Result 2776 states and 3934 transitions. [2018-12-03 16:11:19,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:11:19,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-12-03 16:11:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:19,735 INFO L225 Difference]: With dead ends: 2776 [2018-12-03 16:11:19,735 INFO L226 Difference]: Without dead ends: 2157 [2018-12-03 16:11:19,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=333, Invalid=999, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:11:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2018-12-03 16:11:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1098. [2018-12-03 16:11:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-12-03 16:11:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1628 transitions. [2018-12-03 16:11:19,797 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1628 transitions. Word has length 48 [2018-12-03 16:11:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:19,797 INFO L480 AbstractCegarLoop]: Abstraction has 1098 states and 1628 transitions. [2018-12-03 16:11:19,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:11:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1628 transitions. [2018-12-03 16:11:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:11:19,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:19,801 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 16:11:19,802 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:19,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:19,802 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-12-03 16:11:19,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:19,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:19,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:19,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:19,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:19,966 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 16:11:19,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:19,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:19,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:19,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:19,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:19,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:19,968 INFO L87 Difference]: Start difference. First operand 1098 states and 1628 transitions. Second operand 4 states. [2018-12-03 16:11:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:20,064 INFO L93 Difference]: Finished difference Result 2196 states and 3255 transitions. [2018-12-03 16:11:20,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:20,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 16:11:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:20,071 INFO L225 Difference]: With dead ends: 2196 [2018-12-03 16:11:20,071 INFO L226 Difference]: Without dead ends: 1099 [2018-12-03 16:11:20,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-12-03 16:11:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1095. [2018-12-03 16:11:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-12-03 16:11:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1559 transitions. [2018-12-03 16:11:20,126 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1559 transitions. Word has length 67 [2018-12-03 16:11:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:20,127 INFO L480 AbstractCegarLoop]: Abstraction has 1095 states and 1559 transitions. [2018-12-03 16:11:20,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1559 transitions. [2018-12-03 16:11:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:11:20,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:20,129 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 16:11:20,130 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:20,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-12-03 16:11:20,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:20,209 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 16:11:20,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:20,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:20,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:20,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:20,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:20,212 INFO L87 Difference]: Start difference. First operand 1095 states and 1559 transitions. Second operand 3 states. [2018-12-03 16:11:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:20,644 INFO L93 Difference]: Finished difference Result 2199 states and 3123 transitions. [2018-12-03 16:11:20,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:20,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-03 16:11:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:20,650 INFO L225 Difference]: With dead ends: 2199 [2018-12-03 16:11:20,650 INFO L226 Difference]: Without dead ends: 1015 [2018-12-03 16:11:20,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-03 16:11:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 993. [2018-12-03 16:11:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-12-03 16:11:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1361 transitions. [2018-12-03 16:11:20,697 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1361 transitions. Word has length 68 [2018-12-03 16:11:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:20,697 INFO L480 AbstractCegarLoop]: Abstraction has 993 states and 1361 transitions. [2018-12-03 16:11:20,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1361 transitions. [2018-12-03 16:11:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:11:20,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:20,700 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 16:11:20,701 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:20,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-12-03 16:11:20,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:20,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:20,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:21,077 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-03 16:11:21,621 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 16:11:21,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:21,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:21,622 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-12-03 16:11:21,622 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 16:11:21,624 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:21,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:21,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:21,815 INFO L272 AbstractInterpreter]: Visited 34 different actions 155 times. Merged at 32 different actions 78 times. Never widened. Found 29 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 16:11:21,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:21,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:21,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:21,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:21,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:21,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:21,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:22,973 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 16:11:22,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:23,617 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2018-12-03 16:11:23,821 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 16:11:23,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:23,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 38 [2018-12-03 16:11:23,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:23,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:11:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:11:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:11:23,847 INFO L87 Difference]: Start difference. First operand 993 states and 1361 transitions. Second operand 27 states. [2018-12-03 16:11:24,315 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-12-03 16:11:24,858 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2018-12-03 16:11:25,395 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-03 16:11:25,830 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2018-12-03 16:11:26,141 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-12-03 16:11:27,073 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-03 16:11:27,514 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2018-12-03 16:11:27,755 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-12-03 16:11:27,992 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-03 16:11:28,349 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2018-12-03 16:11:28,696 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 75 [2018-12-03 16:11:29,192 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-03 16:11:29,441 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-03 16:11:29,906 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-12-03 16:11:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:30,415 INFO L93 Difference]: Finished difference Result 3800 states and 4985 transitions. [2018-12-03 16:11:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:11:30,415 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-12-03 16:11:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:30,427 INFO L225 Difference]: With dead ends: 3800 [2018-12-03 16:11:30,427 INFO L226 Difference]: Without dead ends: 2766 [2018-12-03 16:11:30,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1130, Invalid=4420, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:11:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2018-12-03 16:11:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 1076. [2018-12-03 16:11:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-12-03 16:11:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1481 transitions. [2018-12-03 16:11:30,506 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1481 transitions. Word has length 84 [2018-12-03 16:11:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:30,507 INFO L480 AbstractCegarLoop]: Abstraction has 1076 states and 1481 transitions. [2018-12-03 16:11:30,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:11:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1481 transitions. [2018-12-03 16:11:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:11:30,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:30,510 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 16:11:30,510 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:30,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:30,510 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-12-03 16:11:30,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:30,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:30,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:30,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:30,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:30,624 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 16:11:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:30,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:30,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:30,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:30,626 INFO L87 Difference]: Start difference. First operand 1076 states and 1481 transitions. Second operand 3 states. [2018-12-03 16:11:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:30,915 INFO L93 Difference]: Finished difference Result 2152 states and 2961 transitions. [2018-12-03 16:11:30,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:30,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-03 16:11:30,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:30,919 INFO L225 Difference]: With dead ends: 2152 [2018-12-03 16:11:30,919 INFO L226 Difference]: Without dead ends: 1077 [2018-12-03 16:11:30,921 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 16:11:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-12-03 16:11:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1021. [2018-12-03 16:11:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2018-12-03 16:11:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1374 transitions. [2018-12-03 16:11:30,986 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1374 transitions. Word has length 85 [2018-12-03 16:11:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:30,986 INFO L480 AbstractCegarLoop]: Abstraction has 1021 states and 1374 transitions. [2018-12-03 16:11:30,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1374 transitions. [2018-12-03 16:11:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:11:30,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:30,989 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 16:11:30,989 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:30,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1131673137, now seen corresponding path program 1 times [2018-12-03 16:11:30,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:30,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:30,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:31,087 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 16:11:31,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:31,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:31,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:31,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:31,089 INFO L87 Difference]: Start difference. First operand 1021 states and 1374 transitions. Second operand 3 states. [2018-12-03 16:11:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:31,218 INFO L93 Difference]: Finished difference Result 1686 states and 2257 transitions. [2018-12-03 16:11:31,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:31,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-03 16:11:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:31,221 INFO L225 Difference]: With dead ends: 1686 [2018-12-03 16:11:31,221 INFO L226 Difference]: Without dead ends: 641 [2018-12-03 16:11:31,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-12-03 16:11:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 555. [2018-12-03 16:11:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-03 16:11:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 720 transitions. [2018-12-03 16:11:31,256 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 720 transitions. Word has length 86 [2018-12-03 16:11:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:31,256 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 720 transitions. [2018-12-03 16:11:31,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 720 transitions. [2018-12-03 16:11:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:11:31,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:31,258 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 16:11:31,259 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:31,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:31,259 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-12-03 16:11:31,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:31,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:31,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:31,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:31,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:31,391 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 16:11:31,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:31,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:31,392 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-12-03 16:11:31,392 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 16:11:31,394 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:31,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:31,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:31,713 INFO L272 AbstractInterpreter]: Visited 39 different actions 246 times. Merged at 37 different actions 129 times. Never widened. Found 59 fixpoints after 20 different actions. Largest state had 0 variables. [2018-12-03 16:11:31,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:31,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:31,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:31,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:31,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:31,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:31,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:31,953 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 16:11:31,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:32,005 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 16:11:32,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:32,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:11:32,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:32,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:11:32,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:11:32,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:11:32,025 INFO L87 Difference]: Start difference. First operand 555 states and 720 transitions. Second operand 7 states. [2018-12-03 16:11:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:32,204 INFO L93 Difference]: Finished difference Result 1399 states and 1807 transitions. [2018-12-03 16:11:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:11:32,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 16:11:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:32,206 INFO L225 Difference]: With dead ends: 1399 [2018-12-03 16:11:32,206 INFO L226 Difference]: Without dead ends: 728 [2018-12-03 16:11:32,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:11:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-03 16:11:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 325. [2018-12-03 16:11:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 16:11:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 411 transitions. [2018-12-03 16:11:32,231 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 411 transitions. Word has length 89 [2018-12-03 16:11:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:32,232 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 411 transitions. [2018-12-03 16:11:32,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:11:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 411 transitions. [2018-12-03 16:11:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:11:32,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:32,233 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 16:11:32,234 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:32,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-12-03 16:11:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:32,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:32,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:32,300 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 16:11:32,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:32,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:32,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:32,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:32,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:32,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:32,302 INFO L87 Difference]: Start difference. First operand 325 states and 411 transitions. Second operand 3 states. [2018-12-03 16:11:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:32,442 INFO L93 Difference]: Finished difference Result 568 states and 707 transitions. [2018-12-03 16:11:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:32,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-03 16:11:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:32,443 INFO L225 Difference]: With dead ends: 568 [2018-12-03 16:11:32,443 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:11:32,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:11:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:11:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:11:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:11:32,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-12-03 16:11:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:32,445 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:11:32,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:11:32,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:11:32,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:11:32,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:32,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:33,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:34,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:34,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:34,234 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 509 DAG size of output: 387 [2018-12-03 16:11:39,875 WARN L180 SmtUtils]: Spent 5.63 s on a formula simplification. DAG size of input: 361 DAG size of output: 109 [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-12-03 16:11:39,878 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-12-03 16:11:39,879 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-12-03 16:11:39,879 INFO L448 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-12-03 16:11:39,879 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-12-03 16:11:39,879 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-12-03 16:11:39,879 INFO L448 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L444 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse27 (<= |Elevator_goal'| |Elevator_current'|)) (.cse28 (+ |Elevator_goal'| 1)) (.cse29 (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))) (.cse16 (<= Elevator_c2 Elevator_c3))) (let ((.cse19 (or (<= Elevator_c2 2) .cse16)) (.cse12 (not (= Elevator_qCSP 3))) (.cse24 (not (= Elevator_goal Elevator_current))) (.cse2 (<= Elevator_qDC2 2)) (.cse4 (<= 2 Elevator_qDC2)) (.cse9 (<= Elevator_qDC1 1)) (.cse10 (not Elevator_passed)) (.cse20 (<= |Elevator_current'| (+ |Elevator_dir'| Elevator_max))) (.cse21 (or (= (+ |Elevator_dir'| 1) 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse22 (or (<= .cse28 |Elevator_current'|) .cse29)) (.cse23 (or (= |Elevator_dir'| 1) .cse27)) (.cse0 (not Elevator_stop)) (.cse17 (= Elevator_qDC2 3)) (.cse11 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse1 (<= |Elevator_current'| Elevator_max)) (.cse3 (<= Elevator_min Elevator_current)) (.cse13 (<= Elevator_current Elevator_max)) (.cse15 (= Elevator_qDC1 2)) (.cse31 (<= Elevator_qDC2 1)) (.cse5 (<= Elevator_min |Elevator_current'|)) (.cse6 (<= |Elevator_goal'| Elevator_max)) (.cse14 (<= Elevator_min |Elevator_goal'|)) (.cse7 (<= Elevator_goal Elevator_max)) (.cse8 (<= Elevator_min Elevator_goal)) (.cse25 (= Elevator_qCSP 1)) (.cse18 (not Elevator_newgoal))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and (and .cse0 (and .cse1 .cse3 .cse13 .cse15 .cse5 .cse6 .cse14 .cse7 .cse8) .cse16 .cse17) .cse18) (and (and .cse0 .cse19 (or (and .cse3 .cse2 .cse4 .cse6 .cse7 .cse8 .cse11 .cse20 .cse21 .cse13 .cse22 .cse15 .cse23 .cse14) (and .cse21 (and .cse1 .cse24 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14) .cse15 .cse23))) .cse18) (and .cse16 (and .cse1 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse25 .cse0 .cse13 .cse15 .cse14)) (and .cse0 .cse19 (and .cse2 .cse15 .cse4 .cse6 .cse14 .cse7 .cse8 (and .cse1 .cse12 .cse3 .cse13 .cse5) .cse11)) (and .cse16 (let ((.cse26 (let ((.cse30 (and .cse25 (and .cse1 .cse31 .cse5 .cse9)))) (or (and .cse30 .cse6 (or (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_current'| 1) Elevator_max))) (and .cse3 .cse13 .cse30))))) (or (and .cse21 .cse23 .cse6 .cse26 .cse14 (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) .cse27) (= |Elevator_goal'| |Elevator_current'|) (and (< |Elevator_current'| .cse28) .cse29))) (and .cse13 .cse6 .cse26 .cse14 .cse7 .cse8)))) (and (and .cse0 (or (and .cse21 .cse23 (and .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) .cse11) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21 .cse13 .cse22 .cse23 .cse14))) .cse18) (and .cse0 .cse16 .cse17 (and .cse1 .cse3 .cse13 .cse15 .cse5 .cse6 .cse14 .cse7 .cse8 .cse11)) (and (and .cse1 .cse3 .cse13 .cse15 .cse31 .cse5 .cse6 .cse14 .cse7 .cse8 .cse25) .cse16 .cse18)))) [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-12-03 16:11:39,880 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-12-03 16:11:39,881 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-12-03 16:11:39,881 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-12-03 16:11:39,881 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-12-03 16:11:39,897 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:11:39 BoogieIcfgContainer [2018-12-03 16:11:39,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:11:39,898 INFO L168 Benchmark]: Toolchain (without parser) took 31179.24 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -429.6 MB). Peak memory consumption was 922.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:39,899 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:11:39,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:11:39,900 INFO L168 Benchmark]: Boogie Preprocessor took 62.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:11:39,900 INFO L168 Benchmark]: RCFGBuilder took 739.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:39,901 INFO L168 Benchmark]: TraceAbstraction took 30323.67 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -461.3 MB). Peak memory consumption was 890.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:39,905 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 739.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30323.67 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -461.3 MB). Peak memory consumption was 890.8 MB. 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: ((((((((!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') || ((((!stop && (((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && c2 <= c3) && qDC2 == 3) && !newgoal)) || (((!stop && (c2 <= 2 || c2 <= c3)) && ((((((((((((((min <= current && qDC2 <= 2) && 2 <= qDC2) && goal' <= max) && goal <= max) && min <= goal) && !(current' == goal')) && current' <= dir' + max) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && (goal' + 1 <= current' || min + 2 <= current' + dir')) && qDC1 == 2) && (dir' == 1 || goal' <= current')) && min <= goal') || ((((dir' + 1 == 0 || current' <= goal') && ((((((((((current' <= max && !(goal == current)) && min <= current) && qDC2 <= 2) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && !(current' == goal')) && current <= max) && min <= goal') && qDC1 == 2) && (dir' == 1 || goal' <= current')))) && !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')) || ((!stop && (c2 <= 2 || c2 <= c3)) && (((((((qDC2 <= 2 && qDC1 == 2) && 2 <= qDC2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && (((current' <= max && !(qCSP == 3)) && min <= current) && current <= max) && min <= current') && !(current' == goal'))) || (c2 <= c3 && (((((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && goal' <= max) && ((((qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= max) && (min + 1 <= current' || current' + 1 <= max)) || ((min <= current && current <= max) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) && min <= goal') && (((current' + dir' + 2 <= max && goal' <= current') || goal' == current') || (current' < goal' + 1 && min + 2 <= current' + dir'))) || (((((current <= max && goal' <= max) && ((((qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= max) && (min + 1 <= current' || current' + 1 <= max)) || ((min <= current && current <= max) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) && min <= goal') && goal <= max) && min <= goal)))) || ((!stop && (((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && (((((((((((current' <= max && !(goal == current)) && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && current <= max) && min <= goal') && !(current' == goal')) || ((((((((((((((qDC2 <= 2 && min <= current) && 2 <= qDC2) && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && !(current' == goal')) && current' <= dir' + max) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && (goal' + 1 <= current' || min + 2 <= current' + dir')) && (dir' == 1 || goal' <= current')) && min <= goal'))) && !newgoal)) || (((!stop && c2 <= c3) && qDC2 == 3) && ((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !(current' == goal'))) || ((((((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && qDC2 <= 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && qCSP == 1) && c2 <= c3) && !newgoal) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 30.2s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 7.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1085 SDtfs, 1873 SDslu, 2733 SDs, 0 SdLazy, 1981 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 661 GetRequests, 513 SyntacticMatches, 5 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 3608 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 722 HoareAnnotationTreeSize, 1 FomulaSimplifications, 313968 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 1 FomulaSimplificationsInter, 94514 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 749697 SizeOfPredicates, 42 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 1420/1815 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...