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_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:33,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:33,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:33,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:33,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:33,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:33,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:33,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:33,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:33,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:33,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:33,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:33,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:33,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:33,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:33,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:33,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:33,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:33,103 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:33,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:33,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:33,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:33,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:33,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:33,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:33,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:33,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:33,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:33,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:33,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:33,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:33,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:33,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:33,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:33,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:33,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:33,121 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:07:33,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:33,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:33,136 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:33,137 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:33,137 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:33,137 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:33,137 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:33,138 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:33,138 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:33,138 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:33,138 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:33,139 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:33,139 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:33,139 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:33,139 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:33,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:33,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:33,140 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:33,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:33,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:33,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:33,141 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:33,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:33,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:33,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:33,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:33,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:33,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:33,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:33,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:33,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:33,144 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:33,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:33,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:33,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:33,145 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:33,145 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:33,145 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:33,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:33,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:33,146 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:33,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:33,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:33,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:33,223 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:33,224 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:33,225 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 15:07:33,225 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-12-03 15:07:33,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:33,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:33,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:33,291 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:33,311 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 03:07:33" (1/1) ... [2018-12-03 15:07:33,322 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 03:07:33" (1/1) ... [2018-12-03 15:07:33,329 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:33,329 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:33,329 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:33,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:33,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:33,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:33,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:33,384 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:33,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (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 15:07:33,468 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 15:07:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 15:07:33,468 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 15:07:34,152 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:34,153 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:07:34,154 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:34 BoogieIcfgContainer [2018-12-03 15:07:34,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:34,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:34,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:34,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:34,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/2) ... [2018-12-03 15:07:34,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cb4598 and model type Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:07:34, skipping insertion in model container [2018-12-03 15:07:34,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:34" (2/2) ... [2018-12-03 15:07:34,163 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-12-03 15:07:34,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:34,182 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:07:34,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:07:34,234 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:34,234 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:34,234 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:34,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:34,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:34,235 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:34,235 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:34,235 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-03 15:07:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:07:34,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:07:34,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,270 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-12-03 15:07:34,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,446 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 15:07:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:34,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,468 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-12-03 15:07:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,557 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-12-03 15:07:34,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:34,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 15:07:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,581 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:07:34,581 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:07:34,585 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 15:07:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:07:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-03 15:07:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:07:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-12-03 15:07:34,627 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-12-03 15:07:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,627 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-12-03 15:07:34,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-12-03 15:07:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:07:34,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:07:34,629 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-12-03 15:07:34,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,718 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 15:07:34,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 15:07:34,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,722 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-12-03 15:07:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,884 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-12-03 15:07:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:34,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 15:07:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,887 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:07:34,887 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:07:34,890 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 15:07:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:07:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:07:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:07:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-12-03 15:07:34,901 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-12-03 15:07:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,902 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-12-03 15:07:34,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-12-03 15:07:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:07:34,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,903 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-12-03 15:07:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,066 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 15:07:35,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:35,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:35,068 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-12-03 15:07:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,353 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-12-03 15:07:35,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:07:35,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 15:07:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,357 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:07:35,357 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:07:35,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:07:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-12-03 15:07:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:07:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-12-03 15:07:35,372 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-12-03 15:07:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,373 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-12-03 15:07:35,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-12-03 15:07:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:07:35,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,375 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 15:07:35,375 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:35,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-12-03 15:07:35,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,418 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 15:07:35,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:35,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:35,424 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-12-03 15:07:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,571 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-12-03 15:07:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:35,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 15:07:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,573 INFO L225 Difference]: With dead ends: 205 [2018-12-03 15:07:35,573 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:07:35,574 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 15:07:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:07:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-12-03 15:07:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:07:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-12-03 15:07:35,588 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-12-03 15:07:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,589 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-12-03 15:07:35,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-12-03 15:07:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:07:35,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,590 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 15:07:35,591 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:35,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-12-03 15:07:35,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,744 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 15:07:35,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:35,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:07:35,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:07:35,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,746 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-12-03 15:07:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,858 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-12-03 15:07:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:07:35,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-03 15:07:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,862 INFO L225 Difference]: With dead ends: 297 [2018-12-03 15:07:35,862 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 15:07:35,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 15:07:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 15:07:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 15:07:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-12-03 15:07:35,883 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [2018-12-03 15:07:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,883 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 310 transitions. [2018-12-03 15:07:35,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:07:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-12-03 15:07:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:07:35,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,886 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 15:07:35,886 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:35,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-12-03 15:07:35,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,958 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 15:07:35,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:35,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:35,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:35,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:35,960 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-12-03 15:07:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,065 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-12-03 15:07:36,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-03 15:07:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,068 INFO L225 Difference]: With dead ends: 472 [2018-12-03 15:07:36,068 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 15:07:36,070 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 15:07:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 15:07:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-12-03 15:07:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 15:07:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-12-03 15:07:36,101 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-12-03 15:07:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,102 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-12-03 15:07:36,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-12-03 15:07:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:07:36,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,105 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 15:07:36,106 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:36,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-12-03 15:07:36,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:36,188 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 15:07:36,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:36,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:36,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:36,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:36,190 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-12-03 15:07:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,357 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-12-03 15:07:36,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 15:07:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,365 INFO L225 Difference]: With dead ends: 480 [2018-12-03 15:07:36,365 INFO L226 Difference]: Without dead ends: 289 [2018-12-03 15:07:36,366 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 15:07:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-03 15:07:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-12-03 15:07:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 15:07:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-12-03 15:07:36,381 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-12-03 15:07:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,381 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-12-03 15:07:36,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-12-03 15:07:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:07:36,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,384 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 15:07:36,384 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:36,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-12-03 15:07:36,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:36,487 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 15:07:36,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:36,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:36,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:36,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:36,490 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-12-03 15:07:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,791 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-12-03 15:07:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 15:07:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,797 INFO L225 Difference]: With dead ends: 378 [2018-12-03 15:07:36,797 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:07:36,798 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 15:07:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:07:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-12-03 15:07:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:07:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-12-03 15:07:36,822 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-12-03 15:07:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,825 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-12-03 15:07:36,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-12-03 15:07:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:07:36,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,831 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 15:07:36,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:36,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-12-03 15:07:36,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:37,120 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 15:07:37,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:37,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:37,122 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-12-03 15:07:37,124 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 15:07:37,168 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:37,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:37,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:37,839 INFO L272 AbstractInterpreter]: Visited 28 different actions 117 times. Merged at 27 different actions 69 times. Never widened. Found 16 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 15:07:37,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:37,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:37,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:37,884 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 15:07:37,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:37,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:37,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:38,221 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 15:07:38,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:38,235 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 15:07:38,265 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:07:38,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-12-03 15:07:38,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:38,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:38,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:07:38,267 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 4 states. [2018-12-03 15:07:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:38,688 INFO L93 Difference]: Finished difference Result 581 states and 925 transitions. [2018-12-03 15:07:38,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:07:38,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 15:07:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:38,694 INFO L225 Difference]: With dead ends: 581 [2018-12-03 15:07:38,695 INFO L226 Difference]: Without dead ends: 401 [2018-12-03 15:07:38,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:07:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-12-03 15:07:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 315. [2018-12-03 15:07:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 15:07:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2018-12-03 15:07:38,711 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 54 [2018-12-03 15:07:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:38,711 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2018-12-03 15:07:38,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2018-12-03 15:07:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:07:38,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:38,713 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:38,713 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:38,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -108589086, now seen corresponding path program 1 times [2018-12-03 15:07:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:07:38,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:38,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:38,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:38,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:38,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:38,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:38,791 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand 3 states. [2018-12-03 15:07:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:38,974 INFO L93 Difference]: Finished difference Result 799 states and 1240 transitions. [2018-12-03 15:07:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:38,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 15:07:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:38,983 INFO L225 Difference]: With dead ends: 799 [2018-12-03 15:07:38,983 INFO L226 Difference]: Without dead ends: 461 [2018-12-03 15:07:38,984 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 15:07:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-03 15:07:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2018-12-03 15:07:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 15:07:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 685 transitions. [2018-12-03 15:07:39,005 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 685 transitions. Word has length 56 [2018-12-03 15:07:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:39,005 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 685 transitions. [2018-12-03 15:07:39,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 685 transitions. [2018-12-03 15:07:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:07:39,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:39,008 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:39,008 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:39,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash -171668990, now seen corresponding path program 1 times [2018-12-03 15:07:39,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:39,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:39,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:39,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:39,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:07:39,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:39,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:39,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:39,080 INFO L87 Difference]: Start difference. First operand 460 states and 685 transitions. Second operand 3 states. [2018-12-03 15:07:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:39,143 INFO L93 Difference]: Finished difference Result 920 states and 1369 transitions. [2018-12-03 15:07:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:39,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 15:07:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:39,148 INFO L225 Difference]: With dead ends: 920 [2018-12-03 15:07:39,148 INFO L226 Difference]: Without dead ends: 461 [2018-12-03 15:07:39,149 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 15:07:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-03 15:07:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2018-12-03 15:07:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 15:07:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 665 transitions. [2018-12-03 15:07:39,167 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 665 transitions. Word has length 56 [2018-12-03 15:07:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:39,167 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 665 transitions. [2018-12-03 15:07:39,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 665 transitions. [2018-12-03 15:07:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:07:39,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:39,169 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:39,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:39,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2018629294, now seen corresponding path program 1 times [2018-12-03 15:07:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:39,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:39,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:39,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 15:07:39,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:39,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:39,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:39,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:39,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:39,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:39,285 INFO L87 Difference]: Start difference. First operand 460 states and 665 transitions. Second operand 3 states. [2018-12-03 15:07:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:39,580 INFO L93 Difference]: Finished difference Result 1079 states and 1553 transitions. [2018-12-03 15:07:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:39,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 15:07:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:39,586 INFO L225 Difference]: With dead ends: 1079 [2018-12-03 15:07:39,586 INFO L226 Difference]: Without dead ends: 620 [2018-12-03 15:07:39,587 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 15:07:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-12-03 15:07:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 589. [2018-12-03 15:07:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-12-03 15:07:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2018-12-03 15:07:39,611 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 59 [2018-12-03 15:07:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:39,611 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2018-12-03 15:07:39,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2018-12-03 15:07:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:07:39,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:39,613 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 15:07:39,613 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:39,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:39,613 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-12-03 15:07:39,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:39,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:39,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:40,261 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:07:40,671 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:07:40,916 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 15:07:41,376 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 15:07:41,568 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 15:07:41,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:41,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:41,568 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-03 15:07:41,569 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 15:07:41,575 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:41,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:41,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:41,997 INFO L272 AbstractInterpreter]: Visited 33 different actions 198 times. Merged at 32 different actions 121 times. Never widened. Found 36 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 15:07:42,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:42,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:42,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:42,037 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 15:07:42,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:42,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:42,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:43,016 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-03 15:07:43,158 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 15:07:43,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:43,940 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 15:07:43,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:43,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2018-12-03 15:07:43,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:43,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:07:43,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:07:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:07:43,963 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand 14 states. [2018-12-03 15:07:45,086 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 15:07:45,266 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-03 15:07:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:46,122 INFO L93 Difference]: Finished difference Result 2059 states and 2865 transitions. [2018-12-03 15:07:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:07:46,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-12-03 15:07:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:46,135 INFO L225 Difference]: With dead ends: 2059 [2018-12-03 15:07:46,135 INFO L226 Difference]: Without dead ends: 2058 [2018-12-03 15:07:46,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:07:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-12-03 15:07:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1023. [2018-12-03 15:07:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-12-03 15:07:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1478 transitions. [2018-12-03 15:07:46,196 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1478 transitions. Word has length 59 [2018-12-03 15:07:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:46,196 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1478 transitions. [2018-12-03 15:07:46,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:07:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1478 transitions. [2018-12-03 15:07:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:07:46,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:46,200 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 15:07:46,200 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:46,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1560627404, now seen corresponding path program 1 times [2018-12-03 15:07:46,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:46,260 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 15:07:46,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:46,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:46,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:46,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:46,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:46,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:46,261 INFO L87 Difference]: Start difference. First operand 1023 states and 1478 transitions. Second operand 3 states. [2018-12-03 15:07:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:46,448 INFO L93 Difference]: Finished difference Result 1883 states and 2699 transitions. [2018-12-03 15:07:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:46,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-03 15:07:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:46,453 INFO L225 Difference]: With dead ends: 1883 [2018-12-03 15:07:46,453 INFO L226 Difference]: Without dead ends: 744 [2018-12-03 15:07:46,455 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 15:07:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-12-03 15:07:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 743. [2018-12-03 15:07:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-12-03 15:07:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1010 transitions. [2018-12-03 15:07:46,492 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1010 transitions. Word has length 80 [2018-12-03 15:07:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:46,492 INFO L480 AbstractCegarLoop]: Abstraction has 743 states and 1010 transitions. [2018-12-03 15:07:46,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1010 transitions. [2018-12-03 15:07:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:07:46,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:46,495 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 15:07:46,495 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:46,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-12-03 15:07:46,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:46,659 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 15:07:46,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:46,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:46,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:46,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:46,661 INFO L87 Difference]: Start difference. First operand 743 states and 1010 transitions. Second operand 4 states. [2018-12-03 15:07:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:46,869 INFO L93 Difference]: Finished difference Result 1509 states and 2043 transitions. [2018-12-03 15:07:46,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:46,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 15:07:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:46,872 INFO L225 Difference]: With dead ends: 1509 [2018-12-03 15:07:46,873 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 15:07:46,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 15:07:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 742. [2018-12-03 15:07:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-12-03 15:07:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 967 transitions. [2018-12-03 15:07:46,908 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 967 transitions. Word has length 81 [2018-12-03 15:07:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:46,908 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 967 transitions. [2018-12-03 15:07:46,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 967 transitions. [2018-12-03 15:07:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:07:46,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:46,910 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 15:07:46,911 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:46,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1878047832, now seen corresponding path program 1 times [2018-12-03 15:07:46,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:47,000 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 15:07:47,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:47,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:47,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:47,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:47,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:47,003 INFO L87 Difference]: Start difference. First operand 742 states and 967 transitions. Second operand 3 states. [2018-12-03 15:07:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:47,387 INFO L93 Difference]: Finished difference Result 1341 states and 1730 transitions. [2018-12-03 15:07:47,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:47,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-03 15:07:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:47,392 INFO L225 Difference]: With dead ends: 1341 [2018-12-03 15:07:47,393 INFO L226 Difference]: Without dead ends: 557 [2018-12-03 15:07:47,394 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 15:07:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-12-03 15:07:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 447. [2018-12-03 15:07:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-03 15:07:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 553 transitions. [2018-12-03 15:07:47,413 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 553 transitions. Word has length 98 [2018-12-03 15:07:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:47,413 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 553 transitions. [2018-12-03 15:07:47,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 553 transitions. [2018-12-03 15:07:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:07:47,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:47,415 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 15:07:47,416 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:47,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-12-03 15:07:47,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:47,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:47,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:47,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:47,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:47,920 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-12-03 15:07:48,088 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 15:07:48,386 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 15:07:48,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:48,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:48,387 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 15:07:48,387 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 15:07:48,390 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:48,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:48,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:48,608 INFO L272 AbstractInterpreter]: Visited 38 different actions 184 times. Merged at 34 different actions 95 times. Never widened. Found 39 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 15:07:48,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:48,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:48,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:07:48,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:48,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:48,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:48,998 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:07:49,791 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 15:07:49,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:51,052 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 15:07:51,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:51,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 38 [2018-12-03 15:07:51,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:51,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:07:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:07:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:07:51,073 INFO L87 Difference]: Start difference. First operand 447 states and 553 transitions. Second operand 26 states. [2018-12-03 15:07:51,418 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-12-03 15:07:52,157 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-12-03 15:07:52,457 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-12-03 15:07:52,755 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-12-03 15:07:53,038 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-12-03 15:07:53,338 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-12-03 15:07:53,633 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-12-03 15:07:53,775 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2018-12-03 15:07:54,142 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2018-12-03 15:07:54,425 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-12-03 15:07:54,716 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-12-03 15:07:55,005 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-12-03 15:07:55,288 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 15:07:55,716 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-12-03 15:07:56,437 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-03 15:07:56,712 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-03 15:07:56,955 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-12-03 15:07:57,237 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-12-03 15:07:57,881 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-12-03 15:07:58,165 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-03 15:07:58,326 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 15:07:58,692 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2018-12-03 15:07:58,860 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-03 15:07:59,038 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-12-03 15:07:59,955 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2018-12-03 15:08:00,431 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-12-03 15:08:00,958 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-12-03 15:08:01,187 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-12-03 15:08:01,354 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-12-03 15:08:01,629 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-12-03 15:08:01,801 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 15:08:02,085 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-12-03 15:08:02,311 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-12-03 15:08:02,540 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-12-03 15:08:03,012 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-12-03 15:08:03,185 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-12-03 15:08:03,564 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2018-12-03 15:08:03,749 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-12-03 15:08:04,541 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2018-12-03 15:08:04,951 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-12-03 15:08:05,265 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-12-03 15:08:05,499 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-03 15:08:05,801 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-12-03 15:08:05,975 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-12-03 15:08:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:06,082 INFO L93 Difference]: Finished difference Result 4114 states and 4990 transitions. [2018-12-03 15:08:06,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:08:06,082 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-12-03 15:08:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:06,097 INFO L225 Difference]: With dead ends: 4114 [2018-12-03 15:08:06,097 INFO L226 Difference]: Without dead ends: 4113 [2018-12-03 15:08:06,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3909 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=3042, Invalid=11964, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 15:08:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-12-03 15:08:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 702. [2018-12-03 15:08:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-12-03 15:08:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 894 transitions. [2018-12-03 15:08:06,172 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 894 transitions. Word has length 99 [2018-12-03 15:08:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:06,173 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 894 transitions. [2018-12-03 15:08:06,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:08:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 894 transitions. [2018-12-03 15:08:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:08:06,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:06,175 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 15:08:06,175 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:06,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash -667579402, now seen corresponding path program 1 times [2018-12-03 15:08:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:06,420 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 15:08:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:06,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 15:08:06,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:06,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:06,423 INFO L87 Difference]: Start difference. First operand 702 states and 894 transitions. Second operand 5 states. [2018-12-03 15:08:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:06,833 INFO L93 Difference]: Finished difference Result 1523 states and 1947 transitions. [2018-12-03 15:08:06,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:08:06,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 15:08:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:06,837 INFO L225 Difference]: With dead ends: 1523 [2018-12-03 15:08:06,837 INFO L226 Difference]: Without dead ends: 822 [2018-12-03 15:08:06,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-12-03 15:08:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 637. [2018-12-03 15:08:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-12-03 15:08:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 819 transitions. [2018-12-03 15:08:06,879 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 819 transitions. Word has length 104 [2018-12-03 15:08:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:06,879 INFO L480 AbstractCegarLoop]: Abstraction has 637 states and 819 transitions. [2018-12-03 15:08:06,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:08:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 819 transitions. [2018-12-03 15:08:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:08:06,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:06,882 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 15:08:06,882 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:06,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-12-03 15:08:06,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:06,958 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 15:08:06,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:06,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:08:06,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:06,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:08:06,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:08:06,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:06,961 INFO L87 Difference]: Start difference. First operand 637 states and 819 transitions. Second operand 3 states. [2018-12-03 15:08:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:07,286 INFO L93 Difference]: Finished difference Result 1022 states and 1299 transitions. [2018-12-03 15:08:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:07,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-03 15:08:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:07,287 INFO L225 Difference]: With dead ends: 1022 [2018-12-03 15:08:07,287 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:08:07,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:08:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:08:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:08:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:08:07,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-12-03 15:08:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:07,292 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:08:07,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:08:07,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:08:07,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:08:07,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:07,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:07,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:07,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:08,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:09,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:09,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:09,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:09,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:09,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:10,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:10,243 WARN L180 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 467 DAG size of output: 412 [2018-12-03 15:08:18,677 WARN L180 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 402 DAG size of output: 149 [2018-12-03 15:08:18,681 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-12-03 15:08:18,682 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-12-03 15:08:18,683 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-12-03 15:08:18,683 INFO L444 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse13 (<= Elevator_current Elevator_max)) (.cse41 (+ Elevator_current 1))) (let ((.cse21 (and .cse13 (< Elevator_min .cse41) (<= Elevator_qDC1 1))) (.cse23 (= Elevator_qCSP 1)) (.cse3 (<= Elevator_min Elevator_current)) (.cse39 (+ |Elevator_current'| 1)) (.cse4 (<= Elevator_min |Elevator_current'|)) (.cse40 (+ Elevator_min 1)) (.cse42 (+ Elevator_dir Elevator_goal)) (.cse26 (= |Elevator_dir'| 1)) (.cse31 (+ |Elevator_dir'| 1))) (let ((.cse12 (or (= .cse31 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse15 (or .cse26 (<= |Elevator_goal'| |Elevator_current'|))) (.cse10 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse0 (or (<= Elevator_current .cse42) (= (+ Elevator_dir 1) 0))) (.cse8 (or (<= .cse42 Elevator_current) (= Elevator_dir 1))) (.cse18 (not (= .cse42 Elevator_current))) (.cse19 (not Elevator_newgoal)) (.cse29 (<= .cse40 |Elevator_current'|)) (.cse30 (and (<= .cse39 Elevator_max) .cse4)) (.cse22 (= Elevator_qDC2 3)) (.cse25 (<= Elevator_c2 Elevator_c3)) (.cse28 (or (and .cse13 (<= .cse40 Elevator_current)) (and (<= .cse41 Elevator_max) .cse3))) (.cse34 (<= 1 Elevator_dir)) (.cse32 (= Elevator_current Elevator_goal)) (.cse33 (<= (+ Elevator_dir Elevator_current 2) Elevator_max)) (.cse20 (= Elevator_qDC2 1)) (.cse24 (and .cse21 .cse23)) (.cse9 (not Elevator_passed)) (.cse14 (= Elevator_qDC1 2)) (.cse11 (not Elevator_stop)) (.cse2 (not (= Elevator_goal Elevator_current))) (.cse37 (or (<= .cse39 |Elevator_goal'|) (<= (+ |Elevator_goal'| 1) |Elevator_current'|))) (.cse1 (<= |Elevator_current'| Elevator_max)) (.cse38 (not (= Elevator_qCSP 3))) (.cse16 (= Elevator_qDC2 2)) (.cse5 (<= |Elevator_goal'| Elevator_max)) (.cse17 (<= Elevator_min |Elevator_goal'|)) (.cse6 (<= Elevator_goal Elevator_max)) (.cse7 (<= Elevator_min Elevator_goal))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (and .cse1 .cse2 .cse3 .cse13 .cse20 .cse4 .cse9 .cse10) (and .cse2 .cse20 .cse21 .cse10) (and .cse2 .cse22 .cse21 .cse10) (and .cse11 .cse1 .cse3 .cse13 .cse14 .cse4 .cse22 .cse23 .cse9) (and (and .cse1 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse16 .cse21) .cse10 .cse11 .cse12 .cse15 .cse17 .cse18) .cse19) (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse22 .cse9 .cse10) (and (and .cse11 .cse14 (and .cse1 .cse3 .cse13 .cse16 .cse4 .cse23 .cse9) .cse5 .cse17 .cse6 .cse7) .cse19) (and .cse11 .cse24 .cse22) (and (and .cse25 (and (and .cse1 .cse3 .cse13 .cse14 .cse20 .cse4 .cse23 .cse9) .cse5 .cse17 .cse6 .cse7)) .cse19) (and (and .cse11 .cse5 (and .cse16 .cse24) .cse17 .cse6 .cse7) .cse19) (and (let ((.cse27 (+ |Elevator_goal'| |Elevator_dir'|))) (and (or .cse26 (<= .cse27 |Elevator_current'|)) .cse0 (and .cse16 .cse28) (not (= .cse27 |Elevator_current'|)) .cse5 (or (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (or .cse29 .cse30) .cse6 .cse7 .cse8 .cse11 (or (= 0 .cse31) (<= |Elevator_current'| .cse27)) .cse14 .cse17 .cse18 (or .cse32 .cse33 .cse34))) .cse19) (and .cse19 (and .cse25 (< Elevator_c2 2.0) (and (or (and .cse11 .cse1 .cse3 .cse13 .cse14 .cse4 .cse22 .cse9) (and .cse11 (and .cse28 (or (and .cse1 .cse29) .cse30)) .cse14 .cse22)) .cse5 .cse17 .cse6 .cse7))) (and .cse25 (let ((.cse35 (and .cse20 .cse24))) (or (and .cse35 .cse28 (let ((.cse36 (+ Elevator_dir Elevator_current))) (or (and (<= .cse36 Elevator_max) .cse34) .cse32 (and (<= Elevator_min .cse36) .cse33))) .cse6 .cse7) (and .cse35 .cse5 .cse17 .cse6 .cse7)))) (and .cse1 .cse2 .cse3 .cse37 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse38 .cse13 .cse14 .cse16 .cse17) (and .cse11 .cse2 .cse37 (and .cse1 (and (and .cse38 .cse21) .cse16) .cse4 .cse5 .cse17 .cse6 .cse7)))))) [2018-12-03 15:08:18,683 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-12-03 15:08:18,683 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-12-03 15:08:18,683 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-12-03 15:08:18,684 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-12-03 15:08:18,685 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-12-03 15:08:18,685 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-12-03 15:08:18,685 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-12-03 15:08:18,685 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-12-03 15:08:18,685 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-12-03 15:08:18,703 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:08:18 BoogieIcfgContainer [2018-12-03 15:08:18,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:08:18,705 INFO L168 Benchmark]: Toolchain (without parser) took 45415.89 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:08:18,706 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:18,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:18,707 INFO L168 Benchmark]: Boogie Preprocessor took 50.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:18,707 INFO L168 Benchmark]: RCFGBuilder took 770.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:18,708 INFO L168 Benchmark]: TraceAbstraction took 44548.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:08:18,711 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 770.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44548.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.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 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((current <= dir + goal || dir + 1 == 0) && current' <= max) && !(goal == current)) && min <= current) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !passed) && !(current' == goal')) && !stop) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && qDC1 == 2) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && !newgoal) || (((((((current' <= max && !(goal == current)) && min <= current) && current <= max) && qDC2 == 1) && min <= current') && !passed) && !(current' == goal'))) || (((!(goal == current) && qDC2 == 1) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || (((!(goal == current) && qDC2 == 3) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || ((((((((!stop && current' <= max) && min <= current) && current <= max) && qDC1 == 2) && min <= current') && qDC2 == 3) && qCSP == 1) && !passed)) || (((((((((((((((current' <= max && (current <= dir + goal || dir + 1 == 0)) && !(goal == current)) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && qDC2 == 2 && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal')) && !stop) && (dir' + 1 == 0 || current' <= goal')) && (dir' == 1 || goal' <= current')) && min <= goal') && !(dir + goal == current)) && !newgoal)) || (((((((current' <= max && !(goal == current)) && min <= current) && current <= max) && min <= current') && qDC2 == 3) && !passed) && !(current' == goal'))) || (((((((!stop && qDC1 == 2) && (((((current' <= max && min <= current) && current <= max) && qDC2 == 2) && min <= current') && qCSP == 1) && !passed) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || ((!stop && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && qDC2 == 3)) || ((c2 <= c3 && ((((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 1) && min <= current') && qCSP == 1) && !passed) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || ((((((!stop && goal' <= max) && qDC2 == 2 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || (((((((((((((((((dir' == 1 || goal' + dir' <= current') && (current <= dir + goal || dir + 1 == 0)) && qDC2 == 2 && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && !(goal' + dir' == current')) && goal' <= max) && (1 <= dir' || current' + dir' + 2 <= max)) && (min + 1 <= current' || (current' + 1 <= max && min <= current'))) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !stop) && (0 == dir' + 1 || current' <= goal' + dir')) && qDC1 == 2) && min <= goal') && !(dir + goal == current)) && ((current == goal || dir + current + 2 <= max) || 1 <= dir)) && !newgoal)) || (!newgoal && (c2 <= c3 && c2 < 2.0) && (((((((((((!stop && current' <= max) && min <= current) && current <= max) && qDC1 == 2) && min <= current') && qDC2 == 3) && !passed) || (((!stop && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && qDC1 == 2) && qDC2 == 3)) && goal' <= max) && min <= goal') && goal <= max) && min <= goal)) || (c2 <= c3 && ((((((qDC2 == 1 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (((dir + current <= max && 1 <= dir) || current == goal) || (min <= dir + current && dir + current + 2 <= max))) && goal <= max) && min <= goal) || (((((qDC2 == 1 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal' <= max) && min <= goal') && goal <= max) && min <= goal)))) || ((((((((((((((current' <= max && !(goal == current)) && min <= current) && (current' + 1 <= goal' || goal' + 1 <= current')) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && !passed) && !stop) && !(qCSP == 3)) && current <= max) && qDC1 == 2) && qDC2 == 2) && min <= goal')) || (((!stop && !(goal == current)) && (current' + 1 <= goal' || goal' + 1 <= current')) && (((((current' <= max && (!(qCSP == 3) && (current <= max && min < current + 1) && qDC1 <= 1) && qDC2 == 2) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 44.4s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 11.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1373 SDtfs, 3033 SDslu, 5040 SDs, 0 SdLazy, 1583 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4104 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 5081 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 40 NumberOfFragments, 901 HoareAnnotationTreeSize, 1 FomulaSimplifications, 106912 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 1 FomulaSimplificationsInter, 361763 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051840 SizeOfPredicates, 57 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 1482/1999 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...