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/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:18:35,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:18:35,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:18:35,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:18:35,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:18:35,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:18:35,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:18:35,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:18:35,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:18:35,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:18:35,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:18:35,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:18:35,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:18:35,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:18:35,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:18:35,934 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:18:35,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:18:35,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:18:35,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:18:35,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:18:35,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:18:35,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:18:35,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:18:35,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:18:35,947 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:18:35,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:18:35,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:18:35,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:18:35,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:18:35,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:18:35,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:18:35,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:18:35,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:18:35,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:18:35,955 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:18:35,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:18:35,960 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-08 14:18:35,981 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:18:35,981 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:18:35,982 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:18:35,982 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:18:35,982 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:18:35,985 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:18:35,985 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:18:35,986 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:18:35,986 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:18:35,986 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-08 14:18:35,986 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-08 14:18:35,987 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:18:35,987 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:18:35,989 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:18:35,989 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:18:35,989 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:18:35,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:18:35,990 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:18:35,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:18:35,990 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:18:35,990 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:18:35,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:18:35,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:18:35,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:18:35,993 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:18:35,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:18:35,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:18:35,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:18:35,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:18:35,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:18:35,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:35,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:18:35,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:18:35,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:18:35,995 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:18:35,996 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:18:35,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:18:35,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:18:35,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:18:36,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:18:36,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:18:36,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:18:36,076 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:18:36,076 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:18:36,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2019-01-08 14:18:36,077 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-01-08 14:18:36,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:18:36,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:18:36,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:36,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:18:36,144 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:18:36,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:36,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:18:36,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:18:36,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:18:36,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/1) ... [2019-01-08 14:18:36,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:18:36,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:18:36,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:18:36,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:18:36,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (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-08 14:18:36,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:18:36,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:18:36,544 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-01-08 14:18:36,546 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:18:36,546 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-08 14:18:36,548 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:36 BoogieIcfgContainer [2019-01-08 14:18:36,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:18:36,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:18:36,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:18:36,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:18:36,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:36" (1/2) ... [2019-01-08 14:18:36,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3129f229 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:18:36, skipping insertion in model container [2019-01-08 14:18:36,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:36" (2/2) ... [2019-01-08 14:18:36,556 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-01-08 14:18:36,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:18:36,576 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 14:18:36,593 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 14:18:36,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:18:36,629 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:18:36,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:18:36,630 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:18:36,630 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:18:36,630 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:18:36,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:18:36,631 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:18:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-08 14:18:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:18:36,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:36,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:18:36,657 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-08 14:18:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:36,839 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-08 14:18:36,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:18:36,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:18:36,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:18:36,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:18:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:18:36,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:18:36,878 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-08 14:18:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:36,960 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-08 14:18:36,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:18:36,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-08 14:18:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:36,974 INFO L225 Difference]: With dead ends: 11 [2019-01-08 14:18:36,974 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 14:18:36,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:18:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 14:18:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-08 14:18:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 14:18:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-08 14:18:37,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-01-08 14:18:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:37,015 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-08 14:18:37,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:18:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-08 14:18:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:18:37,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:37,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:18:37,016 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:37,017 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-01-08 14:18:37,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:37,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:37,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:37,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:37,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:37,168 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-08 14:18:37,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:37,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:37,170 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:18:37,172 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-01-08 14:18:37,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:18:37,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:18:42,397 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-08 14:18:42,400 INFO L272 AbstractInterpreter]: Visited 4 different actions 14 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:18:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:42,406 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-08 14:18:42,744 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 38.89% of their original sizes. [2019-01-08 14:18:42,745 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-08 14:18:42,840 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-08 14:18:42,841 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-08 14:18:42,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-08 14:18:42,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-01-08 14:18:42,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:18:42,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:18:42,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:18:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:18:42,847 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-01-08 14:18:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:43,254 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-08 14:18:43,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:18:43,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:18:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:43,256 INFO L225 Difference]: With dead ends: 11 [2019-01-08 14:18:43,256 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 14:18:43,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:18:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 14:18:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-08 14:18:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 14:18:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-08 14:18:43,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-01-08 14:18:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:43,263 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-08 14:18:43,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:18:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-01-08 14:18:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:18:43,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:43,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:18:43,265 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:43,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-01-08 14:18:43,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:43,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:18:43,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:43,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:18:43,422 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-01-08 14:18:43,424 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:18:43,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:18:46,304 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-08 14:18:46,305 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:18:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:46,305 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-08 14:18:46,471 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 30.56% of their original sizes. [2019-01-08 14:18:46,472 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-08 14:18:46,804 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-01-08 14:18:46,805 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-08 14:18:46,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-08 14:18:46,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2019-01-08 14:18:46,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:18:46,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:18:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:18:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-08 14:18:46,807 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 6 states. [2019-01-08 14:18:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:49,266 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-08 14:18:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:18:49,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-08 14:18:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:49,267 INFO L225 Difference]: With dead ends: 9 [2019-01-08 14:18:49,267 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:18:49,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:18:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:18:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:18:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:18:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:18:49,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-08 14:18:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:49,270 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:18:49,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:18:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:18:49,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:18:49,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:18:49,731 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-01-08 14:18:49,868 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-08 14:18:50,127 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2019-01-08 14:18:50,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-01-08 14:18:50,131 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-01-08 14:18:50,132 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (and (forall ((v_idx_72 Int) (v_idx_70 Int) (v_idx_71 Int)) (exists ((v_v_612_2 Int) (v_v_614_2 Int)) (let ((.cse2 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse1 (+ ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse4 (+ ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse6 (* 2 ~n)) (.cse8 (+ ULTIMATE.start_SelectionSort_~i~4 4)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse9 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse13 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~i~4)) (.cse0 (* 2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse11 (+ ULTIMATE.start_SelectionSort_~i~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse5 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse12 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse10 (+ ULTIMATE.start_SelectionSort_~i~4 ~n)) (.cse14 (* 2 ULTIMATE.start_SelectionSort_~i~4)) (.cse7 (+ ULTIMATE.start_SelectionSort_~rh~4 ~n))) (and (<= .cse0 0) (or (= v_v_612_2 (select ~array v_idx_70)) (<= 5 (+ v_idx_70 ~n))) (<= .cse1 ULTIMATE.start_SelectionSort_~i~4) (or (< (+ v_idx_71 ~n) 5) (<= ~n v_idx_71) (= 5 (+ ~n (select ~array v_idx_71)))) (<= ~n .cse2) (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) (<= .cse4 ~n) (<= .cse2 ~n) (<= ULTIMATE.start_SelectionSort_~i~4 .cse1) (<= .cse5 0) (<= .cse6 10) (<= 5 .cse7) (<= ~n .cse8) (<= 0 .cse9) (<= .cse10 6) (<= .cse11 1) (<= ~n .cse4) (<= 5 .cse12) (or (< v_idx_72 ~n) (= v_v_614_2 (select ~array v_idx_72))) (<= .cse13 1) (<= 10 .cse6) (<= .cse8 ~n) (<= .cse3 ULTIMATE.start_SelectionSort_~i~4) (<= .cse14 2) (<= ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4) (<= .cse9 0) (<= 1 .cse13) (<= 0 .cse0) (<= 1 .cse11) (<= ULTIMATE.start_SelectionSort_~rh~4 ULTIMATE.start_SelectionSort_~lh~4) (<= 0 .cse5) (<= .cse12 5) (<= 6 .cse10) (<= 2 .cse14) (<= .cse7 5))))) (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_v_612_2 Int) (v_v_614_2 Int)) (let ((.cse16 (+ ULTIMATE.start_main_~i~7 1)) (.cse15 (* 2 ~n)) (.cse18 (+ ULTIMATE.start_main_~i~7 ~n)) (.cse17 (* 2 ULTIMATE.start_main_~i~7))) (and (<= 10 .cse15) (or (= 0 (select ~array v_idx_62)) (< v_idx_62 0) (<= ~n v_idx_62)) (or (< v_idx_63 ~n) (= v_v_614_2 (select ~array v_idx_63))) (<= ULTIMATE.start_main_~i~7 4) (<= .cse16 ~n) (<= 0 .cse16) (<= 0 (+ .cse17 2)) (<= 5 ~n) (or (= v_v_612_2 (select ~array v_idx_61)) (<= 0 v_idx_61)) (<= 4 .cse18) (<= .cse15 10) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= .cse18 9) (<= ~n 5) (<= .cse17 8)))))) [2019-01-08 14:18:50,132 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-01-08 14:18:50,132 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (and (<= 0 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (<= (+ ULTIMATE.start_SelectionSort_~lh~4 ~n) 5) (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_v_612_2 Int) (v_v_614_2 Int)) (let ((.cse1 (+ ULTIMATE.start_main_~i~7 1)) (.cse0 (* 2 ~n)) (.cse3 (+ ULTIMATE.start_main_~i~7 ~n)) (.cse2 (* 2 ULTIMATE.start_main_~i~7))) (and (<= 10 .cse0) (or (= 0 (select ~array v_idx_62)) (< v_idx_62 0) (<= ~n v_idx_62)) (or (< v_idx_63 ~n) (= v_v_614_2 (select ~array v_idx_63))) (<= ULTIMATE.start_main_~i~7 4) (<= .cse1 ~n) (<= 0 .cse1) (<= 0 (+ .cse2 2)) (<= 5 ~n) (or (= v_v_612_2 (select ~array v_idx_61)) (<= 0 v_idx_61)) (<= 4 .cse3) (<= .cse0 10) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= .cse3 9) (<= ~n 5) (<= .cse2 8)))))) [2019-01-08 14:18:50,132 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-01-08 14:18:50,133 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_v_612_2 Int) (v_v_614_2 Int)) (let ((.cse1 (+ ULTIMATE.start_main_~i~7 1)) (.cse0 (* 2 ~n)) (.cse3 (+ ULTIMATE.start_main_~i~7 ~n)) (.cse2 (* 2 ULTIMATE.start_main_~i~7))) (and (<= 10 .cse0) (or (= 0 (select ~array v_idx_62)) (< v_idx_62 0) (<= ~n v_idx_62)) (or (< v_idx_63 ~n) (= v_v_614_2 (select ~array v_idx_63))) (<= ULTIMATE.start_main_~i~7 4) (<= .cse1 ~n) (<= 0 .cse1) (<= 0 (+ .cse2 2)) (<= 5 ~n) (or (= v_v_612_2 (select ~array v_idx_61)) (<= 0 v_idx_61)) (<= 4 .cse3) (<= .cse0 10) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= .cse3 9) (<= ~n 5) (<= .cse2 8))))) [2019-01-08 14:18:50,150 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:18:50 BoogieIcfgContainer [2019-01-08 14:18:50,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:18:50,151 INFO L168 Benchmark]: Toolchain (without parser) took 14009.89 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 914.8 MB. Max. memory is 7.1 GB. [2019-01-08 14:18:50,153 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:18:50,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:18:50,154 INFO L168 Benchmark]: Boogie Preprocessor took 26.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:18:50,157 INFO L168 Benchmark]: RCFGBuilder took 333.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:18:50,158 INFO L168 Benchmark]: TraceAbstraction took 13601.48 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 893.7 MB. Max. memory is 7.1 GB. [2019-01-08 14:18:50,165 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 333.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13601.48 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 893.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: 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: 46]: Loop Invariant Derived loop invariant: (0 <= 2 * SelectionSort_~lh~4 && SelectionSort_~lh~4 + ~n <= 5) && (forall v_idx_63 : int, v_idx_61 : int, v_idx_62 : int :: (exists v_v_612_2 : int, v_v_614_2 : int :: (((((((((((((10 <= 2 * ~n && ((0 == ~array[v_idx_62] || v_idx_62 < 0) || ~n <= v_idx_62)) && (v_idx_63 < ~n || v_v_614_2 == ~array[v_idx_63])) && main_~i~7 <= 4) && main_~i~7 + 1 <= ~n) && 0 <= main_~i~7 + 1) && 0 <= 2 * main_~i~7 + 2) && 5 <= ~n) && (v_v_612_2 == ~array[v_idx_61] || 0 <= v_idx_61)) && 4 <= main_~i~7 + ~n) && 2 * ~n <= 10) && ~n <= main_~i~7 + 6) && main_~i~7 + ~n <= 9) && ~n <= 5) && 2 * main_~i~7 <= 8)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (forall v_idx_63 : int, v_idx_61 : int, v_idx_62 : int :: (exists v_v_612_2 : int, v_v_614_2 : int :: (((((((((((((10 <= 2 * ~n && ((0 == ~array[v_idx_62] || v_idx_62 < 0) || ~n <= v_idx_62)) && (v_idx_63 < ~n || v_v_614_2 == ~array[v_idx_63])) && main_~i~7 <= 4) && main_~i~7 + 1 <= ~n) && 0 <= main_~i~7 + 1) && 0 <= 2 * main_~i~7 + 2) && 5 <= ~n) && (v_v_612_2 == ~array[v_idx_61] || 0 <= v_idx_61)) && 4 <= main_~i~7 + ~n) && 2 * ~n <= 10) && ~n <= main_~i~7 + 6) && main_~i~7 + ~n <= 9) && ~n <= 5) && 2 * main_~i~7 <= 8)) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (forall v_idx_72 : int, v_idx_70 : int, v_idx_71 : int :: (exists v_v_612_2 : int, v_v_614_2 : int :: (((((((((((((((((((((((((((((((((2 * SelectionSort_~rh~4 <= 0 && (v_v_612_2 == ~array[v_idx_70] || 5 <= v_idx_70 + ~n)) && SelectionSort_~rh~4 + 1 <= SelectionSort_~i~4) && ((v_idx_71 + ~n < 5 || ~n <= v_idx_71) || 5 == ~n + ~array[v_idx_71])) && ~n <= SelectionSort_~lh~4 + 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~rh~4 + 5 <= ~n) && SelectionSort_~lh~4 + 5 <= ~n) && SelectionSort_~i~4 <= SelectionSort_~rh~4 + 1) && 2 * SelectionSort_~lh~4 <= 0) && 2 * ~n <= 10) && 5 <= SelectionSort_~rh~4 + ~n) && ~n <= SelectionSort_~i~4 + 4) && 0 <= SelectionSort_~lh~4 + SelectionSort_~rh~4) && SelectionSort_~i~4 + ~n <= 6) && SelectionSort_~i~4 + SelectionSort_~rh~4 <= 1) && ~n <= SelectionSort_~rh~4 + 5) && 5 <= SelectionSort_~lh~4 + ~n) && (v_idx_72 < ~n || v_v_614_2 == ~array[v_idx_72])) && SelectionSort_~lh~4 + SelectionSort_~i~4 <= 1) && 10 <= 2 * ~n) && SelectionSort_~i~4 + 4 <= ~n) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && 2 * SelectionSort_~i~4 <= 2) && SelectionSort_~lh~4 <= SelectionSort_~rh~4) && SelectionSort_~lh~4 + SelectionSort_~rh~4 <= 0) && 1 <= SelectionSort_~lh~4 + SelectionSort_~i~4) && 0 <= 2 * SelectionSort_~rh~4) && 1 <= SelectionSort_~i~4 + SelectionSort_~rh~4) && SelectionSort_~rh~4 <= SelectionSort_~lh~4) && 0 <= 2 * SelectionSort_~lh~4) && SelectionSort_~lh~4 + ~n <= 5) && 6 <= SelectionSort_~i~4 + ~n) && 2 <= 2 * SelectionSort_~i~4) && SelectionSort_~rh~4 + ~n <= 5)) && (forall v_idx_63 : int, v_idx_61 : int, v_idx_62 : int :: (exists v_v_612_2 : int, v_v_614_2 : int :: (((((((((((((10 <= 2 * ~n && ((0 == ~array[v_idx_62] || v_idx_62 < 0) || ~n <= v_idx_62)) && (v_idx_63 < ~n || v_v_614_2 == ~array[v_idx_63])) && main_~i~7 <= 4) && main_~i~7 + 1 <= ~n) && 0 <= main_~i~7 + 1) && 0 <= 2 * main_~i~7 + 2) && 5 <= ~n) && (v_v_612_2 == ~array[v_idx_61] || 0 <= v_idx_61)) && 4 <= main_~i~7 + ~n) && 2 * ~n <= 10) && ~n <= main_~i~7 + 6) && main_~i~7 + ~n <= 9) && ~n <= 5) && 2 * main_~i~7 <= 8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 13.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 12 SDslu, 5 SDs, 0 SdLazy, 6 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.8400000000000001 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, -2.8 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 7 NumberOfFragments, 475 HoareAnnotationTreeSize, 4 FomulaSimplifications, 210 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 232 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...