java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 15:09:07,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 15:09:07,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 15:09:07,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 15:09:07,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 15:09:07,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 15:09:07,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 15:09:07,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 15:09:07,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 15:09:07,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 15:09:07,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 15:09:07,985 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 15:09:07,986 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 15:09:07,987 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 15:09:07,988 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 15:09:07,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 15:09:07,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 15:09:07,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 15:09:07,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 15:09:07,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 15:09:07,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 15:09:07,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 15:09:08,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 15:09:08,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 15:09:08,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 15:09:08,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 15:09:08,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 15:09:08,004 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 15:09:08,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 15:09:08,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 15:09:08,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 15:09:08,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 15:09:08,007 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 15:09:08,007 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 15:09:08,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 15:09:08,009 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 15:09:08,009 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 15:09:08,022 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 15:09:08,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 15:09:08,023 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 15:09:08,023 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 15:09:08,023 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 15:09:08,023 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 15:09:08,023 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 15:09:08,024 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 15:09:08,024 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 15:09:08,024 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 15:09:08,024 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 15:09:08,024 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 15:09:08,025 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 15:09:08,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 15:09:08,026 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 15:09:08,026 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 15:09:08,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 15:09:08,026 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 15:09:08,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 15:09:08,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 15:09:08,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 15:09:08,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 15:09:08,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 15:09:08,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 15:09:08,028 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 15:09:08,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 15:09:08,028 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 15:09:08,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 15:09:08,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 15:09:08,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 15:09:08,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:09:08,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 15:09:08,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 15:09:08,029 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 15:09:08,030 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 15:09:08,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 15:09:08,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 15:09:08,030 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 15:09:08,030 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 15:09:08,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 15:09:08,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 15:09:08,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 15:09:08,097 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 15:09:08,097 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 15:09:08,098 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl [2019-01-31 15:09:08,098 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2019-01-31 15:09:08,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 15:09:08,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 15:09:08,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 15:09:08,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 15:09:08,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 15:09:08,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,166 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 15:09:08,166 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 15:09:08,166 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 15:09:08,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 15:09:08,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 15:09:08,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 15:09:08,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 15:09:08,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... [2019-01-31 15:09:08,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 15:09:08,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 15:09:08,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 15:09:08,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 15:09:08,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:09:08,260 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-31 15:09:08,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 15:09:08,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 15:09:08,512 INFO L278 CfgBuilder]: Using library mode [2019-01-31 15:09:08,512 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 15:09:08,514 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:09:08 BoogieIcfgContainer [2019-01-31 15:09:08,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 15:09:08,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 15:09:08,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 15:09:08,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 15:09:08,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:08" (1/2) ... [2019-01-31 15:09:08,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1817753f and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:09:08, skipping insertion in model container [2019-01-31 15:09:08,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:09:08" (2/2) ... [2019-01-31 15:09:08,522 INFO L112 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bpl [2019-01-31 15:09:08,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 15:09:08,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 15:09:08,556 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 15:09:08,588 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 15:09:08,588 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 15:09:08,589 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 15:09:08,589 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 15:09:08,589 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 15:09:08,589 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 15:09:08,589 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 15:09:08,590 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 15:09:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 15:09:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:09:08,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:09:08,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:09:08,614 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:09:08,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:09:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-31 15:09:08,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:09:08,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:08,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:09:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:08,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:09:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:08,894 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} assume end >= 0;a := a[end := 42];i := 0; {11#(<= i end)} is VALID [2019-01-31 15:09:08,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= i end)} assume !(a[i] != 42); {11#(<= i end)} is VALID [2019-01-31 15:09:08,904 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#(<= i end)} assume !(i <= end); {10#false} is VALID [2019-01-31 15:09:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:08,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:09:08,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 15:09:08,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:09:08,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:09:08,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:09:08,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:09:08,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:08,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:09:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:09:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:09:08,978 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 15:09:09,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:09,075 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 15:09:09,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:09:09,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:09:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:09:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:09:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-31 15:09:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:09:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-31 15:09:09,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-01-31 15:09:09,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:09,145 INFO L225 Difference]: With dead ends: 9 [2019-01-31 15:09:09,145 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 15:09:09,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:09:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 15:09:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 15:09:09,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:09:09,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 15:09:09,220 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 15:09:09,220 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 15:09:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:09,222 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 15:09:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:09:09,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:09,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:09,223 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 15:09:09,223 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 15:09:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:09,226 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 15:09:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:09:09,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:09,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:09,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:09:09,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:09:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 15:09:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 15:09:09,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 15:09:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:09:09,233 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 15:09:09,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:09:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:09:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:09:09,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:09:09,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:09:09,235 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:09:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:09:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-31 15:09:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:09:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:09,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:09:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:09,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:09:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:09,597 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-31 15:09:09,745 INFO L273 TraceCheckUtils]: 0: Hoare triple {42#true} assume end >= 0;a := a[end := 42];i := 0; {44#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} is VALID [2019-01-31 15:09:09,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} assume a[i] != 42;i := i + 1; {45#(<= i end)} is VALID [2019-01-31 15:09:09,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#(<= i end)} assume !(a[i] != 42); {45#(<= i end)} is VALID [2019-01-31 15:09:09,785 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#(<= i end)} assume !(i <= end); {43#false} is VALID [2019-01-31 15:09:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:09,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:09:09,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:09:09,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:09:09,789 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-31 15:09:09,836 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:09:09,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:09:25,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:09:25,709 INFO L272 AbstractInterpreter]: Visited 4 different actions 22 times. Merged at 3 different actions 17 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 15:09:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:09:25,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:09:25,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:09:25,714 INFO L193 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 [2019-01-31 15:09:25,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:09:25,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:09:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:25,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:09:25,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 15:09:25,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:09:25,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:09:25,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-31 15:09:25,810 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:09:25,810 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_5]. (and (<= i 0) (<= 0 end) (= a (store v_a_5 end 42))) [2019-01-31 15:09:25,810 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= i 0) (<= 0 end) (= 42 (select a end))) [2019-01-31 15:09:25,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-01-31 15:09:25,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:09:26,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:09:26,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-01-31 15:09:26,159 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:09:26,160 WARN L398 uantifierElimination]: Input elimination task: ∃ [a, v_i_7]. (and (<= 0 end) (= 42 (select a end)) (not (= 42 (select a v_i_7))) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2019-01-31 15:09:26,160 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 end) (let ((.cse0 (<= i 1))) (or (and .cse0 (<= (+ end 1) 0)) (and .cse0 (<= i end))))) [2019-01-31 15:09:26,194 INFO L273 TraceCheckUtils]: 0: Hoare triple {42#true} assume end >= 0;a := a[end := 42];i := 0; {49#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} is VALID [2019-01-31 15:09:26,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {53#(and (<= 0 end) (<= i 1) (<= i end))} is VALID [2019-01-31 15:09:26,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#(and (<= 0 end) (<= i 1) (<= i end))} assume !(a[i] != 42); {53#(and (<= 0 end) (<= i 1) (<= i end))} is VALID [2019-01-31 15:09:26,197 INFO L273 TraceCheckUtils]: 3: Hoare triple {53#(and (<= 0 end) (<= i 1) (<= i end))} assume !(i <= end); {43#false} is VALID [2019-01-31 15:09:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:26,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:09:26,351 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#(<= i end)} assume !(i <= end); {43#false} is VALID [2019-01-31 15:09:26,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#(<= i end)} assume !(a[i] != 42); {45#(<= i end)} is VALID [2019-01-31 15:09:26,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {66#(or (= 42 (select a i)) (< i end))} assume a[i] != 42;i := i + 1; {45#(<= i end)} is VALID [2019-01-31 15:09:26,357 INFO L273 TraceCheckUtils]: 0: Hoare triple {42#true} assume end >= 0;a := a[end := 42];i := 0; {66#(or (= 42 (select a i)) (< i end))} is VALID [2019-01-31 15:09:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:26,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:09:26,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2019-01-31 15:09:26,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:09:26,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 15:09:26,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:09:26,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 15:09:26,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:26,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 15:09:26,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 15:09:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-31 15:09:26,396 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-31 15:09:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:26,555 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-31 15:09:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 15:09:26,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 15:09:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:09:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:09:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-31 15:09:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:09:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-31 15:09:26,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-01-31 15:09:26,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:26,588 INFO L225 Difference]: With dead ends: 10 [2019-01-31 15:09:26,588 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 15:09:26,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:09:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 15:09:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 15:09:26,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:09:26,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-31 15:09:26,653 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 15:09:26,653 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 15:09:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:26,655 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 15:09:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 15:09:26,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:26,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:26,656 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 15:09:26,656 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 15:09:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:26,657 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 15:09:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 15:09:26,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:26,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:26,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:09:26,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:09:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 15:09:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 15:09:26,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-01-31 15:09:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:09:26,660 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 15:09:26,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 15:09:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 15:09:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 15:09:26,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:09:26,661 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 15:09:26,661 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:09:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:09:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 2 times [2019-01-31 15:09:26,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:09:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:26,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:09:26,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:26,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:09:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:26,897 INFO L273 TraceCheckUtils]: 0: Hoare triple {110#true} assume end >= 0;a := a[end := 42];i := 0; {112#(and (< i (+ end 1)) (= 42 (select a end)))} is VALID [2019-01-31 15:09:26,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {112#(and (< i (+ end 1)) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {112#(and (< i (+ end 1)) (= 42 (select a end)))} is VALID [2019-01-31 15:09:26,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (< i (+ end 1)) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {113#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} is VALID [2019-01-31 15:09:26,902 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} assume a[i] != 42;i := i + 1; {114#(<= i end)} is VALID [2019-01-31 15:09:26,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= i end)} assume !(a[i] != 42); {114#(<= i end)} is VALID [2019-01-31 15:09:26,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {114#(<= i end)} assume !(i <= end); {111#false} is VALID [2019-01-31 15:09:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 15:09:26,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:09:26,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:09:26,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 15:09:26,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 15:09:26,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:09:26,905 INFO L193 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 [2019-01-31 15:09:26,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 15:09:26,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 15:09:26,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 15:09:26,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 15:09:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:26,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:09:26,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 15:09:26,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:09:26,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:09:26,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-31 15:09:26,982 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:09:26,982 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_6]. (and (<= i 0) (<= 0 end) (= a (store v_a_6 end 42))) [2019-01-31 15:09:26,982 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= i 0) (<= 0 end) (= 42 (select a end))) [2019-01-31 15:09:27,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2019-01-31 15:09:27,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 15:09:27,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:09:27,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:69 [2019-01-31 15:09:27,361 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:09:27,361 WARN L398 uantifierElimination]: Input elimination task: ∃ [a, v_i_9, v_i_10, v_i_11]. (and (<= v_i_9 0) (<= 0 end) (not (= (select a v_i_9) 42)) (<= v_i_10 (+ v_i_9 1)) (<= v_i_11 (+ v_i_10 1)) (<= i (+ v_i_11 1)) (= 42 (select a end)) (not (= 42 (select a v_i_10))) (not (= 42 (select a v_i_11)))) [2019-01-31 15:09:27,362 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 end) (let ((.cse5 (+ end 1))) (let ((.cse3 (<= i .cse5)) (.cse0 (<= i 3)) (.cse4 (<= i end)) (.cse1 (<= .cse5 0)) (.cse2 (<= end 0))) (or (and (<= end 1) .cse0 .cse1 .cse2) (and (<= i (+ end 2)) .cse3 .cse0 .cse4) (and .cse3 .cse0 .cse4 .cse1) (and .cse0 .cse4 .cse1 .cse2))))) [2019-01-31 15:09:27,405 INFO L273 TraceCheckUtils]: 0: Hoare triple {110#true} assume end >= 0;a := a[end := 42];i := 0; {118#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} is VALID [2019-01-31 15:09:27,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {118#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {122#(and (<= 0 end) (= 42 (select a end)) (exists ((v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_9 1)))))} is VALID [2019-01-31 15:09:27,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {122#(and (<= 0 end) (= 42 (select a end)) (exists ((v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_9 1)))))} assume a[i] != 42;i := i + 1; {126#(and (<= 0 end) (exists ((v_i_10 Int) (v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_10 1)) (<= v_i_10 (+ v_i_9 1)) (not (= 42 (select a v_i_10))))) (= 42 (select a end)))} is VALID [2019-01-31 15:09:27,410 INFO L273 TraceCheckUtils]: 3: Hoare triple {126#(and (<= 0 end) (exists ((v_i_10 Int) (v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_10 1)) (<= v_i_10 (+ v_i_9 1)) (not (= 42 (select a v_i_10))))) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {130#(and (<= 0 end) (<= i 3) (<= i end))} is VALID [2019-01-31 15:09:27,411 INFO L273 TraceCheckUtils]: 4: Hoare triple {130#(and (<= 0 end) (<= i 3) (<= i end))} assume !(a[i] != 42); {130#(and (<= 0 end) (<= i 3) (<= i end))} is VALID [2019-01-31 15:09:27,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {130#(and (<= 0 end) (<= i 3) (<= i end))} assume !(i <= end); {111#false} is VALID [2019-01-31 15:09:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:27,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:09:27,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {114#(<= i end)} assume !(i <= end); {111#false} is VALID [2019-01-31 15:09:27,608 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= i end)} assume !(a[i] != 42); {114#(<= i end)} is VALID [2019-01-31 15:09:27,609 INFO L273 TraceCheckUtils]: 3: Hoare triple {143#(or (= 42 (select a i)) (< i end))} assume a[i] != 42;i := i + 1; {114#(<= i end)} is VALID [2019-01-31 15:09:27,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {147#(or (= 42 (select a i)) (forall ((v_i_13 Int)) (or (= (select a v_i_13) 42) (< (+ i 1) v_i_13) (< v_i_13 end))))} assume a[i] != 42;i := i + 1; {143#(or (= 42 (select a i)) (< i end))} is VALID [2019-01-31 15:09:27,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#(or (= 42 (select a i)) (forall ((v_i_13 Int) (v_i_14 Int)) (or (= (select a v_i_14) 42) (= (select a v_i_13) 42) (< (+ i 1) v_i_14) (< v_i_13 end) (< (+ v_i_14 1) v_i_13))))} assume a[i] != 42;i := i + 1; {147#(or (= 42 (select a i)) (forall ((v_i_13 Int)) (or (= (select a v_i_13) 42) (< (+ i 1) v_i_13) (< v_i_13 end))))} is VALID [2019-01-31 15:09:27,613 INFO L273 TraceCheckUtils]: 0: Hoare triple {110#true} assume end >= 0;a := a[end := 42];i := 0; {151#(or (= 42 (select a i)) (forall ((v_i_13 Int) (v_i_14 Int)) (or (= (select a v_i_14) 42) (= (select a v_i_13) 42) (< (+ i 1) v_i_14) (< v_i_13 end) (< (+ v_i_14 1) v_i_13))))} is VALID [2019-01-31 15:09:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:27,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:09:27,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 15:09:27,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:09:27,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 15:09:27,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:09:27,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2019-01-31 15:09:27,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:27,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 15:09:27,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 15:09:27,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-31 15:09:27,658 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 9 states. [2019-01-31 15:09:27,905 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-31 15:09:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:27,939 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 15:09:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 15:09:27,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 15:09:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:09:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 15:09:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-31 15:09:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 15:09:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-31 15:09:27,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2019-01-31 15:09:27,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:27,959 INFO L225 Difference]: With dead ends: 9 [2019-01-31 15:09:27,959 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 15:09:27,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-31 15:09:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 15:09:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 15:09:27,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:09:27,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 15:09:27,961 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:09:27,961 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:09:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:27,962 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:09:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:09:27,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:27,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:27,962 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:09:27,962 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:09:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:27,963 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:09:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:09:27,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:27,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:27,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:09:27,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:09:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 15:09:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 15:09:27,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-31 15:09:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:09:27,964 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 15:09:27,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 15:09:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:09:27,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:27,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 15:09:28,035 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 17 19) the Hoare annotation is: (and (< i (+ end 1)) (= 42 (select a end))) [2019-01-31 15:09:28,035 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 20) no Hoare annotation was computed. [2019-01-31 15:09:28,035 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 21) no Hoare annotation was computed. [2019-01-31 15:09:28,036 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 21) no Hoare annotation was computed. [2019-01-31 15:09:28,036 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 21) no Hoare annotation was computed. [2019-01-31 15:09:28,036 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-31 15:09:28,037 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-31 15:09:28,038 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2019-01-31 15:09:28,038 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2019-01-31 15:09:28,038 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2019-01-31 15:09:28,038 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-01-31 15:09:28,038 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 15:09:28,043 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 03:09:28 BoogieIcfgContainer [2019-01-31 15:09:28,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 15:09:28,044 INFO L168 Benchmark]: Toolchain (without parser) took 19914.36 ms. Allocated memory was 140.0 MB in the beginning and 447.7 MB in the end (delta: 307.8 MB). Free memory was 106.3 MB in the beginning and 284.9 MB in the end (delta: -178.5 MB). Peak memory consumption was 129.2 MB. Max. memory is 7.1 GB. [2019-01-31 15:09:28,045 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:09:28,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.15 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 104.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-31 15:09:28,047 INFO L168 Benchmark]: Boogie Preprocessor took 22.20 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 103.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 15:09:28,048 INFO L168 Benchmark]: RCFGBuilder took 322.10 ms. Allocated memory is still 140.0 MB. Free memory was 103.2 MB in the beginning and 93.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-01-31 15:09:28,049 INFO L168 Benchmark]: TraceAbstraction took 19528.19 ms. Allocated memory was 140.0 MB in the beginning and 447.7 MB in the end (delta: 307.8 MB). Free memory was 93.2 MB in the beginning and 284.9 MB in the end (delta: -191.6 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. [2019-01-31 15:09:28,053 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.15 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 104.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.20 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 103.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 322.10 ms. Allocated memory is still 140.0 MB. Free memory was 103.2 MB in the beginning and 93.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19528.19 ms. Allocated memory was 140.0 MB in the beginning and 447.7 MB in the end (delta: 307.8 MB). Free memory was 93.2 MB in the beginning and 284.9 MB in the end (delta: -191.6 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: 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: 17]: Loop Invariant Derived loop invariant: i < end + 1 && 42 == a[end] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 19.4s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 34 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 11 HoareAnnotationTreeSize, 1 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 26 ConstructedInterpolants, 4 QuantifiedInterpolants, 1239 SizeOfPredicates, 2 NumberOfNonLiveVariables, 30 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...