java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:04:45,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:04:45,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:04:45,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:04:45,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:04:45,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:04:45,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:04:45,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:04:45,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:04:45,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:04:45,494 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:04:45,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:04:45,495 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:04:45,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:04:45,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:04:45,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:04:45,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:04:45,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:04:45,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:04:45,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:04:45,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:04:45,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:04:45,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:04:45,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:04:45,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:04:45,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:04:45,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:04:45,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:04:45,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:04:45,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:04:45,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:04:45,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:04:45,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:04:45,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:04:45,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:04:45,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:04:45,520 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 13:04:45,534 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:04:45,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:04:45,536 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:04:45,536 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:04:45,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:04:45,536 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:04:45,537 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:04:45,537 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:04:45,537 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:04:45,538 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:04:45,538 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:04:45,538 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:04:45,538 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:04:45,539 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:04:45,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:04:45,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:04:45,540 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:04:45,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:04:45,541 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:04:45,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:04:45,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:04:45,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:04:45,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:04:45,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:04:45,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:04:45,542 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:04:45,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:04:45,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:04:45,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:04:45,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:04:45,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:04:45,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:04:45,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:04:45,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:04:45,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:04:45,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:04:45,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:04:45,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:04:45,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:04:45,546 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:04:45,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:04:45,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:04:45,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:04:45,618 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:04:45,619 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:04:45,619 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-02-28 13:04:45,620 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-02-28 13:04:45,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:04:45,673 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:04:45,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:04:45,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:04:45,674 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:04:45,691 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,704 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:04:45,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:04:45,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:04:45,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:04:45,725 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,726 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,727 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,727 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,732 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,734 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,735 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 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:04:45,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:04:45,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:04:45,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:04:45,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:04:45,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:04:45,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:04:46,260 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-28 13:04:46,262 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:04:46,262 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-02-28 13:04:46,263 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:04:46 BoogieIcfgContainer [2019-02-28 13:04:46,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:04:46,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:04:46,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:04:46,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:04:46,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/2) ... [2019-02-28 13:04:46,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1f3ab2 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:04:46, skipping insertion in model container [2019-02-28 13:04:46,270 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 28.02 01:04:46" (2/2) ... [2019-02-28 13:04:46,271 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-02-28 13:04:46,281 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:04:46,290 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:04:46,306 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:04:46,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:04:46,344 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:04:46,344 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:04:46,344 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:04:46,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:04:46,345 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:04:46,345 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:04:46,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:04:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 13:04:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:04:46,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:46,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:04:46,383 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-28 13:04:46,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:46,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:46,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:46,569 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {11#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:46,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= 4 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {10#false} is VALID [2019-02-28 13:04:46,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2019-02-28 13:04:46,572 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-02-28 13:04:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:46,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:46,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:46,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:46,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 13:04:46,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:46,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:04:46,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:46,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:04:46,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:04:46,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:04:46,634 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 13:04:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:46,768 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-28 13:04:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:04:46,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 13:04:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:04:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-28 13:04:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:04:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-28 13:04:46,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-02-28 13:04:46,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:46,892 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:04:46,892 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:04:46,896 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-02-28 13:04:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:04:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 13:04:46,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:46,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-28 13:04:46,938 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:04:46,938 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:04:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:46,940 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-28 13:04:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-28 13:04:46,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:46,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:46,941 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:04:46,942 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:04:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:46,943 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-28 13:04:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-28 13:04:46,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:46,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:46,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:46,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:04:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-02-28 13:04:46,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-02-28 13:04:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:46,948 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-02-28 13:04:46,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:04:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-28 13:04:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:04:46,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:46,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:04:46,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-02-28 13:04:46,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:46,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:46,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:46,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:47,124 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {61#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:47,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {62#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:47,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {60#false} is VALID [2019-02-28 13:04:47,151 INFO L273 TraceCheckUtils]: 3: Hoare triple {60#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {60#false} is VALID [2019-02-28 13:04:47,152 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2019-02-28 13:04:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:47,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:47,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:04:47,154 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 13:04:47,158 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-02-28 13:04:47,217 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:04:47,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:04:47,428 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 13:04:47,430 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:04:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:47,434 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 13:04:47,475 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 13:04:47,534 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-28 13:04:47,557 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 13:04:47,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 13:04:47,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-02-28 13:04:47,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:47,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:04:47,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:47,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:47,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:47,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:47,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:47,570 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-02-28 13:04:48,194 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:48,194 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:48,195 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:48,196 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,196 WARN L224 ngHoareTripleChecker]: Pre: {93#(= c_~n 5)} [2019-02-28 13:04:48,197 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; [2019-02-28 13:04:48,197 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) [2019-02-28 13:04:48,198 WARN L230 ngHoareTripleChecker]: Post: {94#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,198 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:48,199 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,199 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:48,229 WARN L270 ngHoareTripleChecker]: Pre: {93#(= ~n 5)} [2019-02-28 13:04:48,229 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; [2019-02-28 13:04:48,230 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) [2019-02-28 13:04:48,243 WARN L276 ngHoareTripleChecker]: Post: {94#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,244 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,244 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:48,244 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:48,245 WARN L628 ntHoareTripleChecker]: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) (assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2;) [2019-02-28 13:04:48,245 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:48,245 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,266 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:48,266 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:48,267 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:48,267 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,267 WARN L224 ngHoareTripleChecker]: Pre: {101#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,267 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:48,268 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:48,268 WARN L230 ngHoareTripleChecker]: Post: {102#false} [2019-02-28 13:04:48,268 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:48,269 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,269 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:48,336 WARN L270 ngHoareTripleChecker]: Pre: {101#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,336 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:48,337 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:48,368 WARN L276 ngHoareTripleChecker]: Post: {102#false} [2019-02-28 13:04:48,368 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,368 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:48,369 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~i~7 = 1Z \ {0}; ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2019-02-28 13:04:48,369 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2019-02-28 13:04:48,370 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:48,370 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,431 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:48,431 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:48,432 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:48,432 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,432 WARN L224 ngHoareTripleChecker]: Pre: {106#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,432 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2019-02-28 13:04:48,433 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2019-02-28 13:04:48,433 WARN L230 ngHoareTripleChecker]: Post: {107#false} [2019-02-28 13:04:48,433 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:48,433 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,433 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:48,446 WARN L270 ngHoareTripleChecker]: Pre: {106#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,446 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2019-02-28 13:04:48,447 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2019-02-28 13:04:48,452 WARN L276 ngHoareTripleChecker]: Post: {107#false} [2019-02-28 13:04:48,452 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,452 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:48,453 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~i~7 = 1Z \ {0}; ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2019-02-28 13:04:48,453 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) (assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0;) [2019-02-28 13:04:48,453 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:48,453 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,557 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:48,557 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:48,558 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:48,558 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,558 WARN L224 ngHoareTripleChecker]: Pre: {114#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,558 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:48,559 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:48,559 WARN L230 ngHoareTripleChecker]: Post: {115#false} [2019-02-28 13:04:48,559 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:48,560 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,560 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:48,613 WARN L270 ngHoareTripleChecker]: Pre: {114#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:48,613 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:48,613 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:48,617 WARN L276 ngHoareTripleChecker]: Post: {115#false} [2019-02-28 13:04:48,617 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,617 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:48,618 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~i~7 = 1Z \ {0}; ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2019-02-28 13:04:48,618 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2019-02-28 13:04:48,618 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:48,618 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,667 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:48,667 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:48,667 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:48,668 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,668 WARN L224 ngHoareTripleChecker]: Pre: {116#(= c_~n 5)} [2019-02-28 13:04:48,668 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2019-02-28 13:04:48,668 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2019-02-28 13:04:48,668 WARN L230 ngHoareTripleChecker]: Post: {117#false} [2019-02-28 13:04:48,668 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:48,669 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:48,669 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:48,674 WARN L270 ngHoareTripleChecker]: Pre: {116#(= ~n 5)} [2019-02-28 13:04:48,674 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2019-02-28 13:04:48,674 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2019-02-28 13:04:48,684 WARN L276 ngHoareTripleChecker]: Post: {117#false} [2019-02-28 13:04:48,685 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:48,685 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:48,685 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:48,685 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2019-02-28 13:04:48,686 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:48,686 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:49,330 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:49,330 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:49,331 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:49,331 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:49,331 WARN L224 ngHoareTripleChecker]: Pre: {122#(= c_~n 5)} [2019-02-28 13:04:49,331 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:49,331 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:49,332 WARN L230 ngHoareTripleChecker]: Post: {123#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:49,332 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:49,332 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:49,333 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:49,342 WARN L270 ngHoareTripleChecker]: Pre: {122#(= ~n 5)} [2019-02-28 13:04:49,342 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:49,342 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:49,347 WARN L276 ngHoareTripleChecker]: Post: {123#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:49,348 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:49,348 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:49,348 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:49,349 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2019-02-28 13:04:49,349 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:49,350 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:49,369 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:49,369 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:49,369 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:49,370 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:49,370 WARN L224 ngHoareTripleChecker]: Pre: {127#(= c_~n 5)} [2019-02-28 13:04:49,370 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:49,370 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:49,370 WARN L230 ngHoareTripleChecker]: Post: {128#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:49,371 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:49,371 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:49,371 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:49,376 WARN L270 ngHoareTripleChecker]: Pre: {127#(= ~n 5)} [2019-02-28 13:04:49,376 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:49,376 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:49,386 WARN L276 ngHoareTripleChecker]: Post: {128#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:49,387 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:49,387 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:49,387 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:49,387 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2019-02-28 13:04:49,388 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:49,388 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:49,395 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-28 13:04:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:49,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:04:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:04:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:04:49,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-28 13:04:49,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:49,428 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:04:49,428 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 13:04:49,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 13:04:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-28 13:04:49,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:49,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2019-02-28 13:04:49,458 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2019-02-28 13:04:49,458 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2019-02-28 13:04:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:49,460 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-28 13:04:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-28 13:04:49,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:49,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:49,461 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2019-02-28 13:04:49,461 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2019-02-28 13:04:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:49,462 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-28 13:04:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-28 13:04:49,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:49,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:49,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:49,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:04:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-02-28 13:04:49,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-02-28 13:04:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:49,464 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-02-28 13:04:49,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-28 13:04:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 13:04:49,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:49,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 13:04:49,465 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-02-28 13:04:49,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:49,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:49,615 INFO L273 TraceCheckUtils]: 0: Hoare triple {163#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {165#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:49,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {165#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {166#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:49,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {166#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {164#false} is VALID [2019-02-28 13:04:49,646 INFO L273 TraceCheckUtils]: 3: Hoare triple {164#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {164#false} is VALID [2019-02-28 13:04:49,646 INFO L273 TraceCheckUtils]: 4: Hoare triple {164#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {164#false} is VALID [2019-02-28 13:04:49,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {164#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {164#false} is VALID [2019-02-28 13:04:49,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {164#false} assume !false; {164#false} is VALID [2019-02-28 13:04:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 13:04:49,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:49,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:04:49,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 13:04:49,648 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-02-28 13:04:49,650 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:04:49,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:04:49,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 13:04:49,835 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 1 different actions 3 times. Never widened. Performed 82 root evaluator evaluations with a maximum evaluation depth of 4. Performed 82 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:04:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:49,836 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 13:04:49,919 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 13:04:49,967 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-02-28 13:04:50,094 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 13:04:50,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 13:04:50,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-02-28 13:04:50,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:50,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-28 13:04:50,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:50,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-28 13:04:50,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:50,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 13:04:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 13:04:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:50,137 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-02-28 13:04:52,590 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:52,590 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:52,591 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:52,592 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:52,592 WARN L224 ngHoareTripleChecker]: Pre: {212#(= c_~n 5)} [2019-02-28 13:04:52,592 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; [2019-02-28 13:04:52,593 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) [2019-02-28 13:04:52,593 WARN L230 ngHoareTripleChecker]: Post: {213#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:52,594 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:52,594 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:52,595 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:52,597 WARN L270 ngHoareTripleChecker]: Pre: {212#(= ~n 5)} [2019-02-28 13:04:52,597 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; [2019-02-28 13:04:52,597 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) [2019-02-28 13:04:52,609 WARN L276 ngHoareTripleChecker]: Post: {213#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:52,610 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:52,610 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:52,610 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:52,611 WARN L628 ntHoareTripleChecker]: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) (assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2;) [2019-02-28 13:04:52,611 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:52,611 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:52,617 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:52,617 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:52,618 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:52,618 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:52,619 WARN L224 ngHoareTripleChecker]: Pre: {214#(= c_~n 5)} [2019-02-28 13:04:52,619 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; [2019-02-28 13:04:52,619 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) [2019-02-28 13:04:52,620 WARN L230 ngHoareTripleChecker]: Post: {215#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:52,620 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:52,620 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:52,621 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:52,622 WARN L270 ngHoareTripleChecker]: Pre: {214#(= ~n 5)} [2019-02-28 13:04:52,623 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; [2019-02-28 13:04:52,623 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) [2019-02-28 13:04:52,654 WARN L276 ngHoareTripleChecker]: Post: {215#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:52,655 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:52,734 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:52,734 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:52,734 WARN L628 ntHoareTripleChecker]: (and (<= 0 c_ULTIMATE.start_main_~i~7) (= c_ULTIMATE.start_main_~array~7_primed (store c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7 c_ULTIMATE.start_main_~i~7)) (= c_ULTIMATE.start_main_~i~7 (+ c_ULTIMATE.start_main_~i~7_primed 1))) (assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2;) [2019-02-28 13:04:52,735 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:52,735 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,531 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:53,532 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:53,532 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:53,533 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,533 WARN L224 ngHoareTripleChecker]: Pre: {218#(= c_~n 5)} [2019-02-28 13:04:53,533 WARN L228 ngHoareTripleChecker]: Action: assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; [2019-02-28 13:04:53,533 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2019-02-28 13:04:53,534 WARN L230 ngHoareTripleChecker]: Post: {219#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,534 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:53,535 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,535 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:53,536 WARN L270 ngHoareTripleChecker]: Pre: {218#(= ~n 5)} [2019-02-28 13:04:53,537 WARN L274 ngHoareTripleChecker]: Action: assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; [2019-02-28 13:04:53,537 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2019-02-28 13:04:53,549 WARN L276 ngHoareTripleChecker]: Post: {219#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,549 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,550 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:53,550 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:53,550 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) (assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0;) [2019-02-28 13:04:53,551 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:53,551 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,559 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:53,560 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:53,560 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:53,560 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,561 WARN L224 ngHoareTripleChecker]: Pre: {222#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,561 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:53,561 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:53,561 WARN L230 ngHoareTripleChecker]: Post: {223#false} [2019-02-28 13:04:53,562 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:53,562 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,562 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:53,584 WARN L270 ngHoareTripleChecker]: Pre: {222#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,585 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:53,585 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:53,586 WARN L276 ngHoareTripleChecker]: Post: {223#false} [2019-02-28 13:04:53,586 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,586 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:53,587 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~i~7 = 1Z \ {0}; ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2019-02-28 13:04:53,587 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2019-02-28 13:04:53,587 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:53,587 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,614 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:53,614 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:53,614 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:53,615 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,615 WARN L224 ngHoareTripleChecker]: Pre: {230#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,615 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:53,615 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:53,615 WARN L230 ngHoareTripleChecker]: Post: {231#false} [2019-02-28 13:04:53,615 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:53,616 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,616 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:53,627 WARN L270 ngHoareTripleChecker]: Pre: {230#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,627 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:53,627 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:53,629 WARN L276 ngHoareTripleChecker]: Post: {231#false} [2019-02-28 13:04:53,629 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,630 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:53,630 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~i~4 = 1; ~n = 5; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ULTIMATE.start_SelectionSort_~i~4 = 1; ~n = 5; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2019-02-28 13:04:53,630 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2019-02-28 13:04:53,630 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:53,631 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,705 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:53,705 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:53,705 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:53,705 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,706 WARN L224 ngHoareTripleChecker]: Pre: {244#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,706 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2019-02-28 13:04:53,706 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2019-02-28 13:04:53,706 WARN L230 ngHoareTripleChecker]: Post: {245#false} [2019-02-28 13:04:53,706 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:53,707 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:53,707 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:53,714 WARN L270 ngHoareTripleChecker]: Pre: {244#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:53,714 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2019-02-28 13:04:53,714 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2019-02-28 13:04:53,716 WARN L276 ngHoareTripleChecker]: Post: {245#false} [2019-02-28 13:04:53,716 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:53,716 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:53,716 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~i~7 = 1Z \ {0}; ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2019-02-28 13:04:53,716 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) (assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0;) [2019-02-28 13:04:53,717 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:53,717 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:54,638 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:54,639 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:54,639 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:54,639 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:54,639 WARN L224 ngHoareTripleChecker]: Pre: {255#(= c_~n 5)} [2019-02-28 13:04:54,639 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2019-02-28 13:04:54,640 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2019-02-28 13:04:54,640 WARN L230 ngHoareTripleChecker]: Post: {256#false} [2019-02-28 13:04:54,640 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:54,640 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:54,640 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:54,642 WARN L270 ngHoareTripleChecker]: Pre: {255#(= ~n 5)} [2019-02-28 13:04:54,642 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2019-02-28 13:04:54,642 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2019-02-28 13:04:54,645 WARN L276 ngHoareTripleChecker]: Post: {256#false} [2019-02-28 13:04:54,645 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:54,645 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:54,646 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:54,646 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2019-02-28 13:04:54,646 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-28 13:04:54,646 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:55,909 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:55,909 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:55,910 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:55,910 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:55,910 WARN L224 ngHoareTripleChecker]: Pre: {263#(= c_~n 5)} [2019-02-28 13:04:55,910 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:55,911 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:55,911 WARN L230 ngHoareTripleChecker]: Post: {264#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:55,911 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:55,912 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:55,912 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:55,914 WARN L270 ngHoareTripleChecker]: Pre: {263#(= ~n 5)} [2019-02-28 13:04:55,915 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:55,915 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:55,925 WARN L276 ngHoareTripleChecker]: Post: {264#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:55,925 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:55,925 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:55,925 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:55,926 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2019-02-28 13:04:55,926 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:55,926 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:55,932 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:55,932 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:55,932 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:55,933 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:55,933 WARN L224 ngHoareTripleChecker]: Pre: {265#(= c_~n 5)} [2019-02-28 13:04:55,933 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:55,933 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:55,933 WARN L230 ngHoareTripleChecker]: Post: {266#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:55,934 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:55,934 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:55,934 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:55,937 WARN L270 ngHoareTripleChecker]: Pre: {265#(= ~n 5)} [2019-02-28 13:04:55,937 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-28 13:04:55,938 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-02-28 13:04:55,943 WARN L276 ngHoareTripleChecker]: Post: {266#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:55,944 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:55,944 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:55,944 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:55,944 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2019-02-28 13:04:55,945 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:55,945 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:55,972 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:04:55,973 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:04:55,973 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:04:55,973 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:04:55,973 WARN L224 ngHoareTripleChecker]: Pre: {270#(= c_~n 5)} [2019-02-28 13:04:55,973 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:55,973 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:55,974 WARN L230 ngHoareTripleChecker]: Post: {271#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0) (not (= c_ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:55,974 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:04:55,974 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:04:55,974 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:04:55,976 WARN L270 ngHoareTripleChecker]: Pre: {270#(= ~n 5)} [2019-02-28 13:04:55,976 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2019-02-28 13:04:55,976 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2019-02-28 13:04:55,982 WARN L276 ngHoareTripleChecker]: Post: {271#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-28 13:04:55,982 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:04:55,982 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:04:55,983 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2019-02-28 13:04:55,983 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2019-02-28 13:04:55,983 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_main_~i~7 = 1Z \ {0}; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7 , }} [2019-02-28 13:04:55,984 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:04:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:55,988 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-02-28 13:04:55,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:04:55,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-28 13:04:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:04:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-02-28 13:04:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:04:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-02-28 13:04:55,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2019-02-28 13:04:56,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:56,047 INFO L225 Difference]: With dead ends: 14 [2019-02-28 13:04:56,048 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 13:04:56,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 13:04:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-28 13:04:56,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:56,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2019-02-28 13:04:56,068 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2019-02-28 13:04:56,068 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2019-02-28 13:04:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:56,070 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-02-28 13:04:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-02-28 13:04:56,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:56,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:56,071 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2019-02-28 13:04:56,071 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2019-02-28 13:04:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:56,072 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-02-28 13:04:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-02-28 13:04:56,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:56,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:56,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:56,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 13:04:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-02-28 13:04:56,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-02-28 13:04:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:56,074 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-02-28 13:04:56,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 13:04:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-02-28 13:04:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 13:04:56,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:56,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 13:04:56,075 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2019-02-28 13:04:56,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:56,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:56,155 INFO L273 TraceCheckUtils]: 0: Hoare triple {310#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {312#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:56,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {312#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {313#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:56,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {313#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {311#false} is VALID [2019-02-28 13:04:56,159 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {311#false} is VALID [2019-02-28 13:04:56,159 INFO L273 TraceCheckUtils]: 4: Hoare triple {311#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {311#false} is VALID [2019-02-28 13:04:56,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {311#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {311#false} is VALID [2019-02-28 13:04:56,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {311#false} is VALID [2019-02-28 13:04:56,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#false} assume !false; {311#false} is VALID [2019-02-28 13:04:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:56,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:56,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:04:56,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 13:04:56,161 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2019-02-28 13:04:56,162 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:04:56,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:04:56,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:04:56,386 INFO L272 AbstractInterpreter]: Visited 8 different actions 32 times. Merged at 4 different actions 12 times. Widened at 1 different actions 2 times. Performed 347 root evaluator evaluations with a maximum evaluation depth of 4. Performed 347 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-28 13:04:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:56,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:04:56,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:56,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:04:56,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:56,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:04:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:56,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 13:04:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:56,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:04:56,548 INFO L273 TraceCheckUtils]: 0: Hoare triple {310#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {312#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:56,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {312#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {313#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:56,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {313#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {311#false} is VALID [2019-02-28 13:04:56,572 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {311#false} is VALID [2019-02-28 13:04:56,572 INFO L273 TraceCheckUtils]: 4: Hoare triple {311#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {311#false} is VALID [2019-02-28 13:04:56,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {311#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {311#false} is VALID [2019-02-28 13:04:56,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {311#false} is VALID [2019-02-28 13:04:56,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#false} assume !false; {311#false} is VALID [2019-02-28 13:04:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:56,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:04:56,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#false} assume !false; {311#false} is VALID [2019-02-28 13:04:56,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {311#false} is VALID [2019-02-28 13:04:56,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {311#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {311#false} is VALID [2019-02-28 13:04:56,648 INFO L273 TraceCheckUtils]: 4: Hoare triple {311#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {311#false} is VALID [2019-02-28 13:04:56,648 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {311#false} is VALID [2019-02-28 13:04:56,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {353#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {311#false} is VALID [2019-02-28 13:04:56,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#(< 0 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {353#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:56,686 INFO L273 TraceCheckUtils]: 0: Hoare triple {310#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {357#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:56,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:04:56,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-28 13:04:56,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:04:56,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-28 13:04:56,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:56,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:56,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:56,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:56,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:56,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 13:04:56,724 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-02-28 13:04:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:56,843 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-02-28 13:04:56,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:56,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-28 13:04:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-28 13:04:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-28 13:04:56,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-02-28 13:04:56,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:56,897 INFO L225 Difference]: With dead ends: 16 [2019-02-28 13:04:56,897 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 13:04:56,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 13:04:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 13:04:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-28 13:04:56,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:56,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-02-28 13:04:56,913 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-28 13:04:56,914 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-28 13:04:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:56,915 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-28 13:04:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-28 13:04:56,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:56,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:56,916 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-28 13:04:56,916 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-28 13:04:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:56,917 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-28 13:04:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-28 13:04:56,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:56,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:56,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:56,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:04:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-02-28 13:04:56,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-02-28 13:04:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:56,920 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-02-28 13:04:56,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-28 13:04:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 13:04:56,920 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:56,920 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 13:04:56,921 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:56,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:56,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2019-02-28 13:04:56,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:56,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:56,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:57,061 INFO L273 TraceCheckUtils]: 0: Hoare triple {427#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {429#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {430#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {430#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {431#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,068 INFO L273 TraceCheckUtils]: 3: Hoare triple {431#(<= 2 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {428#false} is VALID [2019-02-28 13:04:57,069 INFO L273 TraceCheckUtils]: 4: Hoare triple {428#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {428#false} is VALID [2019-02-28 13:04:57,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {428#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {428#false} is VALID [2019-02-28 13:04:57,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {428#false} is VALID [2019-02-28 13:04:57,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {428#false} is VALID [2019-02-28 13:04:57,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {428#false} assume !false; {428#false} is VALID [2019-02-28 13:04:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:57,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:57,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:04:57,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:04:57,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:04:57,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:57,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:04:57,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:04:57,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:04:57,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 13:04:57,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:04:57,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 13:04:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:57,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:04:57,158 INFO L273 TraceCheckUtils]: 0: Hoare triple {427#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {429#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {430#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {430#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {431#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,165 INFO L273 TraceCheckUtils]: 3: Hoare triple {431#(<= 2 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {428#false} is VALID [2019-02-28 13:04:57,165 INFO L273 TraceCheckUtils]: 4: Hoare triple {428#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {428#false} is VALID [2019-02-28 13:04:57,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {428#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {428#false} is VALID [2019-02-28 13:04:57,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {428#false} is VALID [2019-02-28 13:04:57,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {428#false} is VALID [2019-02-28 13:04:57,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {428#false} assume !false; {428#false} is VALID [2019-02-28 13:04:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:57,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:04:57,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {428#false} assume !false; {428#false} is VALID [2019-02-28 13:04:57,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {428#false} is VALID [2019-02-28 13:04:57,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {428#false} is VALID [2019-02-28 13:04:57,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {428#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {428#false} is VALID [2019-02-28 13:04:57,221 INFO L273 TraceCheckUtils]: 4: Hoare triple {428#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {428#false} is VALID [2019-02-28 13:04:57,224 INFO L273 TraceCheckUtils]: 3: Hoare triple {474#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {428#false} is VALID [2019-02-28 13:04:57,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {478#(< 0 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {474#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {431#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {478#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,227 INFO L273 TraceCheckUtils]: 0: Hoare triple {427#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {431#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:57,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:04:57,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-02-28 13:04:57,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:04:57,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-02-28 13:04:57,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:57,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-28 13:04:57,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:57,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 13:04:57,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 13:04:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:04:57,260 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-02-28 13:04:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:57,408 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-28 13:04:57,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:04:57,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-02-28 13:04:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:04:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-02-28 13:04:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:04:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-02-28 13:04:57,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2019-02-28 13:04:57,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:57,435 INFO L225 Difference]: With dead ends: 17 [2019-02-28 13:04:57,435 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 13:04:57,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:04:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 13:04:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 13:04:57,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:57,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-02-28 13:04:57,500 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-28 13:04:57,500 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-28 13:04:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:57,501 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-28 13:04:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-28 13:04:57,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:57,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:57,502 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-28 13:04:57,502 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-28 13:04:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:57,503 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-28 13:04:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-28 13:04:57,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:57,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:57,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:57,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 13:04:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-28 13:04:57,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-02-28 13:04:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:57,505 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-28 13:04:57,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 13:04:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-28 13:04:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 13:04:57,506 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:57,506 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 13:04:57,506 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2019-02-28 13:04:57,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:57,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:57,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:04:57,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:57,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:57,615 INFO L273 TraceCheckUtils]: 0: Hoare triple {557#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {559#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {559#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {560#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {560#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {561#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,619 INFO L273 TraceCheckUtils]: 3: Hoare triple {561#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {562#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,619 INFO L273 TraceCheckUtils]: 4: Hoare triple {562#(<= 1 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {558#false} is VALID [2019-02-28 13:04:57,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {558#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {558#false} is VALID [2019-02-28 13:04:57,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {558#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {558#false} is VALID [2019-02-28 13:04:57,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {558#false} is VALID [2019-02-28 13:04:57,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {558#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {558#false} is VALID [2019-02-28 13:04:57,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#false} assume !false; {558#false} is VALID [2019-02-28 13:04:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:57,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:57,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:04:57,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:04:57,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:04:57,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:57,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:04:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 13:04:57,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 13:04:57,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 13:04:57,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:04:57,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 13:04:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:57,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:04:57,753 INFO L273 TraceCheckUtils]: 0: Hoare triple {557#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {559#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {559#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {560#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {560#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {561#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,756 INFO L273 TraceCheckUtils]: 3: Hoare triple {561#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {562#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,758 INFO L273 TraceCheckUtils]: 4: Hoare triple {562#(<= 1 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {558#false} is VALID [2019-02-28 13:04:57,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {558#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {558#false} is VALID [2019-02-28 13:04:57,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {558#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {558#false} is VALID [2019-02-28 13:04:57,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {558#false} is VALID [2019-02-28 13:04:57,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {558#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {558#false} is VALID [2019-02-28 13:04:57,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#false} assume !false; {558#false} is VALID [2019-02-28 13:04:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:57,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:04:57,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#false} assume !false; {558#false} is VALID [2019-02-28 13:04:57,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {558#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {558#false} is VALID [2019-02-28 13:04:57,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {558#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {558#false} is VALID [2019-02-28 13:04:57,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {558#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {558#false} is VALID [2019-02-28 13:04:57,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {558#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {558#false} is VALID [2019-02-28 13:04:57,827 INFO L273 TraceCheckUtils]: 4: Hoare triple {608#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {558#false} is VALID [2019-02-28 13:04:57,828 INFO L273 TraceCheckUtils]: 3: Hoare triple {562#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {608#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {561#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {562#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {560#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {561#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,830 INFO L273 TraceCheckUtils]: 0: Hoare triple {557#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {560#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:57,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:04:57,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-02-28 13:04:57,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:04:57,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-28 13:04:57,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:57,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:04:57,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:57,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:04:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:04:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:04:57,862 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-02-28 13:04:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:57,932 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-02-28 13:04:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 13:04:57,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-28 13:04:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:04:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-02-28 13:04:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:04:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-02-28 13:04:57,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2019-02-28 13:04:57,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:57,986 INFO L225 Difference]: With dead ends: 18 [2019-02-28 13:04:57,986 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 13:04:57,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:04:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 13:04:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 13:04:58,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:58,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-02-28 13:04:58,003 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-28 13:04:58,003 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-28 13:04:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:58,005 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-28 13:04:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-28 13:04:58,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:58,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:58,006 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-28 13:04:58,006 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-28 13:04:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:58,007 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-28 13:04:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-28 13:04:58,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:58,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:58,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:58,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 13:04:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-28 13:04:58,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-02-28 13:04:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:58,009 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-28 13:04:58,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 13:04:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-28 13:04:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 13:04:58,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:58,010 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 13:04:58,010 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:58,011 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2019-02-28 13:04:58,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:58,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:58,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:04:58,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:58,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:58,169 INFO L273 TraceCheckUtils]: 0: Hoare triple {699#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {701#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {702#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {703#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,175 INFO L273 TraceCheckUtils]: 3: Hoare triple {703#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {704#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,175 INFO L273 TraceCheckUtils]: 4: Hoare triple {704#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {705#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {700#false} is VALID [2019-02-28 13:04:58,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {700#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {700#false} is VALID [2019-02-28 13:04:58,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {700#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {700#false} is VALID [2019-02-28 13:04:58,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {700#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {700#false} is VALID [2019-02-28 13:04:58,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {700#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {700#false} is VALID [2019-02-28 13:04:58,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#false} assume !false; {700#false} is VALID [2019-02-28 13:04:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:58,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:58,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:04:58,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:04:58,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:04:58,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:58,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:04:58,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:58,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:04:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:58,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 13:04:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:58,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:04:58,275 INFO L273 TraceCheckUtils]: 0: Hoare triple {699#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {701#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {702#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {703#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,279 INFO L273 TraceCheckUtils]: 3: Hoare triple {703#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {704#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,280 INFO L273 TraceCheckUtils]: 4: Hoare triple {704#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {705#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {700#false} is VALID [2019-02-28 13:04:58,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {700#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {700#false} is VALID [2019-02-28 13:04:58,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {700#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {700#false} is VALID [2019-02-28 13:04:58,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {700#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {700#false} is VALID [2019-02-28 13:04:58,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {700#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {700#false} is VALID [2019-02-28 13:04:58,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#false} assume !false; {700#false} is VALID [2019-02-28 13:04:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:58,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:04:58,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#false} assume !false; {700#false} is VALID [2019-02-28 13:04:58,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {700#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {700#false} is VALID [2019-02-28 13:04:58,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {700#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {700#false} is VALID [2019-02-28 13:04:58,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {700#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {700#false} is VALID [2019-02-28 13:04:58,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {700#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {700#false} is VALID [2019-02-28 13:04:58,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {700#false} is VALID [2019-02-28 13:04:58,465 INFO L273 TraceCheckUtils]: 4: Hoare triple {704#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {705#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,465 INFO L273 TraceCheckUtils]: 3: Hoare triple {703#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {704#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {703#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {702#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,470 INFO L273 TraceCheckUtils]: 0: Hoare triple {699#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {701#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-28 13:04:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 13:04:58,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:04:58,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-02-28 13:04:58,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:04:58,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-28 13:04:58,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:58,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-28 13:04:58,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:58,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 13:04:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 13:04:58,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:04:58,505 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-28 13:04:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:58,648 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-02-28 13:04:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 13:04:58,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-28 13:04:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:04:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-02-28 13:04:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:04:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-02-28 13:04:58,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2019-02-28 13:04:58,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:58,698 INFO L225 Difference]: With dead ends: 19 [2019-02-28 13:04:58,698 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 13:04:58,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:04:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 13:04:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 13:04:58,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:58,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-02-28 13:04:58,752 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-02-28 13:04:58,752 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-02-28 13:04:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:58,754 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-28 13:04:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-28 13:04:58,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:58,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:58,754 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-02-28 13:04:58,754 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-02-28 13:04:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:58,755 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-28 13:04:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-28 13:04:58,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:58,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:58,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:58,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 13:04:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-02-28 13:04:58,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-02-28 13:04:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:58,757 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-02-28 13:04:58,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 13:04:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-28 13:04:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 13:04:58,758 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:58,758 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 13:04:58,758 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:58,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:58,758 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2019-02-28 13:04:58,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:58,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:58,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:58,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:58,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:58,845 INFO L273 TraceCheckUtils]: 0: Hoare triple {853#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {853#true} is VALID [2019-02-28 13:04:58,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {853#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {853#true} is VALID [2019-02-28 13:04:58,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {853#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {853#true} is VALID [2019-02-28 13:04:58,846 INFO L273 TraceCheckUtils]: 3: Hoare triple {853#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {853#true} is VALID [2019-02-28 13:04:58,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {853#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {853#true} is VALID [2019-02-28 13:04:58,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {853#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {853#true} is VALID [2019-02-28 13:04:58,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {853#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {853#true} is VALID [2019-02-28 13:04:58,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {853#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {855#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4)} is VALID [2019-02-28 13:04:58,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {855#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-28 13:04:58,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {857#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2019-02-28 13:04:58,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {857#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {854#false} is VALID [2019-02-28 13:04:58,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} assume !false; {854#false} is VALID [2019-02-28 13:04:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 13:04:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:58,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:04:58,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:04:58,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:04:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:04:58,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:04:58,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:04:58,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:04:58,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 13:04:58,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:04:58,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 13:04:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:58,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:04:59,114 INFO L273 TraceCheckUtils]: 0: Hoare triple {853#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {861#(<= 5 ~n)} is VALID [2019-02-28 13:04:59,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {861#(<= 5 ~n)} is VALID [2019-02-28 13:04:59,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {861#(<= 5 ~n)} is VALID [2019-02-28 13:04:59,151 INFO L273 TraceCheckUtils]: 3: Hoare triple {861#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {861#(<= 5 ~n)} is VALID [2019-02-28 13:04:59,163 INFO L273 TraceCheckUtils]: 4: Hoare triple {861#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {861#(<= 5 ~n)} is VALID [2019-02-28 13:04:59,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {861#(<= 5 ~n)} is VALID [2019-02-28 13:04:59,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#(<= 5 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {880#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-28 13:04:59,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {880#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {880#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-28 13:04:59,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {880#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {880#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-28 13:04:59,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {880#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {890#(and (<= ULTIMATE.start_SelectionSort_~lh~4 1) (<= 5 ~n))} is VALID [2019-02-28 13:04:59,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(and (<= ULTIMATE.start_SelectionSort_~lh~4 1) (<= 5 ~n))} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {854#false} is VALID [2019-02-28 13:04:59,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} assume !false; {854#false} is VALID [2019-02-28 13:04:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-02-28 13:04:59,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:04:59,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} assume !false; {854#false} is VALID [2019-02-28 13:04:59,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {857#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {854#false} is VALID [2019-02-28 13:04:59,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {857#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2019-02-28 13:04:59,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-28 13:04:59,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-28 13:04:59,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {912#(< 1 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {856#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-28 13:04:59,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {912#(< 1 ~n)} is VALID [2019-02-28 13:04:59,512 INFO L273 TraceCheckUtils]: 4: Hoare triple {912#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {912#(< 1 ~n)} is VALID [2019-02-28 13:04:59,512 INFO L273 TraceCheckUtils]: 3: Hoare triple {912#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {912#(< 1 ~n)} is VALID [2019-02-28 13:04:59,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {912#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {912#(< 1 ~n)} is VALID [2019-02-28 13:04:59,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {912#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {912#(< 1 ~n)} is VALID [2019-02-28 13:04:59,513 INFO L273 TraceCheckUtils]: 0: Hoare triple {853#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {912#(< 1 ~n)} is VALID [2019-02-28 13:04:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-02-28 13:04:59,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:04:59,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-02-28 13:04:59,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:04:59,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-28 13:04:59,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:59,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-28 13:04:59,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:59,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 13:04:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 13:04:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:04:59,559 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-02-28 13:04:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:59,823 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-02-28 13:04:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 13:04:59,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-28 13:04:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:04:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-02-28 13:04:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:04:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-02-28 13:04:59,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2019-02-28 13:04:59,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:59,906 INFO L225 Difference]: With dead ends: 21 [2019-02-28 13:04:59,906 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 13:04:59,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 13:04:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 13:04:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 13:04:59,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:59,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-02-28 13:04:59,966 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-02-28 13:04:59,966 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-02-28 13:04:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:59,969 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-02-28 13:04:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-28 13:04:59,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:59,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:59,969 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-02-28 13:04:59,970 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-02-28 13:04:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:59,971 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-02-28 13:04:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-28 13:04:59,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:59,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:59,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:59,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 13:04:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-02-28 13:04:59,973 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-02-28 13:04:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:59,973 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-02-28 13:04:59,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 13:04:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-28 13:04:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 13:04:59,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:59,974 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-02-28 13:04:59,974 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:04:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2019-02-28 13:04:59,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:59,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:04:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:59,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:00,057 INFO L273 TraceCheckUtils]: 0: Hoare triple {1051#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1051#true} is VALID [2019-02-28 13:05:00,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {1051#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1051#true} is VALID [2019-02-28 13:05:00,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {1051#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1051#true} is VALID [2019-02-28 13:05:00,058 INFO L273 TraceCheckUtils]: 3: Hoare triple {1051#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1051#true} is VALID [2019-02-28 13:05:00,058 INFO L273 TraceCheckUtils]: 4: Hoare triple {1051#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1051#true} is VALID [2019-02-28 13:05:00,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {1051#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1051#true} is VALID [2019-02-28 13:05:00,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {1051#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1051#true} is VALID [2019-02-28 13:05:00,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {1051#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1051#true} is VALID [2019-02-28 13:05:00,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {1051#true} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1051#true} is VALID [2019-02-28 13:05:00,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {1051#true} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1051#true} is VALID [2019-02-28 13:05:00,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {1051#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1053#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-28 13:05:00,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {1053#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1054#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} is VALID [2019-02-28 13:05:00,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {1054#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1052#false} is VALID [2019-02-28 13:05:00,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {1052#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1052#false} is VALID [2019-02-28 13:05:00,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {1052#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1052#false} is VALID [2019-02-28 13:05:00,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {1052#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1052#false} is VALID [2019-02-28 13:05:00,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {1052#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1052#false} is VALID [2019-02-28 13:05:00,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2019-02-28 13:05:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-02-28 13:05:00,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:05:00,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-28 13:05:00,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:05:00,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-02-28 13:05:00,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:00,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:05:00,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:00,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:05:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:05:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:05:00,081 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-02-28 13:05:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:00,205 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-02-28 13:05:00,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:05:00,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-02-28 13:05:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-28 13:05:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-28 13:05:00,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-02-28 13:05:00,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:00,224 INFO L225 Difference]: With dead ends: 29 [2019-02-28 13:05:00,224 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 13:05:00,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:05:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 13:05:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 13:05:00,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:00,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-02-28 13:05:00,295 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-02-28 13:05:00,296 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-02-28 13:05:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:00,297 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-02-28 13:05:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-28 13:05:00,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:00,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:00,299 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-02-28 13:05:00,299 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-02-28 13:05:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:00,301 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-02-28 13:05:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-28 13:05:00,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:00,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:00,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:00,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 13:05:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-02-28 13:05:00,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-02-28 13:05:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:00,303 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-02-28 13:05:00,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:05:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-28 13:05:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 13:05:00,304 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:00,304 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-02-28 13:05:00,304 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2019-02-28 13:05:00,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:00,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:05:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:00,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:00,653 INFO L273 TraceCheckUtils]: 0: Hoare triple {1197#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1197#true} is VALID [2019-02-28 13:05:00,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {1197#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1197#true} is VALID [2019-02-28 13:05:00,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {1197#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1197#true} is VALID [2019-02-28 13:05:00,655 INFO L273 TraceCheckUtils]: 3: Hoare triple {1197#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1197#true} is VALID [2019-02-28 13:05:00,655 INFO L273 TraceCheckUtils]: 4: Hoare triple {1197#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1197#true} is VALID [2019-02-28 13:05:00,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {1197#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1197#true} is VALID [2019-02-28 13:05:00,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {1197#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1197#true} is VALID [2019-02-28 13:05:00,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {1197#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1199#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-28 13:05:00,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {1199#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1200#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2019-02-28 13:05:00,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {1200#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1201#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-28 13:05:00,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {1201#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1202#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2019-02-28 13:05:00,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {1202#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1198#false} is VALID [2019-02-28 13:05:00,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:00,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:00,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {1198#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1198#false} is VALID [2019-02-28 13:05:00,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:00,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:00,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:00,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {1198#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1198#false} is VALID [2019-02-28 13:05:00,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2019-02-28 13:05:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-02-28 13:05:00,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:00,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:00,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:00,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:00,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:00,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:05:00,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:00,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:05:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:00,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 13:05:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:00,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:00,884 INFO L273 TraceCheckUtils]: 0: Hoare triple {1197#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1206#(<= 5 ~n)} is VALID [2019-02-28 13:05:00,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {1206#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1206#(<= 5 ~n)} is VALID [2019-02-28 13:05:00,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {1206#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1206#(<= 5 ~n)} is VALID [2019-02-28 13:05:00,891 INFO L273 TraceCheckUtils]: 3: Hoare triple {1206#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1206#(<= 5 ~n)} is VALID [2019-02-28 13:05:00,892 INFO L273 TraceCheckUtils]: 4: Hoare triple {1206#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1206#(<= 5 ~n)} is VALID [2019-02-28 13:05:00,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {1206#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1206#(<= 5 ~n)} is VALID [2019-02-28 13:05:00,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {1206#(<= 5 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1225#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-28 13:05:00,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {1225#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1229#(and (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 5 ~n))} is VALID [2019-02-28 13:05:00,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {1229#(and (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 5 ~n))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1233#(and (<= ULTIMATE.start_SelectionSort_~i~4 2) (<= 5 ~n))} is VALID [2019-02-28 13:05:00,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {1233#(and (<= ULTIMATE.start_SelectionSort_~i~4 2) (<= 5 ~n))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:00,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:00,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {1198#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1198#false} is VALID [2019-02-28 13:05:00,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:00,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:00,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {1198#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1198#false} is VALID [2019-02-28 13:05:00,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:00,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:00,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:00,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {1198#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1198#false} is VALID [2019-02-28 13:05:00,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2019-02-28 13:05:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-02-28 13:05:00,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:01,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2019-02-28 13:05:01,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {1198#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1198#false} is VALID [2019-02-28 13:05:01,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:01,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:01,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:01,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {1198#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1198#false} is VALID [2019-02-28 13:05:01,029 INFO L273 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:01,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {1198#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:01,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {1198#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1198#false} is VALID [2019-02-28 13:05:01,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {1198#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1198#false} is VALID [2019-02-28 13:05:01,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {1297#(< ULTIMATE.start_SelectionSort_~i~4 ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1198#false} is VALID [2019-02-28 13:05:01,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {1301#(< (+ ULTIMATE.start_SelectionSort_~i~4 1) ~n)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1297#(< ULTIMATE.start_SelectionSort_~i~4 ~n)} is VALID [2019-02-28 13:05:01,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {1305#(< (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1301#(< (+ ULTIMATE.start_SelectionSort_~i~4 1) ~n)} is VALID [2019-02-28 13:05:01,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {1309#(< 2 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1305#(< (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-28 13:05:01,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {1309#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1309#(< 2 ~n)} is VALID [2019-02-28 13:05:01,033 INFO L273 TraceCheckUtils]: 4: Hoare triple {1309#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1309#(< 2 ~n)} is VALID [2019-02-28 13:05:01,034 INFO L273 TraceCheckUtils]: 3: Hoare triple {1309#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1309#(< 2 ~n)} is VALID [2019-02-28 13:05:01,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {1309#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1309#(< 2 ~n)} is VALID [2019-02-28 13:05:01,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {1309#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1309#(< 2 ~n)} is VALID [2019-02-28 13:05:01,036 INFO L273 TraceCheckUtils]: 0: Hoare triple {1197#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1309#(< 2 ~n)} is VALID [2019-02-28 13:05:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-02-28 13:05:01,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:05:01,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-02-28 13:05:01,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:05:01,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-02-28 13:05:01,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:01,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-28 13:05:01,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:01,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 13:05:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 13:05:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-02-28 13:05:01,108 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-02-28 13:05:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:01,767 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-02-28 13:05:01,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 13:05:01,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-02-28 13:05:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:05:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-02-28 13:05:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 13:05:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-02-28 13:05:01,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2019-02-28 13:05:01,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:01,822 INFO L225 Difference]: With dead ends: 39 [2019-02-28 13:05:01,822 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 13:05:01,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-02-28 13:05:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 13:05:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-28 13:05:01,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:01,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2019-02-28 13:05:01,918 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-02-28 13:05:01,918 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-02-28 13:05:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:01,919 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-28 13:05:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-28 13:05:01,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:01,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:01,919 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-02-28 13:05:01,920 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-02-28 13:05:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:01,921 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-28 13:05:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-28 13:05:01,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:01,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:01,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:01,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 13:05:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-02-28 13:05:01,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-02-28 13:05:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:01,923 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-02-28 13:05:01,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 13:05:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-28 13:05:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 13:05:01,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:01,924 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-02-28 13:05:01,924 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:05:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2019-02-28 13:05:01,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:01,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:01,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:01,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:02,099 INFO L273 TraceCheckUtils]: 0: Hoare triple {1516#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1516#true} is VALID [2019-02-28 13:05:02,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,100 INFO L273 TraceCheckUtils]: 3: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,100 INFO L273 TraceCheckUtils]: 4: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {1516#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1516#true} is VALID [2019-02-28 13:05:02,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {1516#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1518#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-28 13:05:02,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {1518#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1519#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2019-02-28 13:05:02,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {1519#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1520#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 3))} is VALID [2019-02-28 13:05:02,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {1520#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 3))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1521#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2019-02-28 13:05:02,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {1521#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1522#(<= ~n (+ ULTIMATE.start_SelectionSort_~i~4 1))} is VALID [2019-02-28 13:05:02,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {1522#(<= ~n (+ ULTIMATE.start_SelectionSort_~i~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1523#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2019-02-28 13:05:02,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {1523#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1517#false} is VALID [2019-02-28 13:05:02,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {1517#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1517#false} is VALID [2019-02-28 13:05:02,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {1517#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1517#false} is VALID [2019-02-28 13:05:02,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {1517#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1517#false} is VALID [2019-02-28 13:05:02,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {1517#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1517#false} is VALID [2019-02-28 13:05:02,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {1517#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1517#false} is VALID [2019-02-28 13:05:02,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {1517#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1517#false} is VALID [2019-02-28 13:05:02,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {1517#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1517#false} is VALID [2019-02-28 13:05:02,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2019-02-28 13:05:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-02-28 13:05:02,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:02,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:05:02,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:05:02,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:05:02,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:05:02,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:05:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:05:02,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:05:02,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 13:05:02,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:05:02,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 13:05:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:02,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:05:02,200 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 13:05:02,203 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:05:02,219 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:05:02,220 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-28 13:05:02,222 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:05:02,222 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~array~7_26, v_ULTIMATE.start_main_~i~7_44]. (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (store v_ULTIMATE.start_main_~array~7_26 v_ULTIMATE.start_main_~i~7_44 v_ULTIMATE.start_main_~i~7_44) ULTIMATE.start_main_~array~7) (<= 0 v_ULTIMATE.start_main_~i~7_44)) [2019-02-28 13:05:02,223 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_ULTIMATE.start_main_~i~7_44]. (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)) [2019-02-28 13:05:02,537 INFO L273 TraceCheckUtils]: 0: Hoare triple {1516#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1516#true} is VALID [2019-02-28 13:05:02,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,538 INFO L273 TraceCheckUtils]: 3: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,538 INFO L273 TraceCheckUtils]: 4: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1542#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {1542#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,549 INFO L273 TraceCheckUtils]: 17: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2019-02-28 13:05:02,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {1546#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1517#false} is VALID [2019-02-28 13:05:02,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2019-02-28 13:05:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-02-28 13:05:02,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:05:02,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2019-02-28 13:05:02,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1517#false} is VALID [2019-02-28 13:05:02,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {1638#(or (<= 0 ULTIMATE.start_main_~i~7) (= (select ULTIMATE.start_main_~array~7 0) 0))} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1595#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-28 13:05:02,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1638#(or (<= 0 ULTIMATE.start_main_~i~7) (= (select ULTIMATE.start_main_~array~7 0) 0))} is VALID [2019-02-28 13:05:02,651 INFO L273 TraceCheckUtils]: 4: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,652 INFO L273 TraceCheckUtils]: 3: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {1516#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1516#true} is VALID [2019-02-28 13:05:02,652 INFO L273 TraceCheckUtils]: 0: Hoare triple {1516#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1516#true} is VALID [2019-02-28 13:05:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-02-28 13:05:02,680 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-28 13:05:02,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2019-02-28 13:05:02,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:05:02,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-02-28 13:05:02,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:02,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:05:02,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:02,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:05:02,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:05:02,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-02-28 13:05:02,703 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-02-28 13:05:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:03,100 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-28 13:05:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:05:03,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-02-28 13:05:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-02-28 13:05:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-02-28 13:05:03,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2019-02-28 13:05:03,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:03,141 INFO L225 Difference]: With dead ends: 26 [2019-02-28 13:05:03,141 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 13:05:03,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-02-28 13:05:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 13:05:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 13:05:03,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:03,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:03,143 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:03,143 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:03,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:05:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:05:03,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:03,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:03,144 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:03,144 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:05:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:03,145 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:05:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:05:03,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:03,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:03,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:03,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 13:05:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 13:05:03,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-02-28 13:05:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:03,146 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 13:05:03,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:05:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:05:03,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:03,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 13:05:03,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 13:05:03,370 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-02-28 13:05:03,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-02-28 13:05:03,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-02-28 13:05:03,530 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-02-28 13:05:03,530 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))) (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (<= .cse4 ULTIMATE.start_SelectionSort_~i~4)) (.cse3 (= ~n 5))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_SelectionSort_~i~4 .cse4) (<= .cse4 ~n)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n))))) [2019-02-28 13:05:03,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-02-28 13:05:03,530 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (= ~n 5)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse4 (<= ~n ULTIMATE.start_SelectionSort_~i~4))) (or (and .cse0 .cse1 .cse2 (<= .cse3 ~n) .cse4) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) .cse4))) [2019-02-28 13:05:03,530 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (= ~n 5))) (or (and (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44))) .cse0) (and (<= 4 ULTIMATE.start_main_~i~7) .cse0))) [2019-02-28 13:05:03,532 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-28 13:05:03,576 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-28 13:05:03,579 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-28 13:05:03,589 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:05:03 BoogieIcfgContainer [2019-02-28 13:05:03,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:05:03,591 INFO L168 Benchmark]: Toolchain (without parser) took 17919.10 ms. Allocated memory was 141.6 MB in the beginning and 341.3 MB in the end (delta: 199.8 MB). Free memory was 108.8 MB in the beginning and 100.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 208.2 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,592 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 141.6 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:05:03,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.12 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 107.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,593 INFO L168 Benchmark]: Boogie Preprocessor took 23.70 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,594 INFO L168 Benchmark]: RCFGBuilder took 526.22 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 92.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,594 INFO L168 Benchmark]: TraceAbstraction took 17325.07 ms. Allocated memory was 141.6 MB in the beginning and 341.3 MB in the end (delta: 199.8 MB). Free memory was 92.3 MB in the beginning and 100.3 MB in the end (delta: -8.0 MB). Peak memory consumption was 191.8 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,598 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 141.6 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.12 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 107.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.70 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.22 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 92.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17325.07 ms. Allocated memory was 141.6 MB in the beginning and 341.3 MB in the end (delta: 199.8 MB). Free memory was 92.3 MB in the beginning and 100.3 MB in the end (delta: -8.0 MB). Peak memory consumption was 191.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: ((((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 + 1 <= ~n) && ~n <= SelectionSort_~i~4) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 == 0) && !(main_~i~7 == 0))) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && ~n <= SelectionSort_~i~4) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44) && ~n == 5) || (4 <= main_~i~7 && ~n == 5) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~lh~4 + 1 <= ~n) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~lh~4 + 2 <= ~n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 17.2s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 50 SDslu, 66 SDs, 0 SdLazy, 133 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 30 NumberOfFragments, 238 HoareAnnotationTreeSize, 4 FomulaSimplifications, 999 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 218 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 285 ConstructedInterpolants, 15 QuantifiedInterpolants, 12611 SizeOfPredicates, 15 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 415/494 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...