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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:08,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:08,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:08,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:08,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:08,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:08,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:08,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:08,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:08,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:08,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:08,228 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:08,229 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:08,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:08,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:08,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:08,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:08,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:08,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:08,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:08,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:08,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:08,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:08,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:08,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:08,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:08,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:08,266 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:08,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:08,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:08,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:08,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:08,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:08,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:08,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:08,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:08,274 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,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:08,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:08,302 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:08,302 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:08,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:08,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:08,302 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:08,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:08,303 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:08,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:08,303 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:08,303 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:08,304 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:08,304 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:08,304 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:08,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:08,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:08,305 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:08,305 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:08,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:08,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:08,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:08,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:08,306 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:08,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:08,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:08,307 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:08,307 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:08,307 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:08,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:08,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:08,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:08,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:08,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:08,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:08,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:08,309 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:08,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:08,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:08,309 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:08,310 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:08,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:08,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:08,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:08,362 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:08,363 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:08,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl [2018-12-03 16:11:08,364 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-12-03 16:11:08,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:08,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:08,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:08,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:08,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,444 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:08,444 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:08,445 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:08,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:08,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:08,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:08,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/1) ... [2018-12-03 16:11:08,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:08,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:08,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:08,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:08,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.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,551 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 16:11:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 16:11:08,551 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 16:11:09,341 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:09,341 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:11:09,342 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:09 BoogieIcfgContainer [2018-12-03 16:11:09,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:09,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:09,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:09,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:09,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:08" (1/2) ... [2018-12-03 16:11:09,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175b8d89 and model type Elevator.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,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:09" (2/2) ... [2018-12-03 16:11:09,349 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-12-03 16:11:09,359 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:09,368 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:11:09,385 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:11:09,414 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:09,414 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:09,414 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:09,414 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:09,415 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:09,415 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:09,415 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:09,415 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-03 16:11:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:11:09,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:11:09,440 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:09,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-12-03 16:11:09,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:09,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:09,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:09,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:09,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:09,617 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-12-03 16:11:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:09,713 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-12-03 16:11:09,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:09,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:11:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:09,729 INFO L225 Difference]: With dead ends: 92 [2018-12-03 16:11:09,729 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:11:09,735 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:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:11:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-03 16:11:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:11:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-12-03 16:11:09,779 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-12-03 16:11:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:09,780 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-12-03 16:11:09,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-12-03 16:11:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:11:09,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:11:09,781 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:09,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-12-03 16:11:09,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:09,824 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,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:09,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:11:09,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:09,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:09,830 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-12-03 16:11:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:09,954 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-12-03 16:11:09,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:09,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:11:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:09,957 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:11:09,957 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:11:09,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:11:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:11:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:11:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-12-03 16:11:09,968 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-12-03 16:11:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:09,969 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-12-03 16:11:09,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-12-03 16:11:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:11:09,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:09,971 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:09,971 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:09,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-12-03 16:11:09,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:09,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:09,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:09,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:11:10,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:10,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:10,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:10,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:10,115 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-12-03 16:11:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,288 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-12-03 16:11:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:10,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 16:11:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,295 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:11:10,295 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:11:10,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:11:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-12-03 16:11:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:11:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-12-03 16:11:10,319 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-12-03 16:11:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,321 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-12-03 16:11:10,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-12-03 16:11:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:11:10,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,323 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,324 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:10,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-12-03 16:11:10,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:10,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:10,431 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-12-03 16:11:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:10,648 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-12-03 16:11:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:10,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 16:11:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:10,651 INFO L225 Difference]: With dead ends: 205 [2018-12-03 16:11:10,651 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:11:10,655 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,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:11:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-12-03 16:11:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:11:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-12-03 16:11:10,668 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-12-03 16:11:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:10,669 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-12-03 16:11:10,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-12-03 16:11:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:11:10,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:10,671 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:10,671 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:10,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-12-03 16:11:10,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:10,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:10,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:10,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:10,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:10,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:10,781 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-12-03 16:11:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,251 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-12-03 16:11:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:11,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-03 16:11:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,254 INFO L225 Difference]: With dead ends: 297 [2018-12-03 16:11:11,254 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 16:11:11,255 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,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 16:11:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 16:11:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 16:11:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-12-03 16:11:11,277 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [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 186 states and 310 transitions. [2018-12-03 16:11:11,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-12-03 16:11:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:11:11,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,283 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:11,283 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:11,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-12-03 16:11:11,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 16:11:11,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:11,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,394 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-12-03 16:11:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,545 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-12-03 16:11:11,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:11,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-03 16:11:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,549 INFO L225 Difference]: With dead ends: 472 [2018-12-03 16:11:11,550 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 16:11:11,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 16:11:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-12-03 16:11:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 16:11:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-12-03 16:11:11,587 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-12-03 16:11:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,588 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-12-03 16:11:11,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-12-03 16:11:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:11:11,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,590 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:11,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:11,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-12-03 16:11:11,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:11:11,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:11,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,681 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-12-03 16:11:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:11,816 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-12-03 16:11:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:11,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 16:11:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:11,821 INFO L225 Difference]: With dead ends: 480 [2018-12-03 16:11:11,822 INFO L226 Difference]: Without dead ends: 289 [2018-12-03 16:11:11,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-03 16:11:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-12-03 16:11:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:11:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-12-03 16:11:11,852 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-12-03 16:11:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:11,852 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-12-03 16:11:11,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-12-03 16:11:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:11:11,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:11,858 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:11,858 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:11,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-12-03 16:11:11,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:11,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 16:11:11,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:11,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:11,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:11,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:11,908 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-12-03 16:11:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:12,209 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-12-03 16:11:12,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:12,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 16:11:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:12,212 INFO L225 Difference]: With dead ends: 378 [2018-12-03 16:11:12,212 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:11:12,213 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,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:11:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-12-03 16:11:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 16:11:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-12-03 16:11:12,223 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-12-03 16:11:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:12,223 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-12-03 16:11:12,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-12-03 16:11:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:11:12,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:12,226 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:12,226 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:12,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-12-03 16:11:12,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:12,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:11:12,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:12,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:12,512 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-12-03 16:11:12,514 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [27], [28], [33], [36], [38], [43], [46], [48], [53], [56], [69], [72], [74], [77], [79], [84], [87], [93], [96], [98], [116], [119], [146] [2018-12-03 16:11:12,556 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:12,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:13,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:13,431 INFO L272 AbstractInterpreter]: Visited 28 different actions 168 times. Merged at 27 different actions 111 times. Widened at 1 different actions 1 times. Found 24 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 16:11:13,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:13,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:13,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:13,483 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,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:13,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:13,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:11:13,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 16:11:13,716 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:11:13,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-12-03 16:11:13,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:13,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:11:13,717 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 4 states. [2018-12-03 16:11:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:13,980 INFO L93 Difference]: Finished difference Result 581 states and 925 transitions. [2018-12-03 16:11:13,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:11:13,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 16:11:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:13,983 INFO L225 Difference]: With dead ends: 581 [2018-12-03 16:11:13,983 INFO L226 Difference]: Without dead ends: 401 [2018-12-03 16:11:13,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:11:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-12-03 16:11:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 315. [2018-12-03 16:11:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 16:11:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2018-12-03 16:11:13,999 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 54 [2018-12-03 16:11:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:14,000 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2018-12-03 16:11:14,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2018-12-03 16:11:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:11:14,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:14,001 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:14,005 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:14,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash -108589086, now seen corresponding path program 1 times [2018-12-03 16:11:14,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:11:14,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:14,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:14,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:14,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:14,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:14,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:14,108 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand 3 states. [2018-12-03 16:11:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:14,356 INFO L93 Difference]: Finished difference Result 799 states and 1240 transitions. [2018-12-03 16:11:14,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:14,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 16:11:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:14,360 INFO L225 Difference]: With dead ends: 799 [2018-12-03 16:11:14,360 INFO L226 Difference]: Without dead ends: 461 [2018-12-03 16:11:14,361 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:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-03 16:11:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2018-12-03 16:11:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 16:11:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 685 transitions. [2018-12-03 16:11:14,380 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 685 transitions. Word has length 56 [2018-12-03 16:11:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:14,381 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 685 transitions. [2018-12-03 16:11:14,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 685 transitions. [2018-12-03 16:11:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:11:14,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:14,382 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:14,382 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:14,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash -171668990, now seen corresponding path program 1 times [2018-12-03 16:11:14,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:11:14,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:14,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:14,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:14,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:14,459 INFO L87 Difference]: Start difference. First operand 460 states and 685 transitions. Second operand 3 states. [2018-12-03 16:11:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:14,667 INFO L93 Difference]: Finished difference Result 920 states and 1369 transitions. [2018-12-03 16:11:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:14,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 16:11:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:14,672 INFO L225 Difference]: With dead ends: 920 [2018-12-03 16:11:14,673 INFO L226 Difference]: Without dead ends: 461 [2018-12-03 16:11:14,674 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,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-03 16:11:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2018-12-03 16:11:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 16:11:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 665 transitions. [2018-12-03 16:11:14,691 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 665 transitions. Word has length 56 [2018-12-03 16:11:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:14,692 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 665 transitions. [2018-12-03 16:11:14,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 665 transitions. [2018-12-03 16:11:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:11:14,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:14,693 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:14,693 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:14,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2018629294, now seen corresponding path program 1 times [2018-12-03 16:11:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:14,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:14,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 16:11:14,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:14,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:14,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:14,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:14,783 INFO L87 Difference]: Start difference. First operand 460 states and 665 transitions. Second operand 3 states. [2018-12-03 16:11:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:15,040 INFO L93 Difference]: Finished difference Result 1079 states and 1553 transitions. [2018-12-03 16:11:15,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:15,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 16:11:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:15,044 INFO L225 Difference]: With dead ends: 1079 [2018-12-03 16:11:15,044 INFO L226 Difference]: Without dead ends: 620 [2018-12-03 16:11:15,045 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:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-12-03 16:11:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 589. [2018-12-03 16:11:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-12-03 16:11:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2018-12-03 16:11:15,069 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 59 [2018-12-03 16:11:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:15,069 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2018-12-03 16:11:15,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2018-12-03 16:11:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:11:15,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:15,071 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:15,071 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:15,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-12-03 16:11:15,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:15,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:15,705 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:11:16,132 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:11:16,398 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:11:16,688 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:11:16,996 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 16:11:17,325 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 16:11:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:17,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:17,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:17,361 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 16:11:17,361 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [15], [18], [27], [28], [33], [36], [38], [43], [46], [48], [53], [56], [69], [72], [74], [77], [79], [84], [87], [93], [96], [98], [116], [120], [123], [126], [129], [146] [2018-12-03 16:11:17,366 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:17,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:17,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:17,614 INFO L272 AbstractInterpreter]: Visited 33 different actions 142 times. Merged at 31 different actions 80 times. Never widened. Found 24 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 16:11:17,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:17,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:17,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:17,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:17,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:17,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:17,975 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-03 16:11:18,500 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-03 16:11:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:18,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:19,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:19,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2018-12-03 16:11:19,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:19,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:11:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:11:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:11:19,639 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand 14 states. [2018-12-03 16:11:20,121 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-12-03 16:11:21,137 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-03 16:11:21,542 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 16:11:22,056 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-03 16:11:22,940 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:11:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:23,301 INFO L93 Difference]: Finished difference Result 2059 states and 2865 transitions. [2018-12-03 16:11:23,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:11:23,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-12-03 16:11:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:23,312 INFO L225 Difference]: With dead ends: 2059 [2018-12-03 16:11:23,312 INFO L226 Difference]: Without dead ends: 2058 [2018-12-03 16:11:23,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:11:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-12-03 16:11:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1023. [2018-12-03 16:11:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-12-03 16:11:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1478 transitions. [2018-12-03 16:11:23,377 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1478 transitions. Word has length 59 [2018-12-03 16:11:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:23,378 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1478 transitions. [2018-12-03 16:11:23,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:11:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1478 transitions. [2018-12-03 16:11:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:11:23,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:23,382 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:23,382 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:23,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1560627404, now seen corresponding path program 1 times [2018-12-03 16:11:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 16:11:23,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:23,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:23,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:23,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:23,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:23,476 INFO L87 Difference]: Start difference. First operand 1023 states and 1478 transitions. Second operand 3 states. [2018-12-03 16:11:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:23,713 INFO L93 Difference]: Finished difference Result 1883 states and 2699 transitions. [2018-12-03 16:11:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:23,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 16:11:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:23,718 INFO L225 Difference]: With dead ends: 1883 [2018-12-03 16:11:23,718 INFO L226 Difference]: Without dead ends: 744 [2018-12-03 16:11:23,720 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:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-12-03 16:11:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 743. [2018-12-03 16:11:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-12-03 16:11:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1010 transitions. [2018-12-03 16:11:23,758 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1010 transitions. Word has length 80 [2018-12-03 16:11:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:23,758 INFO L480 AbstractCegarLoop]: Abstraction has 743 states and 1010 transitions. [2018-12-03 16:11:23,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1010 transitions. [2018-12-03 16:11:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:11:23,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:23,761 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:23,761 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:23,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-12-03 16:11:23,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:23,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:11:23,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:23,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:11:23,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:23,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:23,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:23,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:11:23,933 INFO L87 Difference]: Start difference. First operand 743 states and 1010 transitions. Second operand 4 states. [2018-12-03 16:11:24,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:24,130 INFO L93 Difference]: Finished difference Result 1509 states and 2043 transitions. [2018-12-03 16:11:24,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:24,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 16:11:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:24,137 INFO L225 Difference]: With dead ends: 1509 [2018-12-03 16:11:24,138 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 16:11:24,142 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:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 16:11:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 742. [2018-12-03 16:11:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-03 16:11:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 967 transitions. [2018-12-03 16:11:24,174 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 967 transitions. Word has length 81 [2018-12-03 16:11:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:24,175 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 967 transitions. [2018-12-03 16:11:24,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 967 transitions. [2018-12-03 16:11:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:11:24,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:24,177 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:24,177 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:24,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1878047832, now seen corresponding path program 1 times [2018-12-03 16:11:24,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:11:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-03 16:11:24,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:24,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:24,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:24,238 INFO L87 Difference]: Start difference. First operand 742 states and 967 transitions. Second operand 3 states. [2018-12-03 16:11:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:24,411 INFO L93 Difference]: Finished difference Result 1341 states and 1730 transitions. [2018-12-03 16:11:24,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:24,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-03 16:11:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:24,415 INFO L225 Difference]: With dead ends: 1341 [2018-12-03 16:11:24,415 INFO L226 Difference]: Without dead ends: 557 [2018-12-03 16:11:24,416 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:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-12-03 16:11:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 447. [2018-12-03 16:11:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-03 16:11:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 553 transitions. [2018-12-03 16:11:24,436 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 553 transitions. Word has length 98 [2018-12-03 16:11:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:24,436 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 553 transitions. [2018-12-03 16:11:24,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 553 transitions. [2018-12-03 16:11:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:11:24,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:24,438 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:24,438 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:24,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-12-03 16:11:24,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:24,835 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 16:11:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 134 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:11:25,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:25,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:25,218 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 16:11:25,218 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [15], [18], [27], [28], [33], [36], [38], [43], [46], [48], [51], [53], [56], [67], [69], [72], [74], [77], [79], [84], [87], [93], [96], [98], [101], [104], [109], [116], [120], [123], [126], [129], [146] [2018-12-03 16:11:25,221 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:25,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:25,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:25,519 INFO L272 AbstractInterpreter]: Visited 38 different actions 221 times. Merged at 35 different actions 124 times. Never widened. Found 47 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 16:11:25,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:25,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:25,544 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:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:25,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:25,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:25,983 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:11:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 75 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:26,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 51 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:27,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:27,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 38 [2018-12-03 16:11:27,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:27,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:11:27,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:11:27,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:11:27,806 INFO L87 Difference]: Start difference. First operand 447 states and 553 transitions. Second operand 26 states. [2018-12-03 16:11:28,219 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-12-03 16:11:29,098 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-12-03 16:11:29,316 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-12-03 16:11:29,710 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-12-03 16:11:29,982 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-12-03 16:11:30,286 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-12-03 16:11:30,597 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-12-03 16:11:30,740 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2018-12-03 16:11:31,167 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2018-12-03 16:11:31,517 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-12-03 16:11:31,777 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-12-03 16:11:32,066 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-12-03 16:11:32,288 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 16:11:32,697 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-12-03 16:11:33,367 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 16:11:33,634 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-03 16:11:33,856 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-12-03 16:11:34,136 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-12-03 16:11:34,615 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-12-03 16:11:34,898 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-12-03 16:11:35,172 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-03 16:11:35,329 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 16:11:35,885 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2018-12-03 16:11:36,106 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-03 16:11:36,284 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-12-03 16:11:37,131 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2018-12-03 16:11:37,520 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-12-03 16:11:38,027 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-12-03 16:11:38,240 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-12-03 16:11:38,394 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-12-03 16:11:38,662 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-12-03 16:11:38,859 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 16:11:39,123 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-12-03 16:11:39,347 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-12-03 16:11:39,561 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-12-03 16:11:40,120 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-12-03 16:11:40,300 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 16:11:40,762 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2018-12-03 16:11:40,952 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-12-03 16:11:41,093 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 16:11:41,747 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2018-12-03 16:11:42,169 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-12-03 16:11:42,443 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-12-03 16:11:42,633 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-03 16:11:42,945 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-12-03 16:11:43,115 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 16:11:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:43,216 INFO L93 Difference]: Finished difference Result 4114 states and 4990 transitions. [2018-12-03 16:11:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:11:43,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-12-03 16:11:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:43,232 INFO L225 Difference]: With dead ends: 4114 [2018-12-03 16:11:43,233 INFO L226 Difference]: Without dead ends: 4113 [2018-12-03 16:11:43,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3909 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3042, Invalid=11964, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 16:11:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-12-03 16:11:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 702. [2018-12-03 16:11:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-12-03 16:11:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 894 transitions. [2018-12-03 16:11:43,301 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 894 transitions. Word has length 99 [2018-12-03 16:11:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:43,301 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 894 transitions. [2018-12-03 16:11:43,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:11:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 894 transitions. [2018-12-03 16:11:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:11:43,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:43,304 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:43,304 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:43,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash -667579402, now seen corresponding path program 1 times [2018-12-03 16:11:43,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:43,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:43,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-03 16:11:43,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:43,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:11:43,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:43,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:43,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:43,531 INFO L87 Difference]: Start difference. First operand 702 states and 894 transitions. Second operand 5 states. [2018-12-03 16:11:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:43,823 INFO L93 Difference]: Finished difference Result 1523 states and 1947 transitions. [2018-12-03 16:11:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:11:43,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 16:11:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:43,830 INFO L225 Difference]: With dead ends: 1523 [2018-12-03 16:11:43,830 INFO L226 Difference]: Without dead ends: 822 [2018-12-03 16:11:43,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-12-03 16:11:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 637. [2018-12-03 16:11:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-12-03 16:11:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 819 transitions. [2018-12-03 16:11:43,870 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 819 transitions. Word has length 104 [2018-12-03 16:11:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:43,871 INFO L480 AbstractCegarLoop]: Abstraction has 637 states and 819 transitions. [2018-12-03 16:11:43,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 819 transitions. [2018-12-03 16:11:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 16:11:43,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:43,873 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:43,873 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:43,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-12-03 16:11:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-03 16:11:43,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:43,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:43,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:43,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:43,946 INFO L87 Difference]: Start difference. First operand 637 states and 819 transitions. Second operand 3 states. [2018-12-03 16:11:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:44,277 INFO L93 Difference]: Finished difference Result 1022 states and 1299 transitions. [2018-12-03 16:11:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:44,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-03 16:11:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:44,278 INFO L225 Difference]: With dead ends: 1022 [2018-12-03 16:11:44,278 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:11:44,279 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:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:11:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:11:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:11:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:11:44,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-12-03 16:11:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:44,280 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:11:44,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:11:44,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:11:44,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:11:44,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:44,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:44,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:44,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:45,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:47,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:47,060 WARN L180 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 467 DAG size of output: 412 [2018-12-03 16:11:54,490 WARN L180 SmtUtils]: Spent 7.42 s on a formula simplification. DAG size of input: 402 DAG size of output: 149 [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-12-03 16:11:54,494 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-12-03 16:11:54,495 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-12-03 16:11:54,495 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-12-03 16:11:54,495 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-12-03 16:11:54,495 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-12-03 16:11:54,495 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-12-03 16:11:54,495 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L444 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse13 (<= Elevator_current Elevator_max)) (.cse41 (+ Elevator_current 1))) (let ((.cse21 (and .cse13 (< Elevator_min .cse41) (<= Elevator_qDC1 1))) (.cse23 (= Elevator_qCSP 1)) (.cse3 (<= Elevator_min Elevator_current)) (.cse39 (+ |Elevator_current'| 1)) (.cse4 (<= Elevator_min |Elevator_current'|)) (.cse40 (+ Elevator_min 1)) (.cse42 (+ Elevator_dir Elevator_goal)) (.cse26 (= |Elevator_dir'| 1)) (.cse31 (+ |Elevator_dir'| 1))) (let ((.cse12 (or (= .cse31 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse15 (or .cse26 (<= |Elevator_goal'| |Elevator_current'|))) (.cse10 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse0 (or (<= Elevator_current .cse42) (= (+ Elevator_dir 1) 0))) (.cse8 (or (<= .cse42 Elevator_current) (= Elevator_dir 1))) (.cse18 (not (= .cse42 Elevator_current))) (.cse19 (not Elevator_newgoal)) (.cse29 (<= .cse40 |Elevator_current'|)) (.cse30 (and (<= .cse39 Elevator_max) .cse4)) (.cse22 (= Elevator_qDC2 3)) (.cse25 (<= Elevator_c2 Elevator_c3)) (.cse28 (or (and .cse13 (<= .cse40 Elevator_current)) (and (<= .cse41 Elevator_max) .cse3))) (.cse34 (<= 1 Elevator_dir)) (.cse32 (= Elevator_current Elevator_goal)) (.cse33 (<= (+ Elevator_dir Elevator_current 2) Elevator_max)) (.cse20 (= Elevator_qDC2 1)) (.cse24 (and .cse21 .cse23)) (.cse9 (not Elevator_passed)) (.cse14 (= Elevator_qDC1 2)) (.cse11 (not Elevator_stop)) (.cse2 (not (= Elevator_goal Elevator_current))) (.cse37 (or (<= .cse39 |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (.cse1 (<= |Elevator_current'| Elevator_max)) (.cse38 (not (= Elevator_qCSP 3))) (.cse16 (= Elevator_qDC2 2)) (.cse5 (<= |Elevator_goal'| Elevator_max)) (.cse17 (<= Elevator_min |Elevator_goal'|)) (.cse6 (<= Elevator_goal Elevator_max)) (.cse7 (<= Elevator_min Elevator_goal))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (and .cse1 .cse2 .cse3 .cse13 .cse20 .cse4 .cse9 .cse10) (and .cse2 .cse20 .cse21 .cse10) (and .cse2 .cse22 .cse21 .cse10) (and .cse11 .cse1 .cse3 .cse13 .cse14 .cse4 .cse22 .cse23 .cse9) (and (and .cse1 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse16 .cse21) .cse10 .cse11 .cse12 .cse15 .cse17 .cse18) .cse19) (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse22 .cse9 .cse10) (and (and .cse11 .cse14 (and .cse1 .cse3 .cse13 .cse16 .cse4 .cse23 .cse9) .cse5 .cse17 .cse6 .cse7) .cse19) (and .cse11 .cse24 .cse22) (and (and .cse25 (and (and .cse1 .cse3 .cse13 .cse14 .cse20 .cse4 .cse23 .cse9) .cse5 .cse17 .cse6 .cse7)) .cse19) (and (and .cse11 .cse5 (and .cse16 .cse24) .cse17 .cse6 .cse7) .cse19) (and (let ((.cse27 (+ |Elevator_goal'| |Elevator_dir'|))) (and (or .cse26 (<= .cse27 |Elevator_current'|)) .cse0 (and .cse16 .cse28) (not (= .cse27 |Elevator_current'|)) .cse5 (or (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (or .cse29 .cse30) .cse6 .cse7 .cse8 .cse11 (or (= 0 .cse31) (<= |Elevator_current'| .cse27)) .cse14 .cse17 .cse18 (or .cse32 .cse33 .cse34))) .cse19) (and .cse19 (and .cse25 (< Elevator_c2 2.0) (and (or (and .cse11 .cse1 .cse3 .cse13 .cse14 .cse4 .cse22 .cse9) (and .cse11 (and .cse28 (or (and .cse1 .cse29) .cse30)) .cse14 .cse22)) .cse5 .cse17 .cse6 .cse7))) (and .cse25 (let ((.cse35 (and .cse20 .cse24))) (or (and .cse35 .cse28 (let ((.cse36 (+ Elevator_dir Elevator_current))) (or (and (<= .cse36 Elevator_max) .cse34) .cse32 (and (<= Elevator_min .cse36) .cse33))) .cse6 .cse7) (and .cse35 .cse5 .cse17 .cse6 .cse7)))) (and .cse1 .cse2 .cse3 .cse37 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse38 .cse13 .cse14 .cse16 .cse17) (and .cse11 .cse2 .cse37 (and .cse1 (and (and .cse38 .cse21) .cse16) .cse4 .cse5 .cse17 .cse6 .cse7)))))) [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-12-03 16:11:54,496 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-12-03 16:11:54,497 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-12-03 16:11:54,497 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-12-03 16:11:54,497 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-12-03 16:11:54,497 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-12-03 16:11:54,515 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:11:54 BoogieIcfgContainer [2018-12-03 16:11:54,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:11:54,516 INFO L168 Benchmark]: Toolchain (without parser) took 46108.71 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -721.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 16:11:54,517 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:11:54,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:11:54,518 INFO L168 Benchmark]: Boogie Preprocessor took 32.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:11:54,519 INFO L168 Benchmark]: RCFGBuilder took 861.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:54,520 INFO L168 Benchmark]: TraceAbstraction took 45172.51 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 16:11:54,523 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 861.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45172.51 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((current <= dir + goal || dir + 1 == 0) && current' <= max) && !(goal == current)) && min <= current) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !passed) && !(current' == goal')) && !stop) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && qDC1 == 2) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && !newgoal) || (((((((current' <= max && !(goal == current)) && min <= current) && current <= max) && qDC2 == 1) && min <= current') && !passed) && !(current' == goal'))) || (((!(goal == current) && qDC2 == 1) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || (((!(goal == current) && qDC2 == 3) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || ((((((((!stop && current' <= max) && min <= current) && current <= max) && qDC1 == 2) && min <= current') && qDC2 == 3) && qCSP == 1) && !passed)) || (((((((((((((((current' <= max && (current <= dir + goal || dir + 1 == 0)) && !(goal == current)) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && qDC2 == 2 && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal')) && !stop) && (dir' + 1 == 0 || current' <= goal')) && (dir' == 1 || goal' <= current')) && min <= goal') && !(dir + goal == current)) && !newgoal)) || (((((((current' <= max && !(goal == current)) && min <= current) && current <= max) && min <= current') && qDC2 == 3) && !passed) && !(current' == goal'))) || (((((((!stop && qDC1 == 2) && (((((current' <= max && min <= current) && current <= max) && qDC2 == 2) && min <= current') && qCSP == 1) && !passed) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || ((!stop && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && qDC2 == 3)) || ((c2 <= c3 && ((((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 1) && min <= current') && qCSP == 1) && !passed) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || ((((((!stop && goal' <= max) && qDC2 == 2 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || (((((((((((((((((dir' == 1 || goal' + dir' <= current') && (current <= dir + goal || dir + 1 == 0)) && qDC2 == 2 && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && !(goal' + dir' == current')) && goal' <= max) && (1 <= dir' || current' + dir' + 2 <= max)) && (min + 1 <= current' || (current' + 1 <= max && min <= current'))) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !stop) && (0 == dir' + 1 || current' <= goal' + dir')) && qDC1 == 2) && min <= goal') && !(dir + goal == current)) && ((current == goal || dir + current + 2 <= max) || 1 <= dir)) && !newgoal)) || (!newgoal && (c2 <= c3 && c2 < 2.0) && (((((((((((!stop && current' <= max) && min <= current) && current <= max) && qDC1 == 2) && min <= current') && qDC2 == 3) && !passed) || (((!stop && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && qDC1 == 2) && qDC2 == 3)) && goal' <= max) && min <= goal') && goal <= max) && min <= goal)) || (c2 <= c3 && ((((((qDC2 == 1 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (((dir + current <= max && 1 <= dir) || current == goal) || (min <= dir + current && dir + current + 2 <= max))) && goal <= max) && min <= goal) || (((((qDC2 == 1 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal' <= max) && min <= goal') && goal <= max) && min <= goal)))) || ((((((((((((((current' <= max && !(goal == current)) && min <= current) && (current' + 1 <= goal' || goal' + 1 <= current')) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && !passed) && !stop) && !(qCSP == 3)) && current <= max) && qDC1 == 2) && qDC2 == 2) && min <= goal')) || (((!stop && !(goal == current)) && (current' + 1 <= goal' || goal' + 1 <= current')) && (((((current' <= max && (!(qCSP == 3) && (current <= max && min < current + 1) && qDC1 <= 1) && qDC2 == 2) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 45.0s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1373 SDtfs, 3033 SDslu, 5040 SDs, 0 SdLazy, 1583 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4104 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 5081 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 40 NumberOfFragments, 901 HoareAnnotationTreeSize, 1 FomulaSimplifications, 106912 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 1 FomulaSimplificationsInter, 361763 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051840 SizeOfPredicates, 57 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 1482/1999 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...