java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:50:07,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:50:07,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:50:07,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:50:07,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:50:07,439 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:50:07,441 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:50:07,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:50:07,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:50:07,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:50:07,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:50:07,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:50:07,457 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:50:07,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:50:07,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:50:07,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:50:07,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:50:07,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:50:07,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:50:07,476 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:50:07,477 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:50:07,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:50:07,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:50:07,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:50:07,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:50:07,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:50:07,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:50:07,489 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:50:07,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:50:07,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:50:07,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:50:07,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:50:07,493 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:50:07,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:50:07,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:50:07,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:50:07,497 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-11 14:50:07,514 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:50:07,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:50:07,515 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:50:07,516 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:50:07,516 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:50:07,516 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:50:07,516 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:50:07,516 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:50:07,517 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:50:07,517 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 14:50:07,517 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 14:50:07,517 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:50:07,517 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:50:07,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:50:07,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:50:07,518 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:50:07,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:50:07,519 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:50:07,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:50:07,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:50:07,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:50:07,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:50:07,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:50:07,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:50:07,520 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:50:07,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:50:07,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:50:07,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:50:07,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:50:07,521 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:50:07,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:50:07,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:50:07,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:50:07,522 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:50:07,522 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:50:07,522 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:50:07,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:50:07,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:50:07,524 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:50:07,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:50:07,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:50:07,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:50:07,573 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:50:07,574 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:50:07,574 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-11 14:50:07,574 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2019-01-11 14:50:07,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:50:07,603 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:50:07,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:50:07,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:50:07,604 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:50:07,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,642 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 14:50:07,643 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 14:50:07,643 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 14:50:07,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:50:07,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:50:07,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:50:07,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:50:07,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/1) ... [2019-01-11 14:50:07,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:50:07,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:50:07,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:50:07,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:50:07,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:50:07,749 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-11 14:50:07,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 14:50:07,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 14:50:07,950 INFO L278 CfgBuilder]: Using library mode [2019-01-11 14:50:07,951 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-11 14:50:07,952 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:50:07 BoogieIcfgContainer [2019-01-11 14:50:07,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:50:07,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:50:07,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:50:07,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:50:07,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:50:07" (1/2) ... [2019-01-11 14:50:07,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5061b4 and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:50:07, skipping insertion in model container [2019-01-11 14:50:07,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:50:07" (2/2) ... [2019-01-11 14:50:07,960 INFO L112 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bpl [2019-01-11 14:50:07,970 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:50:07,978 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:50:07,995 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:50:08,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:50:08,030 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:50:08,030 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:50:08,030 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:50:08,030 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:50:08,030 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:50:08,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:50:08,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:50:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-11 14:50:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:50:08,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:50:08,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:50:08,060 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:50:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:50:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-11 14:50:08,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:50:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:08,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:50:08,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:08,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:50:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:50:08,220 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-11 14:50:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:50:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:50:08,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:50:08,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:50:08,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:50:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:50:08,241 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-11 14:50:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:50:08,314 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-11 14:50:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:50:08,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:50:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:50:08,361 INFO L225 Difference]: With dead ends: 9 [2019-01-11 14:50:08,361 INFO L226 Difference]: Without dead ends: 5 [2019-01-11 14:50:08,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:50:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-11 14:50:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-11 14:50:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-11 14:50:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-11 14:50:08,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-11 14:50:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:50:08,430 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-11 14:50:08,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:50:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-11 14:50:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:50:08,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:50:08,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:50:08,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:50:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:50:08,432 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-11 14:50:08,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:50:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:08,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:50:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:08,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:50:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:50:08,610 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-11 14:50:08,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:50:08,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:50:08,612 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:50:08,614 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-11 14:50:08,680 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:50:08,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:50:10,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:50:10,663 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-11 14:50:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:50:10,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:50:10,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:50:10,674 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-11 14:50:10,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:50:10,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:50:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:50:10,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:50:10,892 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-11 14:50:10,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:50:10,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:50:10,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-11 14:50:11,068 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-11 14:50:11,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:50:11,139 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-11 14:50:11,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-01-11 14:50:11,409 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-11 14:50:11,411 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-11 14:50:11,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:50:11,485 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-11 14:50:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:50:11,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2019-01-11 14:50:11,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:50:11,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:50:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:50:11,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:50:11,508 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-11 14:50:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:50:11,829 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-11 14:50:11,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:50:11,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:50:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:50:11,832 INFO L225 Difference]: With dead ends: 10 [2019-01-11 14:50:11,832 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 14:50:11,833 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-11 14:50:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 14:50:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 14:50:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 14:50:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-11 14:50:11,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-01-11 14:50:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:50:11,840 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-11 14:50:11,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:50:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-11 14:50:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:50:11,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:50:11,842 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 14:50:11,844 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:50:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:50:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 2 times [2019-01-11 14:50:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:50:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:11,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:50:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:11,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:50:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:50:12,282 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-11 14:50:12,289 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-11 14:50:12,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:50:12,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:50:12,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:50:12,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:50:12,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:50:12,291 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-11 14:50:12,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:50:12,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:50:12,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:50:12,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:50:12,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:50:12,333 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-11 14:50:12,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:50:12,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:50:12,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-11 14:50:12,674 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-11 14:50:12,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:50:12,834 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-11 14:50:12,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:69 [2019-01-11 14:50:13,243 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2019-01-11 14:50:13,244 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-11 14:50:13,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:50:13,463 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-11 14:50:13,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:50:13,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 14:50:13,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:50:13,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:50:13,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:50:13,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:50:13,483 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 9 states. [2019-01-11 14:50:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:50:13,542 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-11 14:50:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:50:13,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:50:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:50:13,544 INFO L225 Difference]: With dead ends: 9 [2019-01-11 14:50:13,544 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:50:13,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:50:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:50:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:50:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:50:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:50:13,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-11 14:50:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:50:13,547 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:50:13,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:50:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:50:13,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:50:13,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:50:13,643 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-11 14:50:13,644 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 21) no Hoare annotation was computed. [2019-01-11 14:50:13,644 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 21) no Hoare annotation was computed. [2019-01-11 14:50:13,644 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 20) no Hoare annotation was computed. [2019-01-11 14:50:13,644 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 21) no Hoare annotation was computed. [2019-01-11 14:50:13,644 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-11 14:50:13,652 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:50:13 BoogieIcfgContainer [2019-01-11 14:50:13,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:50:13,653 INFO L168 Benchmark]: Toolchain (without parser) took 6051.08 ms. Allocated memory was 140.0 MB in the beginning and 332.9 MB in the end (delta: 192.9 MB). Free memory was 107.6 MB in the beginning and 230.8 MB in the end (delta: -123.2 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2019-01-11 14:50:13,654 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:50:13,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.98 ms. Allocated memory is still 140.0 MB. Free memory was 107.6 MB in the beginning and 105.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:50:13,656 INFO L168 Benchmark]: Boogie Preprocessor took 29.95 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.6 MB in the end (delta: 969.8 kB). Peak memory consumption was 969.8 kB. Max. memory is 7.1 GB. [2019-01-11 14:50:13,657 INFO L168 Benchmark]: RCFGBuilder took 276.13 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 95.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-01-11 14:50:13,657 INFO L168 Benchmark]: TraceAbstraction took 5699.15 ms. Allocated memory was 140.0 MB in the beginning and 332.9 MB in the end (delta: 192.9 MB). Free memory was 95.7 MB in the beginning and 230.8 MB in the end (delta: -135.2 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. [2019-01-11 14:50:13,662 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.98 ms. Allocated memory is still 140.0 MB. Free memory was 107.6 MB in the beginning and 105.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.95 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.6 MB in the end (delta: 969.8 kB). Peak memory consumption was 969.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 276.13 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 95.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5699.15 ms. Allocated memory was 140.0 MB in the beginning and 332.9 MB in the end (delta: 192.9 MB). Free memory was 95.7 MB in the beginning and 230.8 MB in the end (delta: -135.2 MB). Peak memory consumption was 57.8 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, 5.6s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 30 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.8s 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, 2.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s 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.5s 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...