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-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:32,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:32,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:32,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:32,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:32,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:32,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:32,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:32,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:32,947 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:32,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:32,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:32,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:32,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:32,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:32,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:32,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:32,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:32,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:32,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:32,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:32,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:32,963 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:32,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:32,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:32,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:32,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:32,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:32,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:32,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:32,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:32,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:32,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:32,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:32,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:32,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:32,972 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:32,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:32,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:32,986 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:32,986 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:32,987 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:32,987 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:32,987 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:32,987 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:32,988 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:32,988 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:32,988 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:32,988 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:32,988 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:32,989 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:32,989 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:32,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:32,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:32,990 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:32,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:32,990 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:32,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:32,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:32,992 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:32,992 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:32,992 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:32,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:32,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:32,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:32,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:32,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:32,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:32,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:32,994 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:32,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:32,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:32,995 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:32,995 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:33,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:33,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:33,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:33,068 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:33,068 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:33,069 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-12-03 15:07:33,069 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-12-03 15:07:33,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:33,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:33,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:33,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:33,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,185 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:33,186 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:33,186 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:33,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:33,190 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:33,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:33,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:33,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:33,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.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,296 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 15:07:33,296 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 15:07:33,296 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 15:07:34,005 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:34,005 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:07:34,006 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:34 BoogieIcfgContainer [2018-12-03 15:07:34,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:34,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:34,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:34,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:34,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/2) ... [2018-12-03 15:07:34,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1170f and model type Elevator-Integer.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,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:34" (2/2) ... [2018-12-03 15:07:34,014 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-12-03 15:07:34,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:34,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:07:34,053 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:07:34,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:34,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:34,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:34,090 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:34,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:34,090 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:34,090 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:34,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-03 15:07:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:34,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-12-03 15:07:34,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,301 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,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:34,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,325 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-12-03 15:07:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,465 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-12-03 15:07:34,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:34,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 15:07:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,481 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:07:34,481 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:07:34,485 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,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:07:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-03 15:07:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:07:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-12-03 15:07:34,532 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-12-03 15:07:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,533 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-12-03 15:07:34,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-12-03 15:07:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:34,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-12-03 15:07:34,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,573 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,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:34,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,577 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-12-03 15:07:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,803 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-12-03 15:07:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:34,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 15:07:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,806 INFO L225 Difference]: With dead ends: 154 [2018-12-03 15:07:34,806 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:07:34,808 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,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:07:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-03 15:07:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:07:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-12-03 15:07:34,823 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-12-03 15:07:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,823 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-12-03 15:07:34,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-12-03 15:07:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:34,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,825 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:34,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-12-03 15:07:34,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,897 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,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:34,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,899 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-12-03 15:07:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,281 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-12-03 15:07:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:35,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 15:07:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,284 INFO L225 Difference]: With dead ends: 233 [2018-12-03 15:07:35,285 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:07:35,286 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,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:07:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-12-03 15:07:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:07:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-12-03 15:07:35,302 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-12-03 15:07:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,303 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-12-03 15:07:35,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-12-03 15:07:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:07:35,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:35,306 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:35,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,307 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-12-03 15:07:35,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,386 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:35,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:35,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:35,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:35,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:35,388 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-12-03 15:07:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,616 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-12-03 15:07:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:07:35,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 15:07:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,619 INFO L225 Difference]: With dead ends: 144 [2018-12-03 15:07:35,619 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 15:07:35,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 15:07:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-12-03 15:07:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 15:07:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-12-03 15:07:35,640 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-12-03 15:07:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,641 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-12-03 15:07:35,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-12-03 15:07:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:07:35,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:35,646 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:35,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-12-03 15:07:35,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,762 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:35,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:35,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:07:35,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:07:35,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,765 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-12-03 15:07:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,989 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-12-03 15:07:35,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:07:35,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-03 15:07:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,993 INFO L225 Difference]: With dead ends: 459 [2018-12-03 15:07:35,993 INFO L226 Difference]: Without dead ends: 286 [2018-12-03 15:07:35,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-03 15:07:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-12-03 15:07:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-03 15:07:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-12-03 15:07:36,019 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-12-03 15:07:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,020 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-12-03 15:07:36,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:07:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-12-03 15:07:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:07:36,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,022 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:36,023 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:36,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-12-03 15:07:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:07:36,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:36,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:36,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:36,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:36,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:36,084 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-12-03 15:07:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,192 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-12-03 15:07:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-03 15:07:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,197 INFO L225 Difference]: With dead ends: 695 [2018-12-03 15:07:36,197 INFO L226 Difference]: Without dead ends: 402 [2018-12-03 15:07:36,198 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,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-03 15:07:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-12-03 15:07:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 15:07:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-12-03 15:07:36,229 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-12-03 15:07:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,230 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-12-03 15:07:36,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-12-03 15:07:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:07:36,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,235 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:36,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:36,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-12-03 15:07:36,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:07:36,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:36,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:36,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:36,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:36,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:36,291 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-12-03 15:07:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,395 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-12-03 15:07:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 15:07:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,402 INFO L225 Difference]: With dead ends: 711 [2018-12-03 15:07:36,402 INFO L226 Difference]: Without dead ends: 414 [2018-12-03 15:07:36,403 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,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-03 15:07:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-12-03 15:07:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 15:07:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-12-03 15:07:36,419 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-12-03 15:07:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,420 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-12-03 15:07:36,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-12-03 15:07:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:07:36,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,422 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:36,423 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:36,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-12-03 15:07:36,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 15:07:36,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:36,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:36,586 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 15:07:36,589 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [15], [21], [24], [26], [31], [34], [36], [41], [44], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [102], [131], [132] [2018-12-03 15:07:36,637 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:36,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:37,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:37,329 INFO L272 AbstractInterpreter]: Visited 25 different actions 107 times. Merged at 24 different actions 64 times. Never widened. Found 16 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 15:07:37,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:37,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:37,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:37,380 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,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:37,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:37,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 15:07:37,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 15:07:37,526 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:07:37,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-12-03 15:07:37,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:37,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:37,528 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 3 states. [2018-12-03 15:07:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:37,671 INFO L93 Difference]: Finished difference Result 722 states and 1121 transitions. [2018-12-03 15:07:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:37,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 15:07:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:37,676 INFO L225 Difference]: With dead ends: 722 [2018-12-03 15:07:37,676 INFO L226 Difference]: Without dead ends: 417 [2018-12-03 15:07:37,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-03 15:07:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 372. [2018-12-03 15:07:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 15:07:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 571 transitions. [2018-12-03 15:07:37,693 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 571 transitions. Word has length 43 [2018-12-03 15:07:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:37,693 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 571 transitions. [2018-12-03 15:07:37,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 571 transitions. [2018-12-03 15:07:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:07:37,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:37,695 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:37,696 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:37,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash 739115210, now seen corresponding path program 1 times [2018-12-03 15:07:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:37,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 15:07:37,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:37,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:37,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:37,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:37,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:37,774 INFO L87 Difference]: Start difference. First operand 372 states and 571 transitions. Second operand 3 states. [2018-12-03 15:07:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:38,101 INFO L93 Difference]: Finished difference Result 954 states and 1476 transitions. [2018-12-03 15:07:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:38,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 15:07:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:38,108 INFO L225 Difference]: With dead ends: 954 [2018-12-03 15:07:38,108 INFO L226 Difference]: Without dead ends: 561 [2018-12-03 15:07:38,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-03 15:07:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2018-12-03 15:07:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-12-03 15:07:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 856 transitions. [2018-12-03 15:07:38,131 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 856 transitions. Word has length 44 [2018-12-03 15:07:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:38,131 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 856 transitions. [2018-12-03 15:07:38,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 856 transitions. [2018-12-03 15:07:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:07:38,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:38,140 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:38,140 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:38,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2125318604, now seen corresponding path program 1 times [2018-12-03 15:07:38,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:07:38,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:38,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:38,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:38,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:38,253 INFO L87 Difference]: Start difference. First operand 560 states and 856 transitions. Second operand 3 states. [2018-12-03 15:07:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:38,505 INFO L93 Difference]: Finished difference Result 1120 states and 1711 transitions. [2018-12-03 15:07:38,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:38,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 15:07:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:38,512 INFO L225 Difference]: With dead ends: 1120 [2018-12-03 15:07:38,512 INFO L226 Difference]: Without dead ends: 561 [2018-12-03 15:07:38,513 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:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-03 15:07:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2018-12-03 15:07:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-12-03 15:07:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 812 transitions. [2018-12-03 15:07:38,540 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 812 transitions. Word has length 44 [2018-12-03 15:07:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:38,541 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 812 transitions. [2018-12-03 15:07:38,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 812 transitions. [2018-12-03 15:07:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:07:38,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:38,542 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:38,542 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:38,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-12-03 15:07:38,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:38,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:38,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:39,295 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 15:07:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:39,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:39,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:39,312 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-03 15:07:39,313 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [15], [21], [24], [26], [31], [34], [36], [41], [44], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [104], [107], [109], [112], [131], [132] [2018-12-03 15:07:39,316 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:39,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:39,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:39,599 INFO L272 AbstractInterpreter]: Visited 28 different actions 109 times. Merged at 25 different actions 61 times. Never widened. Found 15 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 15:07:39,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:39,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:39,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:39,639 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:39,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:39,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:39,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:40,568 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-03 15:07:40,752 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:07:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:40,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:41,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:41,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2018-12-03 15:07:41,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:41,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:07:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:07:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:07:41,282 INFO L87 Difference]: Start difference. First operand 560 states and 812 transitions. Second operand 16 states. [2018-12-03 15:07:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:43,898 INFO L93 Difference]: Finished difference Result 2776 states and 3934 transitions. [2018-12-03 15:07:43,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:07:43,898 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-12-03 15:07:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:43,911 INFO L225 Difference]: With dead ends: 2776 [2018-12-03 15:07:43,912 INFO L226 Difference]: Without dead ends: 2157 [2018-12-03 15:07:43,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=333, Invalid=999, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:07:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2018-12-03 15:07:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1098. [2018-12-03 15:07:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-12-03 15:07:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1628 transitions. [2018-12-03 15:07:43,973 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1628 transitions. Word has length 48 [2018-12-03 15:07:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:43,974 INFO L480 AbstractCegarLoop]: Abstraction has 1098 states and 1628 transitions. [2018-12-03 15:07:43,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:07:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1628 transitions. [2018-12-03 15:07:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:07:43,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:43,976 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:43,976 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:43,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-12-03 15:07:43,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:43,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:43,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:43,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:43,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 15:07:44,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:44,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:44,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:44,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:44,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:44,056 INFO L87 Difference]: Start difference. First operand 1098 states and 1628 transitions. Second operand 4 states. [2018-12-03 15:07:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:44,237 INFO L93 Difference]: Finished difference Result 2196 states and 3255 transitions. [2018-12-03 15:07:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:44,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 15:07:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:44,244 INFO L225 Difference]: With dead ends: 2196 [2018-12-03 15:07:44,244 INFO L226 Difference]: Without dead ends: 1099 [2018-12-03 15:07:44,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-12-03 15:07:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1095. [2018-12-03 15:07:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-12-03 15:07:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1559 transitions. [2018-12-03 15:07:44,300 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1559 transitions. Word has length 67 [2018-12-03 15:07:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:44,301 INFO L480 AbstractCegarLoop]: Abstraction has 1095 states and 1559 transitions. [2018-12-03 15:07:44,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1559 transitions. [2018-12-03 15:07:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:07:44,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:44,303 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:44,303 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:44,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-12-03 15:07:44,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 15:07:44,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:44,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:44,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:44,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:44,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:44,398 INFO L87 Difference]: Start difference. First operand 1095 states and 1559 transitions. Second operand 3 states. [2018-12-03 15:07:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:44,849 INFO L93 Difference]: Finished difference Result 2199 states and 3123 transitions. [2018-12-03 15:07:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:44,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-03 15:07:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:44,855 INFO L225 Difference]: With dead ends: 2199 [2018-12-03 15:07:44,855 INFO L226 Difference]: Without dead ends: 1015 [2018-12-03 15:07:44,857 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:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-03 15:07:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 993. [2018-12-03 15:07:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-12-03 15:07:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1361 transitions. [2018-12-03 15:07:44,905 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1361 transitions. Word has length 68 [2018-12-03 15:07:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:44,906 INFO L480 AbstractCegarLoop]: Abstraction has 993 states and 1361 transitions. [2018-12-03 15:07:44,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1361 transitions. [2018-12-03 15:07:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:07:44,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:44,909 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:44,909 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:44,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-12-03 15:07:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:45,342 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-12-03 15:07:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:07:46,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:46,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:46,160 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-12-03 15:07:46,160 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [15], [21], [24], [26], [31], [34], [36], [39], [41], [44], [55], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [88], [93], [96], [104], [107], [109], [112], [131], [132] [2018-12-03 15:07:46,163 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:46,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:46,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:46,422 INFO L272 AbstractInterpreter]: Visited 34 different actions 193 times. Merged at 32 different actions 105 times. Never widened. Found 37 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 15:07:46,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:46,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:46,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:46,450 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:46,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:46,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:46,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:07:47,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:47,976 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2018-12-03 15:07:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 5 proven. 122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:07:48,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:48,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 38 [2018-12-03 15:07:48,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:48,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:07:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:07:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:07:48,171 INFO L87 Difference]: Start difference. First operand 993 states and 1361 transitions. Second operand 27 states. [2018-12-03 15:07:49,069 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2018-12-03 15:07:49,565 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-03 15:07:50,086 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2018-12-03 15:07:50,434 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-12-03 15:07:51,296 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-03 15:07:51,716 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2018-12-03 15:07:51,965 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-12-03 15:07:52,203 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-03 15:07:52,555 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2018-12-03 15:07:52,898 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 75 [2018-12-03 15:07:53,603 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-03 15:07:54,019 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-12-03 15:07:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:54,560 INFO L93 Difference]: Finished difference Result 3800 states and 4985 transitions. [2018-12-03 15:07:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:07:54,560 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-12-03 15:07:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:54,570 INFO L225 Difference]: With dead ends: 3800 [2018-12-03 15:07:54,570 INFO L226 Difference]: Without dead ends: 2766 [2018-12-03 15:07:54,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1130, Invalid=4420, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:07:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2018-12-03 15:07:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 1076. [2018-12-03 15:07:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-12-03 15:07:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1481 transitions. [2018-12-03 15:07:54,652 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1481 transitions. Word has length 84 [2018-12-03 15:07:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:54,652 INFO L480 AbstractCegarLoop]: Abstraction has 1076 states and 1481 transitions. [2018-12-03 15:07:54,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:07:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1481 transitions. [2018-12-03 15:07:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 15:07:54,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:54,655 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:54,655 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:54,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-12-03 15:07:54,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:54,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:54,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:54,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:54,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:07:54,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:54,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:54,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:54,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:54,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:54,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:54,765 INFO L87 Difference]: Start difference. First operand 1076 states and 1481 transitions. Second operand 3 states. [2018-12-03 15:07:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:55,051 INFO L93 Difference]: Finished difference Result 2152 states and 2961 transitions. [2018-12-03 15:07:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:55,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-03 15:07:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:55,056 INFO L225 Difference]: With dead ends: 2152 [2018-12-03 15:07:55,057 INFO L226 Difference]: Without dead ends: 1077 [2018-12-03 15:07:55,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-12-03 15:07:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1021. [2018-12-03 15:07:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2018-12-03 15:07:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1374 transitions. [2018-12-03 15:07:55,121 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1374 transitions. Word has length 85 [2018-12-03 15:07:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:55,122 INFO L480 AbstractCegarLoop]: Abstraction has 1021 states and 1374 transitions. [2018-12-03 15:07:55,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1374 transitions. [2018-12-03 15:07:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:07:55,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:55,125 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:55,125 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:55,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1131673137, now seen corresponding path program 1 times [2018-12-03 15:07:55,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:55,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:55,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-03 15:07:55,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:55,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:55,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:55,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:55,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:55,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:55,211 INFO L87 Difference]: Start difference. First operand 1021 states and 1374 transitions. Second operand 3 states. [2018-12-03 15:07:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:55,298 INFO L93 Difference]: Finished difference Result 1686 states and 2257 transitions. [2018-12-03 15:07:55,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:55,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-03 15:07:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:55,303 INFO L225 Difference]: With dead ends: 1686 [2018-12-03 15:07:55,303 INFO L226 Difference]: Without dead ends: 641 [2018-12-03 15:07:55,304 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:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-12-03 15:07:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 555. [2018-12-03 15:07:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-03 15:07:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 720 transitions. [2018-12-03 15:07:55,338 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 720 transitions. Word has length 86 [2018-12-03 15:07:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:55,339 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 720 transitions. [2018-12-03 15:07:55,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 720 transitions. [2018-12-03 15:07:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:07:55,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:55,341 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:55,341 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:55,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-12-03 15:07:55,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:55,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:55,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 15:07:55,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:55,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:55,454 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-12-03 15:07:55,454 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [13], [15], [21], [24], [26], [31], [34], [36], [39], [41], [44], [55], [57], [60], [62], [65], [67], [72], [75], [81], [83], [86], [88], [93], [96], [104], [107], [109], [112], [114], [117], [119], [122], [131], [132] [2018-12-03 15:07:55,456 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:55,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:55,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:55,712 INFO L272 AbstractInterpreter]: Visited 39 different actions 221 times. Merged at 36 different actions 114 times. Never widened. Found 49 fixpoints after 20 different actions. Largest state had 0 variables. [2018-12-03 15:07:55,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:55,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:55,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:55,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:07:55,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:55,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:55,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 15:07:55,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 15:07:56,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:56,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:07:56,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:56,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:07:56,043 INFO L87 Difference]: Start difference. First operand 555 states and 720 transitions. Second operand 7 states. [2018-12-03 15:07:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:56,257 INFO L93 Difference]: Finished difference Result 1399 states and 1807 transitions. [2018-12-03 15:07:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:07:56,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 15:07:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:56,260 INFO L225 Difference]: With dead ends: 1399 [2018-12-03 15:07:56,261 INFO L226 Difference]: Without dead ends: 728 [2018-12-03 15:07:56,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:07:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-03 15:07:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 325. [2018-12-03 15:07:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 15:07:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 411 transitions. [2018-12-03 15:07:56,286 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 411 transitions. Word has length 89 [2018-12-03 15:07:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:56,287 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 411 transitions. [2018-12-03 15:07:56,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 411 transitions. [2018-12-03 15:07:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:07:56,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:56,288 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:56,289 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:56,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-12-03 15:07:56,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:56,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:56,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-03 15:07:56,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:56,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:56,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:56,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:56,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:56,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:56,366 INFO L87 Difference]: Start difference. First operand 325 states and 411 transitions. Second operand 3 states. [2018-12-03 15:07:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:56,705 INFO L93 Difference]: Finished difference Result 568 states and 707 transitions. [2018-12-03 15:07:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:56,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-03 15:07:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:56,706 INFO L225 Difference]: With dead ends: 568 [2018-12-03 15:07:56,706 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:07:56,707 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:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:07:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:07:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:07:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:07:56,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-12-03 15:07:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:56,709 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:07:56,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:07:56,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:07:56,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:07:56,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:56,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:57,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:58,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:58,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:07:58,240 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 509 DAG size of output: 387 [2018-12-03 15:08:05,322 WARN L180 SmtUtils]: Spent 7.07 s on a formula simplification. DAG size of input: 361 DAG size of output: 109 [2018-12-03 15:08:05,325 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-12-03 15:08:05,326 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-12-03 15:08:05,327 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-12-03 15:08:05,327 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-12-03 15:08:05,327 INFO L448 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-12-03 15:08:05,327 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-12-03 15:08:05,327 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-12-03 15:08:05,327 INFO L448 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L444 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse27 (<= |Elevator_goal'| |Elevator_current'|)) (.cse28 (+ |Elevator_goal'| 1)) (.cse29 (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))) (.cse16 (<= Elevator_c2 Elevator_c3))) (let ((.cse19 (or (<= Elevator_c2 2) .cse16)) (.cse12 (not (= Elevator_qCSP 3))) (.cse24 (not (= Elevator_goal Elevator_current))) (.cse2 (<= Elevator_qDC2 2)) (.cse4 (<= 2 Elevator_qDC2)) (.cse9 (<= Elevator_qDC1 1)) (.cse10 (not Elevator_passed)) (.cse20 (<= |Elevator_current'| (+ |Elevator_dir'| Elevator_max))) (.cse21 (or (= (+ |Elevator_dir'| 1) 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse22 (or (<= .cse28 |Elevator_current'|) .cse29)) (.cse23 (or (= |Elevator_dir'| 1) .cse27)) (.cse0 (not Elevator_stop)) (.cse17 (= Elevator_qDC2 3)) (.cse11 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse1 (<= |Elevator_current'| Elevator_max)) (.cse3 (<= Elevator_min Elevator_current)) (.cse13 (<= Elevator_current Elevator_max)) (.cse15 (= Elevator_qDC1 2)) (.cse31 (<= Elevator_qDC2 1)) (.cse5 (<= Elevator_min |Elevator_current'|)) (.cse6 (<= |Elevator_goal'| Elevator_max)) (.cse14 (<= Elevator_min |Elevator_goal'|)) (.cse7 (<= Elevator_goal Elevator_max)) (.cse8 (<= Elevator_min Elevator_goal)) (.cse25 (= Elevator_qCSP 1)) (.cse18 (not Elevator_newgoal))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and (and .cse0 (and .cse1 .cse3 .cse13 .cse15 .cse5 .cse6 .cse14 .cse7 .cse8) .cse16 .cse17) .cse18) (and (and .cse0 .cse19 (or (and .cse3 .cse2 .cse4 .cse6 .cse7 .cse8 .cse11 .cse20 .cse21 .cse13 .cse22 .cse15 .cse23 .cse14) (and .cse21 (and .cse1 .cse24 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14) .cse15 .cse23))) .cse18) (and .cse16 (and .cse1 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse25 .cse0 .cse13 .cse15 .cse14)) (and .cse0 .cse19 (and .cse2 .cse15 .cse4 .cse6 .cse14 .cse7 .cse8 (and .cse1 .cse12 .cse3 .cse13 .cse5) .cse11)) (and .cse16 (let ((.cse26 (let ((.cse30 (and .cse25 (and .cse1 .cse31 .cse5 .cse9)))) (or (and .cse30 .cse6 (or (<= (+ Elevator_min 1) |Elevator_current'|) (<= (+ |Elevator_current'| 1) Elevator_max))) (and .cse3 .cse13 .cse30))))) (or (and .cse21 .cse23 .cse6 .cse26 .cse14 (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) .cse27) (= |Elevator_goal'| |Elevator_current'|) (and (< |Elevator_current'| .cse28) .cse29))) (and .cse13 .cse6 .cse26 .cse14 .cse7 .cse8)))) (and (and .cse0 (or (and .cse21 .cse23 (and .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) .cse11) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21 .cse13 .cse22 .cse23 .cse14))) .cse18) (and .cse0 .cse16 .cse17 (and .cse1 .cse3 .cse13 .cse15 .cse5 .cse6 .cse14 .cse7 .cse8 .cse11)) (and (and .cse1 .cse3 .cse13 .cse15 .cse31 .cse5 .cse6 .cse14 .cse7 .cse8 .cse25) .cse16 .cse18)))) [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-12-03 15:08:05,328 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-12-03 15:08:05,345 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:08:05 BoogieIcfgContainer [2018-12-03 15:08:05,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:08:05,346 INFO L168 Benchmark]: Toolchain (without parser) took 32201.49 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -412.9 MB). Peak memory consumption was 908.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:05,347 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:05,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:05,348 INFO L168 Benchmark]: Boogie Preprocessor took 32.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:05,348 INFO L168 Benchmark]: RCFGBuilder took 783.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:05,349 INFO L168 Benchmark]: TraceAbstraction took 31337.60 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -444.7 MB). Peak memory consumption was 877.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:05,353 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 783.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31337.60 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -444.7 MB). Peak memory consumption was 877.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((!stop && ((((((((((((current' <= max && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && !(current' == goal')) && !(qCSP == 3)) && current <= max) && min <= goal') || ((((!stop && (((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && c2 <= c3) && qDC2 == 3) && !newgoal)) || (((!stop && (c2 <= 2 || c2 <= c3)) && ((((((((((((((min <= current && qDC2 <= 2) && 2 <= qDC2) && goal' <= max) && goal <= max) && min <= goal) && !(current' == goal')) && current' <= dir' + max) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && (goal' + 1 <= current' || min + 2 <= current' + dir')) && qDC1 == 2) && (dir' == 1 || goal' <= current')) && min <= goal') || ((((dir' + 1 == 0 || current' <= goal') && ((((((((((current' <= max && !(goal == current)) && min <= current) && qDC2 <= 2) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && !(current' == goal')) && current <= max) && min <= goal') && qDC1 == 2) && (dir' == 1 || goal' <= current')))) && !newgoal)) || (c2 <= c3 && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && goal <= max) && qDC2 == 3) && min <= goal) && qCSP == 1) && !stop) && current <= max) && qDC1 == 2) && min <= goal')) || ((!stop && (c2 <= 2 || c2 <= c3)) && (((((((qDC2 <= 2 && qDC1 == 2) && 2 <= qDC2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && (((current' <= max && !(qCSP == 3)) && min <= current) && current <= max) && min <= current') && !(current' == goal'))) || (c2 <= c3 && (((((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && goal' <= max) && ((((qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= max) && (min + 1 <= current' || current' + 1 <= max)) || ((min <= current && current <= max) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) && min <= goal') && (((current' + dir' + 2 <= max && goal' <= current') || goal' == current') || (current' < goal' + 1 && min + 2 <= current' + dir'))) || (((((current <= max && goal' <= max) && ((((qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= max) && (min + 1 <= current' || current' + 1 <= max)) || ((min <= current && current <= max) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) && min <= goal') && goal <= max) && min <= goal)))) || ((!stop && (((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && (((((((((((current' <= max && !(goal == current)) && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && current <= max) && min <= goal') && !(current' == goal')) || ((((((((((((((qDC2 <= 2 && min <= current) && 2 <= qDC2) && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && !(current' == goal')) && current' <= dir' + max) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && (goal' + 1 <= current' || min + 2 <= current' + dir')) && (dir' == 1 || goal' <= current')) && min <= goal'))) && !newgoal)) || (((!stop && c2 <= c3) && qDC2 == 3) && ((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !(current' == goal'))) || ((((((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && qDC2 <= 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && qCSP == 1) && c2 <= c3) && !newgoal) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 31.2s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1085 SDtfs, 1873 SDslu, 2733 SDs, 0 SdLazy, 1981 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 661 GetRequests, 513 SyntacticMatches, 5 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 3608 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 722 HoareAnnotationTreeSize, 1 FomulaSimplifications, 313968 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 94514 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 749697 SizeOfPredicates, 42 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 1420/1815 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...