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-299a4a8 [2018-12-04 11:57:02,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:57:02,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:57:02,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:57:02,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:57:02,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:57:02,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:57:02,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:57:02,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:57:02,598 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:57:02,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:57:02,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:57:02,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:57:02,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:57:02,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:57:02,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:57:02,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:57:02,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:57:02,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:57:02,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:57:02,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:57:02,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:57:02,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:57:02,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:57:02,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:57:02,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:57:02,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:57:02,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:57:02,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:57:02,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:57:02,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:57:02,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:57:02,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:57:02,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:57:02,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:57:02,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:57:02,624 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 [2018-12-04 11:57:02,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:57:02,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:57:02,646 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:57:02,647 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:57:02,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:57:02,647 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:57:02,647 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:57:02,647 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:57:02,651 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:57:02,652 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-04 11:57:02,652 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-04 11:57:02,652 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:57:02,652 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:57:02,652 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:57:02,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:57:02,654 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:57:02,654 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:57:02,654 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:57:02,654 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:57:02,654 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:57:02,655 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:57:02,655 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:57:02,655 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:57:02,655 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:57:02,655 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:57:02,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:57:02,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:57:02,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:57:02,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:57:02,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:57:02,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:57:02,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:57:02,660 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:57:02,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:57:02,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:57:02,660 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:57:02,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:57:02,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:57:02,661 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:57:02,661 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:57:02,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:57:02,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:57:02,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:57:02,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:57:02,728 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:57:02,728 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 [2018-12-04 11:57:02,729 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-12-04 11:57:02,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:57:02,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:57:02,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:57:02,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:57:02,804 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,821 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:57:02,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:57:02,849 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,850 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,851 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,852 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,860 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,862 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,863 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 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:57:02,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:57:02,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:57:02,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:57:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:57:02,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:57:03,215 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:57:03,215 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-04 11:57:03,216 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:03 BoogieIcfgContainer [2018-12-04 11:57:03,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:57:03,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:57:03,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:57:03,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:57:03,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/2) ... [2018-12-04 11:57:03,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a67464 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:57:03, skipping insertion in model container [2018-12-04 11:57:03,221 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 04.12 11:57:03" (2/2) ... [2018-12-04 11:57:03,223 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-12-04 11:57:03,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:57:03,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:57:03,262 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:57:03,301 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:57:03,301 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:57:03,301 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:57:03,302 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:57:03,302 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:57:03,302 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:57:03,302 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:57:03,302 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:57:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-04 11:57:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:57:03,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:57:03,330 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-04 11:57:03,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:03,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:57:03,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:57:03,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:57:03,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:57:03,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:57:03,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,555 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-04 11:57:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:03,630 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-04 11:57:03,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:57:03,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:57:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:03,645 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:57:03,645 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:57:03,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:57:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:57:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:57:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-04 11:57:03,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-04 11:57:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:03,682 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-04 11:57:03,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:57:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-04 11:57:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-04 11:57:03,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-04 11:57:03,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2018-12-04 11:57:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:03,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:03,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:03,769 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-04 11:57:03,770 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2018-12-04 11:57:03,826 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 11:57:03,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:57:17,615 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-04 11:57:17,617 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. [2018-12-04 11:57:17,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:17,636 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-04 11:57:18,200 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 38.89% of their original sizes. [2018-12-04 11:57:18,201 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-04 11:57:18,218 INFO L418 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-04 11:57:18,218 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-04 11:57:18,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-04 11:57:18,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-12-04 11:57:18,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:57:18,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:57:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:57:18,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:57:18,222 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-04 11:57:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:19,021 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-04 11:57:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:57:19,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-04 11:57:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:19,023 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:57:19,023 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:57:19,024 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-04 11:57:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:57:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-04 11:57:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-04 11:57:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-04 11:57:19,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-12-04 11:57:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:19,028 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-04 11:57:19,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:57:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-04 11:57:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:57:19,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:19,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:57:19,030 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:19,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2018-12-04 11:57:19,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:57:19,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:19,107 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-04 11:57:19,108 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2018-12-04 11:57:19,109 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 11:57:19,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:57:28,668 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-04 11:57:28,668 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. [2018-12-04 11:57:28,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:28,676 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-04 11:57:29,168 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 30.56% of their original sizes. [2018-12-04 11:57:29,169 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-04 11:57:30,324 INFO L418 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-04 11:57:30,324 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-04 11:57:30,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-04 11:57:30,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2018-12-04 11:57:30,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:57:30,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:57:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:57:30,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:57:30,326 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 6 states. [2018-12-04 11:57:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:33,330 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2018-12-04 11:57:33,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:57:33,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-04 11:57:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:33,331 INFO L225 Difference]: With dead ends: 9 [2018-12-04 11:57:33,331 INFO L226 Difference]: Without dead ends: 0 [2018-12-04 11:57:33,332 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:57:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-04 11:57:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-04 11:57:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-04 11:57:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-04 11:57:33,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-12-04 11:57:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:33,333 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-04 11:57:33,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:57:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-04 11:57:33,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-04 11:57:33,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-04 11:57:33,527 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 123 [2018-12-04 11:57:33,693 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 205 [2018-12-04 11:57:33,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2018-12-04 11:57:33,697 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2018-12-04 11:57:33,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2018-12-04 11:57:33,698 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (and (<= (* 2 ULTIMATE.start_main_~i~7) 8) (<= 4 (+ ULTIMATE.start_main_~i~7 ~n)) (exists ((v_v_615_2 Int) (v_b_55_2 Int) (v_b_54_2 Int)) (let ((.cse10 (+ ULTIMATE.start_SelectionSort_~i~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse7 (+ v_v_615_2 ~n)) (.cse11 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~i~4)) (.cse32 (+ ULTIMATE.start_SelectionSort_~lh~4 v_b_54_2)) (.cse36 (+ v_v_615_2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse9 (+ ULTIMATE.start_SelectionSort_~i~4 ~n)) (.cse4 (+ v_v_615_2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse14 (+ ULTIMATE.start_SelectionSort_~i~4 v_b_54_2)) (.cse0 (+ ULTIMATE.start_SelectionSort_~rh~4 v_b_55_2)) (.cse17 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse41 (* 2 ~n)) (.cse34 (+ v_b_54_2 1)) (.cse6 (+ ULTIMATE.start_SelectionSort_~i~4 4)) (.cse8 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse42 (+ v_v_615_2 v_b_55_2)) (.cse37 (+ ULTIMATE.start_SelectionSort_~lh~4 v_b_55_2)) (.cse12 (+ v_v_615_2 5)) (.cse2 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse39 (+ v_v_615_2 v_b_54_2)) (.cse29 (+ ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse18 (* 2 v_v_615_2)) (.cse30 (* 2 v_b_54_2)) (.cse15 (+ ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse46 (+ ULTIMATE.start_SelectionSort_~i~4 v_b_55_2)) (.cse1 (+ ~n v_b_54_2)) (.cse38 (* 2 ULTIMATE.start_SelectionSort_~i~4)) (.cse40 (* 2 v_b_55_2)) (.cse16 (+ ULTIMATE.start_SelectionSort_~rh~4 v_b_54_2)) (.cse43 (* 2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse35 (+ v_b_55_2 ~n)) (.cse44 (+ v_v_615_2 ULTIMATE.start_SelectionSort_~i~4)) (.cse5 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse31 (+ v_v_615_2 1)) (.cse13 (+ v_b_54_2 5)) (.cse33 (+ v_b_55_2 v_b_54_2)) (.cse45 (+ ULTIMATE.start_SelectionSort_~rh~4 ~n))) (and (<= 5 .cse0) (<= .cse1 5) (<= ~n .cse2) (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) (<= ULTIMATE.start_SelectionSort_~lh~4 v_b_54_2) (<= .cse4 0) (<= .cse5 0) (<= v_b_55_2 .cse6) (<= v_v_615_2 ULTIMATE.start_SelectionSort_~rh~4) (<= .cse7 5) (<= 0 .cse8) (<= .cse9 6) (<= .cse10 1) (<= .cse11 1) (<= .cse12 v_b_55_2) (<= .cse13 v_b_55_2) (<= 1 .cse14) (<= .cse15 v_b_55_2) (<= .cse16 0) (<= v_v_615_2 ULTIMATE.start_SelectionSort_~lh~4) (<= .cse2 v_b_55_2) (<= 1 .cse10) (<= ULTIMATE.start_SelectionSort_~rh~4 ULTIMATE.start_SelectionSort_~lh~4) (<= .cse17 5) (<= ULTIMATE.start_SelectionSort_~rh~4 v_b_54_2) (<= .cse18 0) (forall ((v_idx_72 Int) (v_idx_70 Int) (v_idx_71 Int)) (or (< v_idx_72 v_b_55_2) (<= v_b_54_2 v_idx_70) (<= v_b_55_2 v_idx_71) (< v_idx_71 v_b_54_2) (let ((.cse20 (select ~array v_idx_71))) (let ((.cse19 (* 2 .cse20)) (.cse23 (+ ULTIMATE.start_SelectionSort_~rh~4 .cse20)) (.cse25 (+ .cse20 1)) (.cse26 (+ v_b_55_2 .cse20)) (.cse21 (+ .cse20 5)) (.cse27 (+ v_b_54_2 .cse20)) (.cse24 (+ ~n .cse20)) (.cse22 (+ ULTIMATE.start_SelectionSort_~i~4 .cse20)) (.cse28 (+ ULTIMATE.start_SelectionSort_~lh~4 .cse20))) (and (<= .cse19 0) (<= ULTIMATE.start_SelectionSort_~lh~4 .cse20) (<= 0 .cse19) (<= .cse20 ULTIMATE.start_SelectionSort_~lh~4) (<= .cse20 ULTIMATE.start_SelectionSort_~rh~4) (<= .cse21 v_b_55_2) (<= 1 .cse22) (<= .cse23 0) (<= .cse24 5) (<= v_b_54_2 .cse20) (<= .cse25 ULTIMATE.start_SelectionSort_~i~4) (<= 0 .cse23) (<= 5 .cse26) (<= 0 .cse27) (<= ULTIMATE.start_SelectionSort_~rh~4 .cse20) (<= ULTIMATE.start_SelectionSort_~i~4 .cse25) (<= .cse26 5) (<= v_b_55_2 .cse21) (<= ~n .cse21) (<= .cse21 ~n) (<= 0 .cse28) (<= .cse20 v_b_54_2) (<= .cse27 0) (<= 5 .cse24) (<= .cse22 1) (<= .cse28 0)))))) (<= .cse29 ULTIMATE.start_SelectionSort_~i~4) (<= ULTIMATE.start_SelectionSort_~rh~4 v_v_615_2) (<= .cse6 v_b_55_2) (<= .cse30 0) (<= .cse31 ULTIMATE.start_SelectionSort_~i~4) (<= .cse32 0) (<= .cse15 ~n) (<= 5 .cse33) (<= 5 .cse7) (<= ULTIMATE.start_SelectionSort_~i~4 .cse34) (<= .cse35 10) (<= .cse12 ~n) (<= 0 .cse36) (<= v_b_54_2 v_v_615_2) (<= ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4) (<= v_b_55_2 .cse13) (<= 1 .cse11) (<= 0 .cse32) (<= v_b_55_2 .cse12) (<= 5 .cse37) (<= .cse36 0) (<= 6 .cse9) (<= 2 .cse38) (<= 0 .cse4) (<= 0 .cse39) (<= .cse14 1) (<= v_v_615_2 v_b_54_2) (<= .cse40 10) (<= .cse41 10) (<= v_b_55_2 .cse15) (<= ~n .cse6) (<= .cse0 5) (<= v_b_55_2 .cse2) (<= 5 .cse42) (<= v_b_55_2 ~n) (<= 5 .cse17) (<= 10 .cse41) (<= .cse34 ULTIMATE.start_SelectionSort_~i~4) (<= .cse6 ~n) (<= .cse8 0) (<= .cse42 5) (<= ~n v_b_55_2) (<= .cse37 5) (<= .cse43 0) (<= ~n .cse12) (<= 1 .cse44) (<= .cse2 ~n) (<= .cse39 0) (<= ULTIMATE.start_SelectionSort_~i~4 .cse29) (<= .cse13 ~n) (<= 0 .cse18) (<= 5 .cse45) (<= 6 .cse46) (<= 0 .cse30) (<= v_b_54_2 ULTIMATE.start_SelectionSort_~rh~4) (<= ~n .cse15) (<= ULTIMATE.start_SelectionSort_~lh~4 v_v_615_2) (<= .cse3 ULTIMATE.start_SelectionSort_~i~4) (<= .cse46 6) (<= 5 .cse1) (<= .cse38 2) (<= v_b_54_2 ULTIMATE.start_SelectionSort_~lh~4) (<= 10 .cse40) (<= 0 .cse16) (<= 0 .cse43) (<= 10 .cse35) (<= .cse44 1) (<= 0 .cse5) (<= ULTIMATE.start_SelectionSort_~i~4 .cse31) (<= ~n .cse13) (<= .cse33 5) (<= .cse45 5))))) [2018-12-04 11:57:33,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2018-12-04 11:57:33,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 5 99) no Hoare annotation was computed. [2018-12-04 11:57:33,699 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (and (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= (* 2 ULTIMATE.start_main_~i~7) 8) (exists ((v_v_615_2 Int) (v_b_55_2 Int) (v_b_54_2 Int)) (let ((.cse0 (+ v_v_615_2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse6 (* 2 ~n)) (.cse8 (+ v_v_615_2 v_b_55_2)) (.cse9 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse1 (+ v_v_615_2 v_b_54_2)) (.cse13 (* 2 v_v_615_2)) (.cse14 (* 2 v_b_54_2)) (.cse7 (+ v_v_615_2 ~n)) (.cse2 (+ ~n v_b_54_2)) (.cse5 (* 2 v_b_55_2)) (.cse15 (+ ULTIMATE.start_SelectionSort_~lh~4 v_b_54_2)) (.cse10 (+ v_v_615_2 5)) (.cse24 (+ v_b_55_2 ~n)) (.cse12 (+ ULTIMATE.start_SelectionSort_~lh~4 v_b_55_2)) (.cse4 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse11 (+ v_b_54_2 5)) (.cse16 (+ v_b_55_2 v_b_54_2))) (and (<= 0 .cse0) (<= 0 .cse1) (<= .cse2 5) (<= ~n .cse3) (<= v_v_615_2 v_b_54_2) (<= ULTIMATE.start_SelectionSort_~lh~4 v_b_54_2) (<= .cse0 0) (<= .cse4 0) (<= .cse5 10) (<= .cse6 10) (<= .cse7 5) (<= v_b_55_2 .cse3) (<= 5 .cse8) (<= v_b_55_2 ~n) (<= 5 .cse9) (<= 10 .cse6) (<= .cse10 v_b_55_2) (<= .cse11 v_b_55_2) (<= .cse8 5) (<= v_v_615_2 ULTIMATE.start_SelectionSort_~lh~4) (<= .cse3 v_b_55_2) (<= ~n v_b_55_2) (<= .cse9 5) (<= .cse12 5) (<= .cse13 0) (<= .cse14 0) (<= ~n .cse10) (<= .cse15 0) (<= .cse3 ~n) (<= .cse1 0) (<= 5 .cse16) (<= .cse11 ~n) (<= 0 .cse13) (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int)) (or (<= v_b_54_2 v_idx_67) (< v_idx_69 v_b_55_2) (let ((.cse20 (select ~array v_idx_68))) (let ((.cse23 (+ ULTIMATE.start_SelectionSort_~lh~4 .cse20)) (.cse21 (+ .cse20 v_b_55_2)) (.cse22 (* 2 .cse20)) (.cse18 (+ .cse20 v_b_54_2)) (.cse19 (+ .cse20 5)) (.cse17 (+ .cse20 ~n))) (and (<= .cse17 5) (<= 0 .cse18) (<= ~n .cse19) (<= .cse20 v_b_54_2) (<= ULTIMATE.start_SelectionSort_~lh~4 .cse20) (<= .cse20 ULTIMATE.start_SelectionSort_~lh~4) (<= .cse21 5) (<= .cse19 ~n) (<= v_b_54_2 .cse20) (<= 0 .cse22) (<= v_b_55_2 .cse19) (<= 0 .cse23) (<= .cse23 0) (<= 5 .cse21) (<= .cse22 0) (<= .cse18 0) (<= .cse19 v_b_55_2) (<= 5 .cse17)))) (< v_idx_68 v_b_54_2) (<= v_b_55_2 v_idx_68))) (<= 0 .cse14) (<= 5 .cse7) (<= .cse24 10) (<= .cse10 ~n) (<= ULTIMATE.start_SelectionSort_~lh~4 v_v_615_2) (<= 5 .cse2) (<= v_b_54_2 v_v_615_2) (<= v_b_54_2 ULTIMATE.start_SelectionSort_~lh~4) (<= v_b_55_2 .cse11) (<= 10 .cse5) (<= 0 .cse15) (<= v_b_55_2 .cse10) (<= 10 .cse24) (<= 5 .cse12) (<= 0 .cse4) (<= ~n .cse11) (<= .cse16 5))))) [2018-12-04 11:57:33,699 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (exists ((v_v_615_2 Int) (v_b_55_2 Int) (v_b_54_2 Int)) (let ((.cse5 (* 2 ~n)) (.cse7 (* 2 ULTIMATE.start_main_~i~7)) (.cse3 (+ ULTIMATE.start_main_~i~7 v_b_55_2)) (.cse9 (+ v_v_615_2 v_b_55_2)) (.cse18 (+ ULTIMATE.start_main_~i~7 6)) (.cse0 (+ v_v_615_2 v_b_54_2)) (.cse2 (+ ULTIMATE.start_main_~i~7 1)) (.cse6 (+ ULTIMATE.start_main_~i~7 ~n)) (.cse19 (* 2 v_v_615_2)) (.cse20 (* 2 v_b_54_2)) (.cse8 (+ v_v_615_2 ~n)) (.cse1 (+ ~n v_b_54_2)) (.cse4 (* 2 v_b_55_2)) (.cse16 (+ v_v_615_2 5)) (.cse22 (+ v_b_55_2 ~n)) (.cse17 (+ v_b_54_2 5)) (.cse21 (+ v_b_55_2 v_b_54_2))) (and (<= 0 .cse0) (<= .cse1 5) (<= .cse2 ~n) (<= v_v_615_2 v_b_54_2) (<= .cse3 9) (<= .cse4 10) (<= .cse5 10) (<= .cse6 9) (<= (+ v_v_615_2 ULTIMATE.start_main_~i~7) 4) (<= .cse7 8) (<= .cse8 5) (<= 5 .cse9) (<= v_b_55_2 ~n) (<= 0 (+ ULTIMATE.start_main_~i~7 v_b_54_2 1)) (<= 10 .cse5) (<= v_b_54_2 .cse2) (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (or (<= v_b_55_2 v_idx_62) (< v_idx_62 v_b_54_2) (<= v_b_54_2 v_idx_61) (< v_idx_63 v_b_55_2) (let ((.cse11 (select ~array v_idx_62))) (let ((.cse10 (+ .cse11 ~n)) (.cse13 (+ .cse11 v_b_54_2)) (.cse15 (* 2 .cse11)) (.cse14 (+ .cse11 v_b_55_2)) (.cse12 (+ .cse11 5))) (and (<= .cse10 5) (<= 5 .cse10) (<= (+ ULTIMATE.start_main_~i~7 .cse11) 4) (<= .cse12 ~n) (<= .cse13 0) (<= .cse11 (+ ULTIMATE.start_main_~i~7 1)) (<= .cse11 v_b_54_2) (<= 5 .cse14) (<= 0 .cse15) (<= 0 .cse13) (<= ULTIMATE.start_main_~i~7 (+ .cse11 4)) (<= 0 (+ ULTIMATE.start_main_~i~7 .cse11 1)) (<= ~n .cse12) (<= .cse15 0) (<= v_b_54_2 .cse11) (<= .cse12 v_b_55_2) (<= .cse14 5) (<= v_b_55_2 .cse12)))))) (<= 0 (+ .cse7 2)) (<= .cse16 v_b_55_2) (<= .cse17 v_b_55_2) (<= 4 .cse3) (<= .cse9 5) (<= v_b_55_2 .cse18) (<= ~n .cse18) (<= ~n v_b_55_2) (<= (+ ULTIMATE.start_main_~i~7 v_b_54_2) 4) (<= .cse19 0) (<= .cse2 v_b_55_2) (<= .cse20 0) (<= ~n .cse16) (<= .cse0 0) (<= 5 .cse21) (<= .cse17 ~n) (<= v_v_615_2 .cse2) (<= 4 .cse6) (<= ULTIMATE.start_main_~i~7 (+ v_b_54_2 4)) (<= 0 .cse19) (<= 0 .cse20) (<= 5 .cse8) (<= .cse22 10) (<= .cse16 ~n) (<= 5 .cse1) (<= v_b_54_2 v_v_615_2) (<= v_b_55_2 .cse17) (<= 10 .cse4) (<= v_b_55_2 .cse16) (<= 10 .cse22) (<= ~n .cse17) (<= .cse21 5) (<= ULTIMATE.start_main_~i~7 (+ v_v_615_2 4)) (<= 0 (+ v_v_615_2 ULTIMATE.start_main_~i~7 1))))) [2018-12-04 11:57:33,728 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 11:57:33 BoogieIcfgContainer [2018-12-04 11:57:33,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-04 11:57:33,729 INFO L168 Benchmark]: Toolchain (without parser) took 30946.71 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -245.0 MB). Peak memory consumption was 950.9 MB. Max. memory is 7.1 GB. [2018-12-04 11:57:33,731 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:57:33,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:57:33,732 INFO L168 Benchmark]: Boogie Preprocessor took 30.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:57:33,733 INFO L168 Benchmark]: RCFGBuilder took 341.62 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. [2018-12-04 11:57:33,734 INFO L168 Benchmark]: TraceAbstraction took 30511.78 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -266.1 MB). Peak memory consumption was 929.8 MB. Max. memory is 7.1 GB. [2018-12-04 11:57:33,740 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 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 51.15 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 30.06 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 341.62 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 30511.78 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -266.1 MB). Peak memory consumption was 929.8 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: (~n <= main_~i~7 + 6 && 2 * main_~i~7 <= 8) && (exists v_v_615_2 : int, v_b_55_2 : int, v_b_54_2 : int :: (((((((((((((((((((((((((((((((((((((((((((((((((0 <= v_v_615_2 + SelectionSort_~lh~4 && 0 <= v_v_615_2 + v_b_54_2) && ~n + v_b_54_2 <= 5) && ~n <= SelectionSort_~lh~4 + 5) && v_v_615_2 <= v_b_54_2) && SelectionSort_~lh~4 <= v_b_54_2) && v_v_615_2 + SelectionSort_~lh~4 <= 0) && 2 * SelectionSort_~lh~4 <= 0) && 2 * v_b_55_2 <= 10) && 2 * ~n <= 10) && v_v_615_2 + ~n <= 5) && v_b_55_2 <= SelectionSort_~lh~4 + 5) && 5 <= v_v_615_2 + v_b_55_2) && v_b_55_2 <= ~n) && 5 <= SelectionSort_~lh~4 + ~n) && 10 <= 2 * ~n) && v_v_615_2 + 5 <= v_b_55_2) && v_b_54_2 + 5 <= v_b_55_2) && v_v_615_2 + v_b_55_2 <= 5) && v_v_615_2 <= SelectionSort_~lh~4) && SelectionSort_~lh~4 + 5 <= v_b_55_2) && ~n <= v_b_55_2) && SelectionSort_~lh~4 + ~n <= 5) && SelectionSort_~lh~4 + v_b_55_2 <= 5) && 2 * v_v_615_2 <= 0) && 2 * v_b_54_2 <= 0) && ~n <= v_v_615_2 + 5) && SelectionSort_~lh~4 + v_b_54_2 <= 0) && SelectionSort_~lh~4 + 5 <= ~n) && v_v_615_2 + v_b_54_2 <= 0) && 5 <= v_b_55_2 + v_b_54_2) && v_b_54_2 + 5 <= ~n) && 0 <= 2 * v_v_615_2) && (forall v_idx_69 : int, v_idx_67 : int, v_idx_68 : int :: (((v_b_54_2 <= v_idx_67 || v_idx_69 < v_b_55_2) || (((((((((((((((((~array[v_idx_68] + ~n <= 5 && 0 <= ~array[v_idx_68] + v_b_54_2) && ~n <= ~array[v_idx_68] + 5) && ~array[v_idx_68] <= v_b_54_2) && SelectionSort_~lh~4 <= ~array[v_idx_68]) && ~array[v_idx_68] <= SelectionSort_~lh~4) && ~array[v_idx_68] + v_b_55_2 <= 5) && ~array[v_idx_68] + 5 <= ~n) && v_b_54_2 <= ~array[v_idx_68]) && 0 <= 2 * ~array[v_idx_68]) && v_b_55_2 <= ~array[v_idx_68] + 5) && 0 <= SelectionSort_~lh~4 + ~array[v_idx_68]) && SelectionSort_~lh~4 + ~array[v_idx_68] <= 0) && 5 <= ~array[v_idx_68] + v_b_55_2) && 2 * ~array[v_idx_68] <= 0) && ~array[v_idx_68] + v_b_54_2 <= 0) && ~array[v_idx_68] + 5 <= v_b_55_2) && 5 <= ~array[v_idx_68] + ~n)) || v_idx_68 < v_b_54_2) || v_b_55_2 <= v_idx_68)) && 0 <= 2 * v_b_54_2) && 5 <= v_v_615_2 + ~n) && v_b_55_2 + ~n <= 10) && v_v_615_2 + 5 <= ~n) && SelectionSort_~lh~4 <= v_v_615_2) && 5 <= ~n + v_b_54_2) && v_b_54_2 <= v_v_615_2) && v_b_54_2 <= SelectionSort_~lh~4) && v_b_55_2 <= v_b_54_2 + 5) && 10 <= 2 * v_b_55_2) && 0 <= SelectionSort_~lh~4 + v_b_54_2) && v_b_55_2 <= v_v_615_2 + 5) && 10 <= v_b_55_2 + ~n) && 5 <= SelectionSort_~lh~4 + v_b_55_2) && 0 <= 2 * SelectionSort_~lh~4) && ~n <= v_b_54_2 + 5) && v_b_55_2 + v_b_54_2 <= 5) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (exists v_v_615_2 : int, v_b_55_2 : int, v_b_54_2 : int :: (((((((((((((((((((((((((((((((((((((((((((((((((0 <= v_v_615_2 + v_b_54_2 && ~n + v_b_54_2 <= 5) && main_~i~7 + 1 <= ~n) && v_v_615_2 <= v_b_54_2) && main_~i~7 + v_b_55_2 <= 9) && 2 * v_b_55_2 <= 10) && 2 * ~n <= 10) && main_~i~7 + ~n <= 9) && v_v_615_2 + main_~i~7 <= 4) && 2 * main_~i~7 <= 8) && v_v_615_2 + ~n <= 5) && 5 <= v_v_615_2 + v_b_55_2) && v_b_55_2 <= ~n) && 0 <= main_~i~7 + v_b_54_2 + 1) && 10 <= 2 * ~n) && v_b_54_2 <= main_~i~7 + 1) && (forall v_idx_63 : int, v_idx_61 : int, v_idx_62 : int :: (((v_b_55_2 <= v_idx_62 || v_idx_62 < v_b_54_2) || v_b_54_2 <= v_idx_61) || v_idx_63 < v_b_55_2) || (((((((((((((((((~array[v_idx_62] + ~n <= 5 && 5 <= ~array[v_idx_62] + ~n) && main_~i~7 + ~array[v_idx_62] <= 4) && ~array[v_idx_62] + 5 <= ~n) && ~array[v_idx_62] + v_b_54_2 <= 0) && ~array[v_idx_62] <= main_~i~7 + 1) && ~array[v_idx_62] <= v_b_54_2) && 5 <= ~array[v_idx_62] + v_b_55_2) && 0 <= 2 * ~array[v_idx_62]) && 0 <= ~array[v_idx_62] + v_b_54_2) && main_~i~7 <= ~array[v_idx_62] + 4) && 0 <= main_~i~7 + ~array[v_idx_62] + 1) && ~n <= ~array[v_idx_62] + 5) && 2 * ~array[v_idx_62] <= 0) && v_b_54_2 <= ~array[v_idx_62]) && ~array[v_idx_62] + 5 <= v_b_55_2) && ~array[v_idx_62] + v_b_55_2 <= 5) && v_b_55_2 <= ~array[v_idx_62] + 5))) && 0 <= 2 * main_~i~7 + 2) && v_v_615_2 + 5 <= v_b_55_2) && v_b_54_2 + 5 <= v_b_55_2) && 4 <= main_~i~7 + v_b_55_2) && v_v_615_2 + v_b_55_2 <= 5) && v_b_55_2 <= main_~i~7 + 6) && ~n <= main_~i~7 + 6) && ~n <= v_b_55_2) && main_~i~7 + v_b_54_2 <= 4) && 2 * v_v_615_2 <= 0) && main_~i~7 + 1 <= v_b_55_2) && 2 * v_b_54_2 <= 0) && ~n <= v_v_615_2 + 5) && v_v_615_2 + v_b_54_2 <= 0) && 5 <= v_b_55_2 + v_b_54_2) && v_b_54_2 + 5 <= ~n) && v_v_615_2 <= main_~i~7 + 1) && 4 <= main_~i~7 + ~n) && main_~i~7 <= v_b_54_2 + 4) && 0 <= 2 * v_v_615_2) && 0 <= 2 * v_b_54_2) && 5 <= v_v_615_2 + ~n) && v_b_55_2 + ~n <= 10) && v_v_615_2 + 5 <= ~n) && 5 <= ~n + v_b_54_2) && v_b_54_2 <= v_v_615_2) && v_b_55_2 <= v_b_54_2 + 5) && 10 <= 2 * v_b_55_2) && v_b_55_2 <= v_v_615_2 + 5) && 10 <= v_b_55_2 + ~n) && ~n <= v_b_54_2 + 5) && v_b_55_2 + v_b_54_2 <= 5) && main_~i~7 <= v_v_615_2 + 4) && 0 <= v_v_615_2 + main_~i~7 + 1) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (2 * main_~i~7 <= 8 && 4 <= main_~i~7 + ~n) && (exists v_v_615_2 : int, v_b_55_2 : int, v_b_54_2 : int :: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((5 <= SelectionSort_~rh~4 + v_b_55_2 && ~n + v_b_54_2 <= 5) && ~n <= SelectionSort_~lh~4 + 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~lh~4 <= v_b_54_2) && v_v_615_2 + SelectionSort_~lh~4 <= 0) && 2 * SelectionSort_~lh~4 <= 0) && v_b_55_2 <= SelectionSort_~i~4 + 4) && v_v_615_2 <= SelectionSort_~rh~4) && v_v_615_2 + ~n <= 5) && 0 <= SelectionSort_~lh~4 + SelectionSort_~rh~4) && SelectionSort_~i~4 + ~n <= 6) && SelectionSort_~i~4 + SelectionSort_~rh~4 <= 1) && SelectionSort_~lh~4 + SelectionSort_~i~4 <= 1) && v_v_615_2 + 5 <= v_b_55_2) && v_b_54_2 + 5 <= v_b_55_2) && 1 <= SelectionSort_~i~4 + v_b_54_2) && SelectionSort_~rh~4 + 5 <= v_b_55_2) && SelectionSort_~rh~4 + v_b_54_2 <= 0) && v_v_615_2 <= SelectionSort_~lh~4) && SelectionSort_~lh~4 + 5 <= v_b_55_2) && 1 <= SelectionSort_~i~4 + SelectionSort_~rh~4) && SelectionSort_~rh~4 <= SelectionSort_~lh~4) && SelectionSort_~lh~4 + ~n <= 5) && SelectionSort_~rh~4 <= v_b_54_2) && 2 * v_v_615_2 <= 0) && (forall v_idx_72 : int, v_idx_70 : int, v_idx_71 : int :: (((v_idx_72 < v_b_55_2 || v_b_54_2 <= v_idx_70) || v_b_55_2 <= v_idx_71) || v_idx_71 < v_b_54_2) || (((((((((((((((((((((((((2 * ~array[v_idx_71] <= 0 && SelectionSort_~lh~4 <= ~array[v_idx_71]) && 0 <= 2 * ~array[v_idx_71]) && ~array[v_idx_71] <= SelectionSort_~lh~4) && ~array[v_idx_71] <= SelectionSort_~rh~4) && ~array[v_idx_71] + 5 <= v_b_55_2) && 1 <= SelectionSort_~i~4 + ~array[v_idx_71]) && SelectionSort_~rh~4 + ~array[v_idx_71] <= 0) && ~n + ~array[v_idx_71] <= 5) && v_b_54_2 <= ~array[v_idx_71]) && ~array[v_idx_71] + 1 <= SelectionSort_~i~4) && 0 <= SelectionSort_~rh~4 + ~array[v_idx_71]) && 5 <= v_b_55_2 + ~array[v_idx_71]) && 0 <= v_b_54_2 + ~array[v_idx_71]) && SelectionSort_~rh~4 <= ~array[v_idx_71]) && SelectionSort_~i~4 <= ~array[v_idx_71] + 1) && v_b_55_2 + ~array[v_idx_71] <= 5) && v_b_55_2 <= ~array[v_idx_71] + 5) && ~n <= ~array[v_idx_71] + 5) && ~array[v_idx_71] + 5 <= ~n) && 0 <= SelectionSort_~lh~4 + ~array[v_idx_71]) && ~array[v_idx_71] <= v_b_54_2) && v_b_54_2 + ~array[v_idx_71] <= 0) && 5 <= ~n + ~array[v_idx_71]) && SelectionSort_~i~4 + ~array[v_idx_71] <= 1) && SelectionSort_~lh~4 + ~array[v_idx_71] <= 0))) && SelectionSort_~rh~4 + 1 <= SelectionSort_~i~4) && SelectionSort_~rh~4 <= v_v_615_2) && SelectionSort_~i~4 + 4 <= v_b_55_2) && 2 * v_b_54_2 <= 0) && v_v_615_2 + 1 <= SelectionSort_~i~4) && SelectionSort_~lh~4 + v_b_54_2 <= 0) && SelectionSort_~rh~4 + 5 <= ~n) && 5 <= v_b_55_2 + v_b_54_2) && 5 <= v_v_615_2 + ~n) && SelectionSort_~i~4 <= v_b_54_2 + 1) && v_b_55_2 + ~n <= 10) && v_v_615_2 + 5 <= ~n) && 0 <= v_v_615_2 + SelectionSort_~rh~4) && v_b_54_2 <= v_v_615_2) && SelectionSort_~lh~4 <= SelectionSort_~rh~4) && v_b_55_2 <= v_b_54_2 + 5) && 1 <= SelectionSort_~lh~4 + SelectionSort_~i~4) && 0 <= SelectionSort_~lh~4 + v_b_54_2) && v_b_55_2 <= v_v_615_2 + 5) && 5 <= SelectionSort_~lh~4 + v_b_55_2) && v_v_615_2 + SelectionSort_~rh~4 <= 0) && 6 <= SelectionSort_~i~4 + ~n) && 2 <= 2 * SelectionSort_~i~4) && 0 <= v_v_615_2 + SelectionSort_~lh~4) && 0 <= v_v_615_2 + v_b_54_2) && SelectionSort_~i~4 + v_b_54_2 <= 1) && v_v_615_2 <= v_b_54_2) && 2 * v_b_55_2 <= 10) && 2 * ~n <= 10) && v_b_55_2 <= SelectionSort_~rh~4 + 5) && ~n <= SelectionSort_~i~4 + 4) && SelectionSort_~rh~4 + v_b_55_2 <= 5) && v_b_55_2 <= SelectionSort_~lh~4 + 5) && 5 <= v_v_615_2 + v_b_55_2) && v_b_55_2 <= ~n) && 5 <= SelectionSort_~lh~4 + ~n) && 10 <= 2 * ~n) && v_b_54_2 + 1 <= SelectionSort_~i~4) && SelectionSort_~i~4 + 4 <= ~n) && SelectionSort_~lh~4 + SelectionSort_~rh~4 <= 0) && v_v_615_2 + v_b_55_2 <= 5) && ~n <= v_b_55_2) && SelectionSort_~lh~4 + v_b_55_2 <= 5) && 2 * SelectionSort_~rh~4 <= 0) && ~n <= v_v_615_2 + 5) && 1 <= v_v_615_2 + SelectionSort_~i~4) && SelectionSort_~lh~4 + 5 <= ~n) && v_v_615_2 + v_b_54_2 <= 0) && SelectionSort_~i~4 <= SelectionSort_~rh~4 + 1) && v_b_54_2 + 5 <= ~n) && 0 <= 2 * v_v_615_2) && 5 <= SelectionSort_~rh~4 + ~n) && 6 <= SelectionSort_~i~4 + v_b_55_2) && 0 <= 2 * v_b_54_2) && v_b_54_2 <= SelectionSort_~rh~4) && ~n <= SelectionSort_~rh~4 + 5) && SelectionSort_~lh~4 <= v_v_615_2) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && SelectionSort_~i~4 + v_b_55_2 <= 6) && 5 <= ~n + v_b_54_2) && 2 * SelectionSort_~i~4 <= 2) && v_b_54_2 <= SelectionSort_~lh~4) && 10 <= 2 * v_b_55_2) && 0 <= SelectionSort_~rh~4 + v_b_54_2) && 0 <= 2 * SelectionSort_~rh~4) && 10 <= v_b_55_2 + ~n) && v_v_615_2 + SelectionSort_~i~4 <= 1) && 0 <= 2 * SelectionSort_~lh~4) && SelectionSort_~i~4 <= v_v_615_2 + 1) && ~n <= v_b_54_2 + 5) && v_b_55_2 + v_b_54_2 <= 5) && SelectionSort_~rh~4 + ~n <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 30.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 12 SDslu, 5 SDs, 0 SdLazy, 6 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.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, 23.4s 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, 1427 HoareAnnotationTreeSize, 4 FomulaSimplifications, 507 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 909 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s 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...