java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/real-life/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:10,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:10,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:10,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:10,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:10,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:10,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:10,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:10,236 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:10,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:10,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:10,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:10,239 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:10,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:10,241 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:10,242 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:10,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:10,248 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:10,255 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:10,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:10,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:10,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:10,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:10,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:10,266 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:10,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:10,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:10,269 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:10,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:10,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:10,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:10,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:10,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:10,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:10,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:10,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:10,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:13:10,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:10,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:10,307 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:10,307 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:10,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:10,308 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:10,308 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:10,309 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:10,309 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:10,309 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:10,309 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:10,310 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:10,310 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:10,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:10,313 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:10,313 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:10,313 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:10,313 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:10,315 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:10,315 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:10,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:10,316 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:10,316 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:10,316 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:10,316 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:10,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:10,317 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:10,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:10,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:10,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:10,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:10,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:10,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:10,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:10,319 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:10,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:10,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:10,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:10,320 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:10,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:10,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:10,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:10,381 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:10,381 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:10,382 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 17:13:10,383 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-12-03 17:13:10,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:10,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:10,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:10,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:10,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:10,453 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 05:13:10" (1/1) ... [2018-12-03 17:13:10,464 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 05:13:10" (1/1) ... [2018-12-03 17:13:10,471 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:10,471 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:10,471 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:10,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:10,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:10,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:10,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:10,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:10,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:10,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:10,507 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:10,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:10,584 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 17:13:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 17:13:10,585 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 17:13:11,162 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:11,163 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:13:11,163 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:11 BoogieIcfgContainer [2018-12-03 17:13:11,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:11,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:11,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:11,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:11,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/2) ... [2018-12-03 17:13:11,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8d6830 and model type Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:13:11, skipping insertion in model container [2018-12-03 17:13:11,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:11" (2/2) ... [2018-12-03 17:13:11,172 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-12-03 17:13:11,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:11,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:13:11,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:13:11,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:11,236 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:11,236 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:11,236 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:11,236 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:11,236 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:11,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:11,237 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-03 17:13:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:11,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:11,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:13:11,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:11,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-12-03 17:13:11,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:11,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:11,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:11,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:13:11,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:11,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:11,442 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-12-03 17:13:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:11,541 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-12-03 17:13:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:11,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 17:13:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:11,558 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:13:11,558 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:13:11,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:13:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-03 17:13:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:13:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-12-03 17:13:11,607 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-12-03 17:13:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:11,607 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-12-03 17:13:11,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-12-03 17:13:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:11,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:11,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:13:11,609 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:11,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-12-03 17:13:11,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:11,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:11,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 17:13:11,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:11,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:11,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:11,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:11,684 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-12-03 17:13:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:11,807 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-12-03 17:13:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:11,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 17:13:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:11,809 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:13:11,809 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:13:11,811 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 17:13:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:13:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 17:13:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:13:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-12-03 17:13:11,821 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-12-03 17:13:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:11,822 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-12-03 17:13:11,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-12-03 17:13:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:13:11,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:11,824 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:11,824 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:11,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-12-03 17:13:11,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:11,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:11,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,028 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 17:13:12,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:13:12,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:12,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:12,030 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-12-03 17:13:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,343 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-12-03 17:13:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:12,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:13:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,348 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:13:12,348 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:13:12,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:13:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-12-03 17:13:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:13:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-12-03 17:13:12,363 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-12-03 17:13:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,363 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-12-03 17:13:12,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-12-03 17:13:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:13:12,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,366 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 17:13:12,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:12,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-12-03 17:13:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,436 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 17:13:12,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:12,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:12,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:12,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:12,438 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-12-03 17:13:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,635 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-12-03 17:13:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:12,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 17:13:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,643 INFO L225 Difference]: With dead ends: 205 [2018-12-03 17:13:12,643 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:13:12,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:13:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-12-03 17:13:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:13:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-12-03 17:13:12,671 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-12-03 17:13:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,671 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-12-03 17:13:12,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-12-03 17:13:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:13:12,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,678 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 17:13:12,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:12,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-12-03 17:13:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,765 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 17:13:12,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:12,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:12,766 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-12-03 17:13:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,879 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-12-03 17:13:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:12,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-03 17:13:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,881 INFO L225 Difference]: With dead ends: 297 [2018-12-03 17:13:12,882 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 17:13:12,883 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 17:13:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 17:13:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 17:13:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 17:13:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-12-03 17:13:12,904 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [2018-12-03 17:13:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,904 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 310 transitions. [2018-12-03 17:13:12,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-12-03 17:13:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:13:12,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,907 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 17:13:12,907 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:12,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-12-03 17:13:12,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,948 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 17:13:12,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:12,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:12,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:12,951 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-12-03 17:13:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,062 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-12-03 17:13:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-03 17:13:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,065 INFO L225 Difference]: With dead ends: 472 [2018-12-03 17:13:13,065 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 17:13:13,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 17:13:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-12-03 17:13:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 17:13:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-12-03 17:13:13,084 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-12-03 17:13:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,085 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-12-03 17:13:13,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-12-03 17:13:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:13:13,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,087 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 17:13:13,087 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:13,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-12-03 17:13:13,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,153 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 17:13:13,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:13,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,155 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-12-03 17:13:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,286 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-12-03 17:13:13,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 17:13:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,294 INFO L225 Difference]: With dead ends: 480 [2018-12-03 17:13:13,295 INFO L226 Difference]: Without dead ends: 289 [2018-12-03 17:13:13,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-03 17:13:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-12-03 17:13:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 17:13:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-12-03 17:13:13,329 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-12-03 17:13:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,329 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-12-03 17:13:13,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-12-03 17:13:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:13:13,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,336 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 17:13:13,336 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:13,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-12-03 17:13:13,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,445 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 17:13:13,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:13,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:13,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,448 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-12-03 17:13:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,756 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-12-03 17:13:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 17:13:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,759 INFO L225 Difference]: With dead ends: 378 [2018-12-03 17:13:13,759 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 17:13:13,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 17:13:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-12-03 17:13:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 17:13:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-12-03 17:13:13,771 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-12-03 17:13:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,772 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-12-03 17:13:13,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-12-03 17:13:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:13:13,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,774 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 17:13:13,774 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:13,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-12-03 17:13:13,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:14,052 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 17:13:14,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:14,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:14,054 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-12-03 17:13:14,055 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 17:13:14,116 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:14,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:15,010 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:13:15,016 INFO L272 AbstractInterpreter]: Visited 28 different actions 129 times. Merged at 26 different actions 76 times. Never widened. Found 15 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:13:15,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:15,058 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:13:15,391 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 30.09% of their original sizes. [2018-12-03 17:13:15,391 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:13:17,111 INFO L418 sIntCurrentIteration]: We unified 53 AI predicates to 53 [2018-12-03 17:13:17,111 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:13:17,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:17,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 27 [2018-12-03 17:13:17,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:17,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:13:17,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:13:17,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:13:17,115 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 21 states. [2018-12-03 17:13:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:25,416 INFO L93 Difference]: Finished difference Result 574 states and 895 transitions. [2018-12-03 17:13:25,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:13:25,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-03 17:13:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:25,421 INFO L225 Difference]: With dead ends: 574 [2018-12-03 17:13:25,421 INFO L226 Difference]: Without dead ends: 394 [2018-12-03 17:13:25,423 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=510, Invalid=1130, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:13:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-03 17:13:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 322. [2018-12-03 17:13:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-12-03 17:13:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 487 transitions. [2018-12-03 17:13:25,451 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 487 transitions. Word has length 54 [2018-12-03 17:13:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:25,451 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 487 transitions. [2018-12-03 17:13:25,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:13:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 487 transitions. [2018-12-03 17:13:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:13:25,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:25,453 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:25,454 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:25,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -831478527, now seen corresponding path program 1 times [2018-12-03 17:13:25,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:25,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:25,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 17:13:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:25,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:25,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:25,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:25,518 INFO L87 Difference]: Start difference. First operand 322 states and 487 transitions. Second operand 3 states. [2018-12-03 17:13:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:25,623 INFO L93 Difference]: Finished difference Result 649 states and 1001 transitions. [2018-12-03 17:13:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:25,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 17:13:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:25,627 INFO L225 Difference]: With dead ends: 649 [2018-12-03 17:13:25,627 INFO L226 Difference]: Without dead ends: 475 [2018-12-03 17:13:25,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-12-03 17:13:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 460. [2018-12-03 17:13:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 17:13:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 688 transitions. [2018-12-03 17:13:25,649 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 688 transitions. Word has length 54 [2018-12-03 17:13:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:25,650 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 688 transitions. [2018-12-03 17:13:25,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 688 transitions. [2018-12-03 17:13:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:13:25,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:25,651 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:25,652 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:25,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -6028891, now seen corresponding path program 1 times [2018-12-03 17:13:25,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:25,830 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 17:13:25,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:25,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:25,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:25,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:25,832 INFO L87 Difference]: Start difference. First operand 460 states and 688 transitions. Second operand 4 states. [2018-12-03 17:13:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:26,136 INFO L93 Difference]: Finished difference Result 1195 states and 1797 transitions. [2018-12-03 17:13:26,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:13:26,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 17:13:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:26,142 INFO L225 Difference]: With dead ends: 1195 [2018-12-03 17:13:26,142 INFO L226 Difference]: Without dead ends: 716 [2018-12-03 17:13:26,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-12-03 17:13:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 586. [2018-12-03 17:13:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-12-03 17:13:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 882 transitions. [2018-12-03 17:13:26,171 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 882 transitions. Word has length 55 [2018-12-03 17:13:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:26,172 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 882 transitions. [2018-12-03 17:13:26,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 882 transitions. [2018-12-03 17:13:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:13:26,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:26,173 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:26,173 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:26,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash -258049078, now seen corresponding path program 1 times [2018-12-03 17:13:26,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:13:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:26,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:26,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:26,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:26,275 INFO L87 Difference]: Start difference. First operand 586 states and 882 transitions. Second operand 3 states. [2018-12-03 17:13:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:26,538 INFO L93 Difference]: Finished difference Result 1307 states and 1959 transitions. [2018-12-03 17:13:26,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:26,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 17:13:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:26,543 INFO L225 Difference]: With dead ends: 1307 [2018-12-03 17:13:26,544 INFO L226 Difference]: Without dead ends: 746 [2018-12-03 17:13:26,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-03 17:13:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 715. [2018-12-03 17:13:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-12-03 17:13:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1053 transitions. [2018-12-03 17:13:26,573 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1053 transitions. Word has length 59 [2018-12-03 17:13:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:26,573 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1053 transitions. [2018-12-03 17:13:26,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1053 transitions. [2018-12-03 17:13:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:13:26,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:26,576 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 17:13:26,576 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:26,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:26,576 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-12-03 17:13:26,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:26,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:27,202 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:13:27,543 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:13:27,631 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 17:13:27,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:27,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:27,631 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 17:13:27,632 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 17:13:27,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:27,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:27,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:27,975 INFO L272 AbstractInterpreter]: Visited 33 different actions 260 times. Merged at 32 different actions 163 times. Widened at 1 different actions 2 times. Found 42 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 17:13:27,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:27,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:27,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:27,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:13:27,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:27,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:28,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:28,801 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-03 17:13:28,925 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 17:13:28,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:29,381 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 17:13:29,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:29,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2018-12-03 17:13:29,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:29,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:13:29,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:13:29,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:13:29,404 INFO L87 Difference]: Start difference. First operand 715 states and 1053 transitions. Second operand 14 states. [2018-12-03 17:13:31,076 WARN L180 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 17:13:31,277 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-03 17:13:32,983 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-12-03 17:13:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:33,496 INFO L93 Difference]: Finished difference Result 2543 states and 3693 transitions. [2018-12-03 17:13:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:13:33,496 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-12-03 17:13:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:33,509 INFO L225 Difference]: With dead ends: 2543 [2018-12-03 17:13:33,510 INFO L226 Difference]: Without dead ends: 2542 [2018-12-03 17:13:33,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:13:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2018-12-03 17:13:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1283. [2018-12-03 17:13:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-12-03 17:13:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1918 transitions. [2018-12-03 17:13:33,584 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1918 transitions. Word has length 59 [2018-12-03 17:13:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:33,585 INFO L480 AbstractCegarLoop]: Abstraction has 1283 states and 1918 transitions. [2018-12-03 17:13:33,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:13:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1918 transitions. [2018-12-03 17:13:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:13:33,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:33,588 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 17:13:33,588 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:33,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1560627404, now seen corresponding path program 1 times [2018-12-03 17:13:33,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:33,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:33,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:33,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:33,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:33,702 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 17:13:33,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:33,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:33,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:33,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:33,704 INFO L87 Difference]: Start difference. First operand 1283 states and 1918 transitions. Second operand 3 states. [2018-12-03 17:13:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:34,007 INFO L93 Difference]: Finished difference Result 2348 states and 3502 transitions. [2018-12-03 17:13:34,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:34,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 17:13:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:34,013 INFO L225 Difference]: With dead ends: 2348 [2018-12-03 17:13:34,014 INFO L226 Difference]: Without dead ends: 1018 [2018-12-03 17:13:34,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2018-12-03 17:13:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1000. [2018-12-03 17:13:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 17:13:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1447 transitions. [2018-12-03 17:13:34,054 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1447 transitions. Word has length 80 [2018-12-03 17:13:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:34,055 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1447 transitions. [2018-12-03 17:13:34,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1447 transitions. [2018-12-03 17:13:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:13:34,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:34,057 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 17:13:34,057 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:34,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-12-03 17:13:34,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:34,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:34,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:34,126 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 17:13:34,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:34,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:34,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:34,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:34,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:34,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:34,127 INFO L87 Difference]: Start difference. First operand 1000 states and 1447 transitions. Second operand 4 states. [2018-12-03 17:13:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:34,240 INFO L93 Difference]: Finished difference Result 2005 states and 2895 transitions. [2018-12-03 17:13:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:34,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 17:13:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:34,245 INFO L225 Difference]: With dead ends: 2005 [2018-12-03 17:13:34,245 INFO L226 Difference]: Without dead ends: 1000 [2018-12-03 17:13:34,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-12-03 17:13:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2018-12-03 17:13:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-12-03 17:13:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1393 transitions. [2018-12-03 17:13:34,284 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1393 transitions. Word has length 81 [2018-12-03 17:13:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:34,285 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1393 transitions. [2018-12-03 17:13:34,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1393 transitions. [2018-12-03 17:13:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:13:34,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:34,287 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 17:13:34,288 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:34,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1878047832, now seen corresponding path program 1 times [2018-12-03 17:13:34,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:34,369 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 17:13:34,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:34,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:34,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:34,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:34,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:34,370 INFO L87 Difference]: Start difference. First operand 998 states and 1393 transitions. Second operand 3 states. [2018-12-03 17:13:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:34,586 INFO L93 Difference]: Finished difference Result 2069 states and 2893 transitions. [2018-12-03 17:13:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:34,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-03 17:13:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:34,590 INFO L225 Difference]: With dead ends: 2069 [2018-12-03 17:13:34,590 INFO L226 Difference]: Without dead ends: 986 [2018-12-03 17:13:34,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-12-03 17:13:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 830. [2018-12-03 17:13:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-12-03 17:13:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1144 transitions. [2018-12-03 17:13:34,627 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1144 transitions. Word has length 98 [2018-12-03 17:13:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:34,627 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1144 transitions. [2018-12-03 17:13:34,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1144 transitions. [2018-12-03 17:13:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:13:34,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:34,630 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 17:13:34,630 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:34,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-12-03 17:13:34,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:34,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:35,111 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-12-03 17:13:35,470 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 17:13:35,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:35,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:35,471 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 17:13:35,471 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 17:13:35,474 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:35,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:35,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:35,719 INFO L272 AbstractInterpreter]: Visited 38 different actions 246 times. Merged at 35 different actions 133 times. Never widened. Found 43 fixpoints after 19 different actions. Largest state had 0 variables. [2018-12-03 17:13:35,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:35,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:35,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:35,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:13:35,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:35,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:35,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:36,794 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 17:13:36,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:37,711 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 26 [2018-12-03 17:13:37,884 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 17:13:37,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:37,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 38 [2018-12-03 17:13:37,905 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:37,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:13:37,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:13:37,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:13:37,907 INFO L87 Difference]: Start difference. First operand 830 states and 1144 transitions. Second operand 26 states. [2018-12-03 17:13:38,290 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-12-03 17:13:38,909 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-12-03 17:13:39,118 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-12-03 17:13:39,424 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-12-03 17:13:39,690 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-12-03 17:13:39,991 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-12-03 17:13:40,284 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-12-03 17:13:40,428 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2018-12-03 17:13:40,822 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2018-12-03 17:13:41,112 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-12-03 17:13:41,364 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-12-03 17:13:41,613 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-12-03 17:13:41,846 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 17:13:42,234 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-12-03 17:13:42,897 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 17:13:43,164 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 17:13:43,349 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-03 17:13:43,649 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-12-03 17:13:43,926 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-12-03 17:13:44,072 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-12-03 17:13:44,781 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-12-03 17:13:45,062 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-03 17:13:45,420 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2018-12-03 17:13:45,586 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-03 17:13:45,791 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-12-03 17:13:46,380 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2018-12-03 17:13:46,893 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-12-03 17:13:47,102 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-03 17:13:47,474 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-12-03 17:13:47,667 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-12-03 17:13:48,083 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-12-03 17:13:48,252 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 17:13:48,532 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-12-03 17:13:48,755 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-12-03 17:13:48,930 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-12-03 17:13:49,404 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-12-03 17:13:49,583 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 17:13:49,933 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-12-03 17:13:50,212 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2018-12-03 17:13:50,494 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-12-03 17:13:50,684 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 17:13:51,335 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 17:13:52,222 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2018-12-03 17:13:52,771 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-12-03 17:13:53,353 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-03 17:13:53,659 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-12-03 17:13:53,842 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 17:13:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:54,129 INFO L93 Difference]: Finished difference Result 6565 states and 8499 transitions. [2018-12-03 17:13:54,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:13:54,130 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-12-03 17:13:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:54,149 INFO L225 Difference]: With dead ends: 6565 [2018-12-03 17:13:54,149 INFO L226 Difference]: Without dead ends: 6564 [2018-12-03 17:13:54,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=3682, Invalid=14678, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:13:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2018-12-03 17:13:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 1209. [2018-12-03 17:13:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2018-12-03 17:13:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1673 transitions. [2018-12-03 17:13:54,264 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1673 transitions. Word has length 99 [2018-12-03 17:13:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:54,265 INFO L480 AbstractCegarLoop]: Abstraction has 1209 states and 1673 transitions. [2018-12-03 17:13:54,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:13:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1673 transitions. [2018-12-03 17:13:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:13:54,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:54,268 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 17:13:54,268 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:54,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash -667579402, now seen corresponding path program 1 times [2018-12-03 17:13:54,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:54,390 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 17:13:54,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:54,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:13:54,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:54,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:54,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:54,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:54,392 INFO L87 Difference]: Start difference. First operand 1209 states and 1673 transitions. Second operand 5 states. [2018-12-03 17:13:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:54,528 INFO L93 Difference]: Finished difference Result 2855 states and 3928 transitions. [2018-12-03 17:13:54,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:13:54,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 17:13:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:54,534 INFO L225 Difference]: With dead ends: 2855 [2018-12-03 17:13:54,534 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 17:13:54,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 17:13:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1273. [2018-12-03 17:13:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1273 states. [2018-12-03 17:13:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1748 transitions. [2018-12-03 17:13:54,620 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1748 transitions. Word has length 104 [2018-12-03 17:13:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:54,621 INFO L480 AbstractCegarLoop]: Abstraction has 1273 states and 1748 transitions. [2018-12-03 17:13:54,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1748 transitions. [2018-12-03 17:13:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 17:13:54,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:54,624 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 17:13:54,624 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:54,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-12-03 17:13:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:54,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:54,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:54,705 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 17:13:54,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:54,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:54,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:54,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:54,707 INFO L87 Difference]: Start difference. First operand 1273 states and 1748 transitions. Second operand 3 states. [2018-12-03 17:13:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:55,022 INFO L93 Difference]: Finished difference Result 2396 states and 3276 transitions. [2018-12-03 17:13:55,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:55,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-03 17:13:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:55,025 INFO L225 Difference]: With dead ends: 2396 [2018-12-03 17:13:55,026 INFO L226 Difference]: Without dead ends: 1144 [2018-12-03 17:13:55,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-12-03 17:13:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 714. [2018-12-03 17:13:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-12-03 17:13:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 940 transitions. [2018-12-03 17:13:55,067 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 940 transitions. Word has length 117 [2018-12-03 17:13:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:55,068 INFO L480 AbstractCegarLoop]: Abstraction has 714 states and 940 transitions. [2018-12-03 17:13:55,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 940 transitions. [2018-12-03 17:13:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 17:13:55,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:55,071 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:55,071 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:55,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash 819829688, now seen corresponding path program 1 times [2018-12-03 17:13:55,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:55,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:55,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-03 17:13:55,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:55,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:55,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:55,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:55,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:55,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:55,204 INFO L87 Difference]: Start difference. First operand 714 states and 940 transitions. Second operand 3 states. [2018-12-03 17:13:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:55,404 INFO L93 Difference]: Finished difference Result 950 states and 1227 transitions. [2018-12-03 17:13:55,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:55,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-12-03 17:13:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:55,405 INFO L225 Difference]: With dead ends: 950 [2018-12-03 17:13:55,405 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:13:55,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:13:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:13:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:13:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:13:55,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2018-12-03 17:13:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:55,408 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:13:55,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:13:55,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:13:55,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:13:55,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:13:59,901 WARN L180 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 648 DAG size of output: 631 [2018-12-03 17:14:11,670 WARN L180 SmtUtils]: Spent 11.76 s on a formula simplification. DAG size of input: 627 DAG size of output: 165 [2018-12-03 17:14:11,676 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-12-03 17:14:11,676 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-12-03 17:14:11,676 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-12-03 17:14:11,676 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-12-03 17:14:11,676 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-12-03 17:14:11,676 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-12-03 17:14:11,676 INFO L448 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-12-03 17:14:11,677 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-12-03 17:14:11,678 INFO L444 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse23 (<= Elevator_current Elevator_max)) (.cse39 (+ Elevator_current 1))) (let ((.cse34 (not (= Elevator_qCSP 3))) (.cse3 (and .cse23 (< Elevator_min .cse39) (<= Elevator_qDC1 1))) (.cse35 (= Elevator_qCSP 1))) (let ((.cse24 (not Elevator_passed)) (.cse16 (<= |Elevator_current'| Elevator_max)) (.cse36 (+ |Elevator_current'| 1)) (.cse17 (<= Elevator_min |Elevator_current'|)) (.cse22 (<= Elevator_min Elevator_current)) (.cse37 (+ Elevator_dir Elevator_goal)) (.cse40 (+ |Elevator_goal'| |Elevator_dir'|)) (.cse8 (<= Elevator_goal Elevator_max)) (.cse9 (<= Elevator_min Elevator_goal)) (.cse6 (<= |Elevator_goal'| Elevator_max)) (.cse7 (<= Elevator_min |Elevator_goal'|)) (.cse18 (and .cse3 .cse35)) (.cse32 (<= 1.0 (+ Elevator_c3 (to_real Elevator_qDC2)))) (.cse11 (= Elevator_qDC2 1)) (.cse33 (<= Elevator_qDC2 Elevator_qDC1)) (.cse38 (+ Elevator_min 1)) (.cse31 (and .cse34 .cse3)) (.cse19 (= Elevator_qDC2 2))) (let ((.cse5 (and .cse31 .cse19)) (.cse14 (<= Elevator_c2 Elevator_c3)) (.cse15 (let ((.cse41 (<= .cse38 Elevator_max))) (or (and .cse18 (and .cse8 .cse9) .cse6 .cse41 .cse32 (<= 0.0 (* 2.0 Elevator_c2)) .cse7 (<= 2 (+ Elevator_qDC1 Elevator_qDC2)) .cse33) (and (<= Elevator_goal Elevator_current) .cse18 (<= 0.0 (+ Elevator_c2 (to_real (- Elevator_qDC2)) 1.0)) .cse41 .cse32 .cse11 (<= Elevator_current Elevator_goal) .cse33)))) (.cse25 (or (= |Elevator_dir'| 1) (<= .cse40 |Elevator_current'|))) (.cse26 (or (<= Elevator_current .cse37) (= (+ Elevator_dir 1) 0))) (.cse28 (not (= .cse40 |Elevator_current'|))) (.cse29 (or (<= .cse37 Elevator_current) (= Elevator_dir 1))) (.cse27 (or (= 0 (+ |Elevator_dir'| 1)) (<= |Elevator_current'| .cse40))) (.cse20 (or (and .cse23 (<= .cse38 Elevator_current)) (and (<= .cse39 Elevator_max) .cse22))) (.cse21 (or (and .cse16 (<= .cse38 |Elevator_current'|)) (and (<= .cse36 Elevator_max) .cse17))) (.cse30 (not (= .cse37 Elevator_current))) (.cse0 (not (= Elevator_goal Elevator_current))) (.cse1 (or (<= .cse36 |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (.cse10 (not Elevator_newgoal)) (.cse12 (and .cse16 .cse22 .cse23 .cse17 .cse35 .cse24)) (.cse2 (= Elevator_qDC2 3)) (.cse4 (not Elevator_stop)) (.cse13 (= Elevator_qDC1 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse11 .cse10 (and .cse12 .cse13 .cse6 .cse7 .cse8 .cse9)) (and .cse14 .cse15) (and .cse4 .cse7 (and .cse16 .cse5 .cse17 .cse6 .cse8 .cse9)) (and (and .cse18 .cse6 .cse7 .cse8 .cse9) .cse11 .cse10) (and .cse10 (and .cse6 (and .cse19 .cse18) .cse7 .cse8 .cse9)) (and (and .cse14 (and .cse6 .cse7 .cse8 .cse9 (or (and .cse4 (and .cse20 .cse21) .cse13 .cse2) (and .cse4 .cse16 .cse22 .cse23 .cse13 .cse17 .cse2 .cse24))) (< Elevator_c2 2.0)) .cse10) (and .cse16 .cse0 .cse22 .cse23 .cse1 .cse17 .cse2 .cse24) (and .cse18 .cse2) (and .cse10 (and .cse4 (and .cse6 (and .cse19 .cse3) .cse8 .cse9) .cse25 .cse26 .cse27 .cse28 .cse7 .cse29 .cse21 .cse30)) (and .cse0 .cse1 (and (and .cse8 .cse9 (<= Elevator_qCSP (+ Elevator_qDC2 2)) (<= 4 (* 2 Elevator_qCSP))) .cse6 .cse7 .cse31 .cse32 .cse11 (<= 0.0 (+ Elevator_c2 (to_real (- Elevator_qDC1)) 1.0)) .cse33)) (and .cse11 (and .cse4 (and .cse16 .cse0 .cse31 .cse1 .cse17 .cse6 .cse7 .cse8 .cse9))) (and .cse0 .cse1 .cse15) (and (and .cse25 .cse26 .cse28 .cse29 .cse4 .cse27 .cse13 (and .cse19 .cse20 .cse6 .cse8 .cse9) .cse7 .cse21 .cse30) .cse10) (and (and .cse4 .cse13 (and .cse16 .cse34 .cse0 .cse22 .cse23 .cse1 .cse17 .cse6 .cse7 .cse8 .cse9 .cse24)) .cse11) (and (and (and (and .cse12 .cse19) .cse13) .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse13 .cse12 .cse2) (and .cse4 .cse13 (and .cse6 .cse7 (and .cse16 .cse34 .cse22 .cse23 .cse19 .cse17 .cse24) .cse8 .cse9))))))) [2018-12-03 17:14:11,678 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-12-03 17:14:11,678 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-12-03 17:14:11,679 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-12-03 17:14:11,680 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-12-03 17:14:11,680 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-12-03 17:14:11,680 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-12-03 17:14:11,680 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-12-03 17:14:11,685 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: todo: implement more comprehensive to_real at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:235) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 17:14:11,688 INFO L168 Benchmark]: Toolchain (without parser) took 61254.58 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -414.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-12-03 17:14:11,689 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:11,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:11,690 INFO L168 Benchmark]: Boogie Preprocessor took 31.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:11,690 INFO L168 Benchmark]: RCFGBuilder took 657.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:14:11,691 INFO L168 Benchmark]: TraceAbstraction took 60522.66 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -446.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:14:11,695 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 657.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60522.66 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -446.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: todo: implement more comprehensive to_real de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: todo: implement more comprehensive to_real: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...