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-1de736e-m [2019-02-14 16:18:54,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:18:54,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:18:54,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:18:54,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:18:54,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:18:54,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:18:54,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:18:54,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:18:54,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:18:54,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:18:54,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:18:54,045 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:18:54,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:18:54,047 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:18:54,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:18:54,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:18:54,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:18:54,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:18:54,054 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:18:54,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:18:54,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:18:54,059 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:18:54,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:18:54,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:18:54,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:18:54,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:18:54,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:18:54,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:18:54,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:18:54,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:18:54,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:18:54,075 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:18:54,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:18:54,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:18:54,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:18:54,079 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-14 16:18:54,104 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:18:54,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:18:54,105 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:18:54,105 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:18:54,108 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:18:54,109 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:18:54,109 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:18:54,109 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:18:54,109 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-14 16:18:54,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:18:54,110 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-14 16:18:54,110 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-14 16:18:54,110 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:18:54,110 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:18:54,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:18:54,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:18:54,111 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:18:54,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:18:54,113 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:18:54,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:18:54,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:18:54,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:18:54,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:18:54,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:18:54,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:18:54,114 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:18:54,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:18:54,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:18:54,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:18:54,115 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:18:54,115 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:18:54,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:18:54,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:18:54,116 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:18:54,116 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:18:54,116 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:18:54,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:18:54,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:18:54,117 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:18:54,117 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:18:54,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:18:54,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:18:54,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:18:54,181 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:18:54,181 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:18:54,182 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-14 16:18:54,183 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-02-14 16:18:54,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:18:54,260 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:18:54,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:18:54,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:18:54,261 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:18:54,282 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,295 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:18:54,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:18:54,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:18:54,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:18:54,320 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,320 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,322 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,322 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,330 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,337 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,338 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 14.02 04:18:54" (1/1) ... [2019-02-14 16:18:54,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:18:54,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:18:54,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:18:54,345 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:18:54,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:18:54,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:18:54,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:18:54,806 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-14 16:18:54,808 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:18:54,808 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-02-14 16:18:54,809 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:18:54 BoogieIcfgContainer [2019-02-14 16:18:54,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:18:54,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:18:54,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:18:54,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:18:54,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:18:54" (1/2) ... [2019-02-14 16:18:54,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caee348 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:18:54, skipping insertion in model container [2019-02-14 16:18:54,815 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 14.02 04:18:54" (2/2) ... [2019-02-14 16:18:54,817 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-02-14 16:18:54,827 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:18:54,837 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:18:54,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:18:54,897 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:18:54,897 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:18:54,897 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:18:54,898 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:18:54,898 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:18:54,898 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:18:54,898 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:18:54,898 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:18:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-14 16:18:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:18:54,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:18:54,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:18:54,939 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:18:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-14 16:18:54,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:18:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:55,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:18:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:55,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:18:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:18:55,148 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-14 16:18:55,154 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-14 16:18:55,154 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-14 16:18:55,155 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-02-14 16:18:55,157 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-14 16:18:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:18:55,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:18:55,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:18:55,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:18:55,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:18:55,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:18:55,196 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-14 16:18:55,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:18:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:18:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:18:55,209 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-14 16:18:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:55,369 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-14 16:18:55,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:18:55,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:18:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:18:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:18:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-14 16:18:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:18:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-14 16:18:55,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-02-14 16:18:55,500 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-14 16:18:55,509 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:18:55,510 INFO L226 Difference]: Without dead ends: 7 [2019-02-14 16:18:55,513 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-14 16:18:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-14 16:18:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-14 16:18:55,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:18:55,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-14 16:18:55,617 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:18:55,618 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:18:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:55,620 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-14 16:18:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-14 16:18:55,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:55,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:55,622 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:18:55,622 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:18:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:55,624 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-14 16:18:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-14 16:18:55,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:55,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:55,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:18:55,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:18:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:18:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-02-14 16:18:55,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-02-14 16:18:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:18:55,630 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-02-14 16:18:55,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:18:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-14 16:18:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:18:55,631 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:18:55,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:18:55,632 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:18:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-02-14 16:18:55,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:18:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:55,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:18:55,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:55,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:18:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:18:55,962 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-14 16:18:55,975 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-14 16:18:55,985 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-14 16:18:55,985 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-14 16:18:55,986 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2019-02-14 16:18:55,987 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-14 16:18:55,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:18:55,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:18:55,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-14 16:18:55,991 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-02-14 16:18:56,027 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:18:56,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:18:56,233 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-14 16:18:56,235 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-14 16:18:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:56,241 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-14 16:18:56,298 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-14 16:18:56,362 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-14 16:18:56,387 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-14 16:18:56,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-14 16:18:56,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-02-14 16:18:56,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:18:56,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:18:56,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:18:56,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:18:56,405 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-14 16:18:56,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:18:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:18:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:18:56,406 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-02-14 16:18:57,054 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:18:57,055 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:18:57,056 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:18:57,058 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,058 WARN L224 ngHoareTripleChecker]: Pre: {93#(= c_~n 5)} [2019-02-14 16:18:57,058 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-14 16:18:57,059 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-14 16:18:57,060 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-14 16:18:57,060 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:18:57,061 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,061 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:18:57,091 WARN L270 ngHoareTripleChecker]: Pre: {93#(= ~n 5)} [2019-02-14 16:18:57,091 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-14 16:18:57,092 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-14 16:18:57,111 WARN L276 ngHoareTripleChecker]: Post: {94#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:18:57,112 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,112 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:18:57,112 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-14 16:18:57,113 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-14 16:18:57,113 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-14 16:18:57,113 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,132 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:18:57,132 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:18:57,133 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:18:57,133 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,133 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-14 16:18:57,133 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:18:57,133 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-14 16:18:57,133 WARN L230 ngHoareTripleChecker]: Post: {102#false} [2019-02-14 16:18:57,134 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:18:57,134 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,134 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:18:57,186 WARN L270 ngHoareTripleChecker]: Pre: {101#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:18:57,186 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:18:57,186 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-14 16:18:57,191 WARN L276 ngHoareTripleChecker]: Post: {102#false} [2019-02-14 16:18:57,191 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,192 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:18:57,192 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-14 16:18:57,192 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-14 16:18:57,193 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:18:57,193 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,208 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:18:57,208 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:18:57,208 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:18:57,209 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,209 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-14 16:18:57,209 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-14 16:18:57,210 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-14 16:18:57,210 WARN L230 ngHoareTripleChecker]: Post: {107#false} [2019-02-14 16:18:57,210 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:18:57,211 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,211 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:18:57,298 WARN L270 ngHoareTripleChecker]: Pre: {106#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:18:57,299 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-14 16:18:57,299 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-14 16:18:57,308 WARN L276 ngHoareTripleChecker]: Post: {107#false} [2019-02-14 16:18:57,309 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,309 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:18:57,309 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-14 16:18:57,309 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-14 16:18:57,310 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:18:57,310 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,359 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:18:57,359 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:18:57,360 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:18:57,360 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,360 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-14 16:18:57,360 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-14 16:18:57,360 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-14 16:18:57,361 WARN L230 ngHoareTripleChecker]: Post: {115#false} [2019-02-14 16:18:57,361 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:18:57,362 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,362 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:18:57,376 WARN L270 ngHoareTripleChecker]: Pre: {114#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:18:57,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-14 16:18:57,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-14 16:18:57,380 WARN L276 ngHoareTripleChecker]: Post: {115#false} [2019-02-14 16:18:57,381 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,381 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:18:57,381 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-14 16:18:57,381 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-14 16:18:57,382 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:18:57,382 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,427 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:18:57,428 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:18:57,428 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:18:57,428 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,428 WARN L224 ngHoareTripleChecker]: Pre: {116#(= c_~n 5)} [2019-02-14 16:18:57,428 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-14 16:18:57,429 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-14 16:18:57,429 WARN L230 ngHoareTripleChecker]: Post: {117#false} [2019-02-14 16:18:57,429 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:18:57,429 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:18:57,429 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:18:57,432 WARN L270 ngHoareTripleChecker]: Pre: {116#(= ~n 5)} [2019-02-14 16:18:57,432 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-14 16:18:57,433 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-14 16:18:57,446 WARN L276 ngHoareTripleChecker]: Post: {117#false} [2019-02-14 16:18:57,446 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:18:57,446 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:18:57,447 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-14 16:18:57,447 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-14 16:18:57,447 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:18:57,447 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:18:58,115 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:18:58,116 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:18:58,116 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:18:58,116 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:18:58,117 WARN L224 ngHoareTripleChecker]: Pre: {122#(= c_~n 5)} [2019-02-14 16:18:58,117 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:18:58,117 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-14 16:18:58,118 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-14 16:18:58,118 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:18:58,118 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:18:58,119 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:18:58,122 WARN L270 ngHoareTripleChecker]: Pre: {122#(= ~n 5)} [2019-02-14 16:18:58,122 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:18:58,123 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-14 16:18:58,216 WARN L276 ngHoareTripleChecker]: Post: {123#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:18:58,216 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:18:58,216 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:18:58,217 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-14 16:18:58,217 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-14 16:18:58,217 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-14 16:18:58,217 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:18:58,230 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:18:58,230 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:18:58,231 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:18:58,231 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:18:58,231 WARN L224 ngHoareTripleChecker]: Pre: {127#(= c_~n 5)} [2019-02-14 16:18:58,231 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-14 16:18:58,231 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-14 16:18:58,232 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-14 16:18:58,232 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:18:58,232 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:18:58,232 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:18:58,239 WARN L270 ngHoareTripleChecker]: Pre: {127#(= ~n 5)} [2019-02-14 16:18:58,239 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-14 16:18:58,240 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-14 16:18:58,248 WARN L276 ngHoareTripleChecker]: Post: {128#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:18:58,249 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:18:58,249 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:18:58,250 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-14 16:18:58,250 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-14 16:18:58,251 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-14 16:18:58,251 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:18:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:58,259 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-14 16:18:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:18:58,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:18:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:18:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:18:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-14 16:18:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:18:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-14 16:18:58,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-14 16:18:58,291 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-14 16:18:58,293 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:18:58,293 INFO L226 Difference]: Without dead ends: 9 [2019-02-14 16:18:58,294 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-14 16:18:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-14 16:18:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-14 16:18:58,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:18:58,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2019-02-14 16:18:58,349 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2019-02-14 16:18:58,349 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2019-02-14 16:18:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:58,350 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-14 16:18:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-14 16:18:58,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:58,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:58,351 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2019-02-14 16:18:58,351 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2019-02-14 16:18:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:18:58,352 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-14 16:18:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-14 16:18:58,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:18:58,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:18:58,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:18:58,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:18:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:18:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-02-14 16:18:58,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-02-14 16:18:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:18:58,355 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-02-14 16:18:58,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:18:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-14 16:18:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-14 16:18:58,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:18:58,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-14 16:18:58,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:18:58,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:58,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-02-14 16:18:58,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:18:58,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:58,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:18:58,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:18:58,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:18:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:18:58,490 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-14 16:18:58,503 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-14 16:18:58,516 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-14 16:18:58,517 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-14 16:18:58,517 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-14 16:18:58,517 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-14 16:18:58,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {164#false} assume !false; {164#false} is VALID [2019-02-14 16:18:58,518 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-14 16:18:58,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:18:58,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:18:58,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-14 16:18:58,519 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-02-14 16:18:58,520 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:18:58,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:18:58,727 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-14 16:18:58,727 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-14 16:18:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:18:58,728 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-14 16:18:58,779 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-14 16:18:58,859 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-02-14 16:18:58,922 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-14 16:18:58,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-14 16:18:58,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-02-14 16:18:58,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:18:58,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-14 16:18:58,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:18:58,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-14 16:18:58,960 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-14 16:18:58,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-14 16:18:58,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-14 16:18:58,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:18:58,961 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-02-14 16:19:01,490 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:01,491 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:01,491 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:01,491 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:01,492 WARN L224 ngHoareTripleChecker]: Pre: {212#(= c_~n 5)} [2019-02-14 16:19:01,492 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-14 16:19:01,492 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-14 16:19:01,493 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-14 16:19:01,493 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:01,493 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:01,494 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:01,495 WARN L270 ngHoareTripleChecker]: Pre: {212#(= ~n 5)} [2019-02-14 16:19:01,496 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-14 16:19:01,496 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-14 16:19:01,507 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-14 16:19:01,507 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:01,507 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:01,508 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-14 16:19:01,508 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-14 16:19:01,508 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-14 16:19:01,509 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:01,517 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:01,518 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:01,518 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:01,519 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:01,519 WARN L224 ngHoareTripleChecker]: Pre: {214#(= c_~n 5)} [2019-02-14 16:19:01,519 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-14 16:19:01,519 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-14 16:19:01,520 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-14 16:19:01,520 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:01,520 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:01,521 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:01,522 WARN L270 ngHoareTripleChecker]: Pre: {214#(= ~n 5)} [2019-02-14 16:19:01,522 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-14 16:19:01,523 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-14 16:19:01,555 WARN L276 ngHoareTripleChecker]: Post: {215#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:19:01,555 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:01,555 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:01,556 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-14 16:19:01,556 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-14 16:19:01,556 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-14 16:19:01,556 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,358 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:02,358 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:02,359 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:02,359 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,359 WARN L224 ngHoareTripleChecker]: Pre: {218#(= c_~n 5)} [2019-02-14 16:19:02,360 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-14 16:19:02,360 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-14 16:19:02,360 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-14 16:19:02,361 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:02,361 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,361 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:02,363 WARN L270 ngHoareTripleChecker]: Pre: {218#(= ~n 5)} [2019-02-14 16:19:02,363 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-14 16:19:02,363 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-14 16:19:02,373 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-14 16:19:02,373 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,373 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:02,374 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-14 16:19:02,374 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-14 16:19:02,374 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-14 16:19:02,375 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,399 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:02,399 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:02,399 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:02,400 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,400 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-14 16:19:02,400 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:19:02,400 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-14 16:19:02,401 WARN L230 ngHoareTripleChecker]: Post: {223#false} [2019-02-14 16:19:02,401 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:02,401 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,401 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:02,445 WARN L270 ngHoareTripleChecker]: Pre: {222#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:19:02,445 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:19:02,445 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-14 16:19:02,446 WARN L276 ngHoareTripleChecker]: Post: {223#false} [2019-02-14 16:19:02,446 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,446 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:02,447 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-14 16:19:02,447 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-14 16:19:02,447 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:19:02,447 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,473 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:02,473 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:02,473 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:02,473 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,474 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-14 16:19:02,474 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-14 16:19:02,474 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-14 16:19:02,474 WARN L230 ngHoareTripleChecker]: Post: {231#false} [2019-02-14 16:19:02,474 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:02,475 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,475 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:02,486 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-14 16:19:02,486 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-14 16:19:02,486 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-14 16:19:02,488 WARN L276 ngHoareTripleChecker]: Post: {231#false} [2019-02-14 16:19:02,488 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,488 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:02,488 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-14 16:19:02,488 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-14 16:19:02,488 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:19:02,489 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,545 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:02,545 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:02,545 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:02,545 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,546 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-14 16:19:02,546 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-14 16:19:02,546 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-14 16:19:02,546 WARN L230 ngHoareTripleChecker]: Post: {245#false} [2019-02-14 16:19:02,546 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:02,547 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:02,547 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:02,555 WARN L270 ngHoareTripleChecker]: Pre: {244#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:19:02,556 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-14 16:19:02,556 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-14 16:19:02,557 WARN L276 ngHoareTripleChecker]: Post: {245#false} [2019-02-14 16:19:02,557 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:02,557 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:02,558 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-14 16:19:02,558 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-14 16:19:02,558 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:19:02,558 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:03,404 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:03,405 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:03,405 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:03,405 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:03,405 WARN L224 ngHoareTripleChecker]: Pre: {255#(= c_~n 5)} [2019-02-14 16:19:03,406 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-14 16:19:03,406 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-14 16:19:03,406 WARN L230 ngHoareTripleChecker]: Post: {256#false} [2019-02-14 16:19:03,406 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:03,406 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:03,406 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:03,408 WARN L270 ngHoareTripleChecker]: Pre: {255#(= ~n 5)} [2019-02-14 16:19:03,409 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-14 16:19:03,409 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-14 16:19:03,419 WARN L276 ngHoareTripleChecker]: Post: {256#false} [2019-02-14 16:19:03,419 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:03,419 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:03,419 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-14 16:19:03,420 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-14 16:19:03,420 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-14 16:19:03,420 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:04,655 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:04,655 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:04,655 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:04,655 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:04,655 WARN L224 ngHoareTripleChecker]: Pre: {263#(= c_~n 5)} [2019-02-14 16:19:04,656 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:19:04,656 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-14 16:19:04,656 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-14 16:19:04,656 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:04,656 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:04,656 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:04,659 WARN L270 ngHoareTripleChecker]: Pre: {263#(= ~n 5)} [2019-02-14 16:19:04,659 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:19:04,659 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-14 16:19:04,669 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-14 16:19:04,669 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:04,669 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:04,670 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-14 16:19:04,670 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-14 16:19:04,670 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-14 16:19:04,670 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:04,678 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:04,679 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:04,679 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:04,679 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:04,679 WARN L224 ngHoareTripleChecker]: Pre: {265#(= c_~n 5)} [2019-02-14 16:19:04,680 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:19:04,680 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-14 16:19:04,680 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-14 16:19:04,680 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:04,681 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:04,681 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:04,684 WARN L270 ngHoareTripleChecker]: Pre: {265#(= ~n 5)} [2019-02-14 16:19:04,684 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-14 16:19:04,684 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-14 16:19:04,690 WARN L276 ngHoareTripleChecker]: Post: {266#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:19:04,690 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:04,691 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:04,691 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-14 16:19:04,691 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-14 16:19:04,691 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-14 16:19:04,692 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:04,704 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-14 16:19:04,705 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-14 16:19:04,705 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-14 16:19:04,705 WARN L223 ngHoareTripleChecker]: -- [2019-02-14 16:19:04,705 WARN L224 ngHoareTripleChecker]: Pre: {270#(= c_~n 5)} [2019-02-14 16:19:04,705 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-14 16:19:04,705 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-14 16:19:04,706 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-14 16:19:04,706 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-14 16:19:04,706 WARN L268 ngHoareTripleChecker]: -- [2019-02-14 16:19:04,706 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-14 16:19:04,708 WARN L270 ngHoareTripleChecker]: Pre: {270#(= ~n 5)} [2019-02-14 16:19:04,708 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-14 16:19:04,708 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-14 16:19:04,721 WARN L276 ngHoareTripleChecker]: Post: {271#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0) (not (= ULTIMATE.start_main_~i~7 0)))} [2019-02-14 16:19:04,721 WARN L620 ntHoareTripleChecker]: -- [2019-02-14 16:19:04,722 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-14 16:19:04,722 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-14 16:19:04,722 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-14 16:19:04,722 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-14 16:19:04,722 WARN L630 ntHoareTripleChecker]: -- [2019-02-14 16:19:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:04,725 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-02-14 16:19:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:19:04,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-14 16:19:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-14 16:19:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-02-14 16:19:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-14 16:19:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-02-14 16:19:04,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2019-02-14 16:19:04,764 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-14 16:19:04,765 INFO L225 Difference]: With dead ends: 14 [2019-02-14 16:19:04,766 INFO L226 Difference]: Without dead ends: 10 [2019-02-14 16:19:04,767 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-14 16:19:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-14 16:19:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-14 16:19:04,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:04,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2019-02-14 16:19:04,796 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2019-02-14 16:19:04,796 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2019-02-14 16:19:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:04,797 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-02-14 16:19:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-02-14 16:19:04,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:04,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:04,798 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2019-02-14 16:19:04,798 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2019-02-14 16:19:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:04,799 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-02-14 16:19:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-02-14 16:19:04,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:04,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:04,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:04,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-14 16:19:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-02-14 16:19:04,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-02-14 16:19:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:04,801 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-02-14 16:19:04,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-14 16:19:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-02-14 16:19:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-14 16:19:04,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:04,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-14 16:19:04,801 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2019-02-14 16:19:04,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:04,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:04,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:04,884 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-14 16:19:04,885 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-14 16:19:04,890 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-14 16:19:04,890 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-14 16:19:04,890 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-14 16:19:04,891 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-14 16:19:04,891 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-14 16:19:04,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#false} assume !false; {311#false} is VALID [2019-02-14 16:19:04,891 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-14 16:19:04,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:04,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:04,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-14 16:19:04,892 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2019-02-14 16:19:04,894 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:19:04,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:19:05,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:19:05,117 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-14 16:19:05,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:05,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:19:05,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:05,119 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-14 16:19:05,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:05,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:19:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:05,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:05,350 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-14 16:19:05,352 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-14 16:19:05,352 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-14 16:19:05,353 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-14 16:19:05,353 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-14 16:19:05,353 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-14 16:19:05,353 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-14 16:19:05,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#false} assume !false; {311#false} is VALID [2019-02-14 16:19:05,354 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-14 16:19:05,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:05,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#false} assume !false; {311#false} is VALID [2019-02-14 16:19:05,414 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-14 16:19:05,414 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-14 16:19:05,414 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-14 16:19:05,415 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-14 16:19:05,433 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-14 16:19:05,449 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-14 16:19:05,454 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-14 16:19:05,455 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-14 16:19:05,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:05,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-14 16:19:05,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:05,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-14 16:19:05,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:05,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:05,485 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-14 16:19:05,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-14 16:19:05,487 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-02-14 16:19:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:05,606 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-02-14 16:19:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:05,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-14 16:19:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-14 16:19:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-14 16:19:05,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-02-14 16:19:05,660 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-14 16:19:05,660 INFO L225 Difference]: With dead ends: 16 [2019-02-14 16:19:05,660 INFO L226 Difference]: Without dead ends: 10 [2019-02-14 16:19:05,661 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-14 16:19:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-14 16:19:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-14 16:19:05,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:05,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:05,675 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:05,675 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:05,677 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-14 16:19:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-14 16:19:05,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:05,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:05,678 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:05,678 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:05,679 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-14 16:19:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-14 16:19:05,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:05,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:05,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:05,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:19:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-02-14 16:19:05,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-02-14 16:19:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:05,682 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-02-14 16:19:05,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-14 16:19:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-14 16:19:05,682 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:05,682 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-14 16:19:05,683 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2019-02-14 16:19:05,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:05,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:05,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:05,817 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-14 16:19:05,819 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-14 16:19:05,823 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-14 16:19:05,826 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-14 16:19:05,826 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-14 16:19:05,826 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-14 16:19:05,827 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-14 16:19:05,827 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-14 16:19:05,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {428#false} assume !false; {428#false} is VALID [2019-02-14 16:19:05,828 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-14 16:19:05,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:05,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:05,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:05,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:05,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:05,829 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-14 16:19:05,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-14 16:19:05,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-14 16:19:05,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-14 16:19:05,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:05,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:05,910 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-14 16:19:05,911 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-14 16:19:05,912 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-14 16:19:05,917 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-14 16:19:05,917 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-14 16:19:05,917 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-14 16:19:05,918 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-14 16:19:05,918 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-14 16:19:05,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {428#false} assume !false; {428#false} is VALID [2019-02-14 16:19:05,918 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-14 16:19:05,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:05,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {428#false} assume !false; {428#false} is VALID [2019-02-14 16:19:05,963 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-14 16:19:05,963 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-14 16:19:05,963 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-14 16:19:05,964 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-14 16:19:05,966 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-14 16:19:05,974 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-14 16:19:05,979 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-14 16:19:05,980 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-14 16:19:05,980 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-14 16:19:05,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:05,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-02-14 16:19:05,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:06,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-02-14 16:19:06,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:06,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-14 16:19:06,024 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-14 16:19:06,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-14 16:19:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-14 16:19:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-14 16:19:06,026 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-02-14 16:19:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:06,167 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-14 16:19:06,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:19:06,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-02-14 16:19:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-14 16:19:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-02-14 16:19:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-14 16:19:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-02-14 16:19:06,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2019-02-14 16:19:06,199 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-14 16:19:06,200 INFO L225 Difference]: With dead ends: 17 [2019-02-14 16:19:06,200 INFO L226 Difference]: Without dead ends: 11 [2019-02-14 16:19:06,201 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-14 16:19:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-14 16:19:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-14 16:19:06,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:06,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:06,266 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:06,266 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:06,267 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-14 16:19:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-14 16:19:06,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:06,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:06,268 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:06,268 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:06,269 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-14 16:19:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-14 16:19:06,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:06,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:06,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:06,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-14 16:19:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-14 16:19:06,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-02-14 16:19:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:06,271 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-14 16:19:06,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-14 16:19:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-14 16:19:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-14 16:19:06,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:06,272 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-02-14 16:19:06,272 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2019-02-14 16:19:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:06,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:06,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:06,381 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-14 16:19:06,382 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-14 16:19:06,383 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-14 16:19:06,384 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-14 16:19:06,385 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-14 16:19:06,385 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-14 16:19:06,385 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-14 16:19:06,386 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-14 16:19:06,386 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-14 16:19:06,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#false} assume !false; {558#false} is VALID [2019-02-14 16:19:06,387 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-14 16:19:06,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:06,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:06,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:06,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:06,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:06,388 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-14 16:19:06,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-14 16:19:06,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-14 16:19:06,425 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-14 16:19:06,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:06,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:06,495 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-14 16:19:06,496 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-14 16:19:06,497 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-14 16:19:06,498 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-14 16:19:06,498 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-14 16:19:06,499 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-14 16:19:06,499 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-14 16:19:06,499 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-14 16:19:06,499 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-14 16:19:06,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#false} assume !false; {558#false} is VALID [2019-02-14 16:19:06,500 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-14 16:19:06,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:06,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#false} assume !false; {558#false} is VALID [2019-02-14 16:19:06,557 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-14 16:19:06,557 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-14 16:19:06,557 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-14 16:19:06,557 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-14 16:19:06,558 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-14 16:19:06,558 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-14 16:19:06,559 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-14 16:19:06,560 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-14 16:19:06,560 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-14 16:19:06,560 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-14 16:19:06,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:06,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-02-14 16:19:06,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:06,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-14 16:19:06,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:06,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-14 16:19:06,591 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-14 16:19:06,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-14 16:19:06,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-14 16:19:06,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-14 16:19:06,592 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-02-14 16:19:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:06,657 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-02-14 16:19:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-14 16:19:06,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-14 16:19:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:19:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-02-14 16:19:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:19:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-02-14 16:19:06,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2019-02-14 16:19:06,716 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-14 16:19:06,717 INFO L225 Difference]: With dead ends: 18 [2019-02-14 16:19:06,717 INFO L226 Difference]: Without dead ends: 12 [2019-02-14 16:19:06,718 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-14 16:19:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-14 16:19:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-14 16:19:06,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:06,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-02-14 16:19:06,743 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-14 16:19:06,743 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-14 16:19:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:06,745 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-14 16:19:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-14 16:19:06,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:06,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:06,746 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-14 16:19:06,746 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-14 16:19:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:06,747 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-14 16:19:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-14 16:19:06,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:06,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:06,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:06,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-14 16:19:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-14 16:19:06,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-02-14 16:19:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:06,749 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-14 16:19:06,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-14 16:19:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-14 16:19:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-14 16:19:06,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:06,750 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2019-02-14 16:19:06,750 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2019-02-14 16:19:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:06,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:06,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:06,914 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-14 16:19:06,915 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-14 16:19:06,917 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-14 16:19:06,918 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-14 16:19:06,919 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-14 16:19:06,919 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-14 16:19:06,919 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-14 16:19:06,920 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-14 16:19:06,920 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-14 16:19:06,920 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-14 16:19:06,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#false} assume !false; {700#false} is VALID [2019-02-14 16:19:06,921 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-14 16:19:06,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:06,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:06,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:06,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:06,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:06,923 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-14 16:19:06,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:06,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:19:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:06,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:07,008 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-14 16:19:07,009 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-14 16:19:07,012 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-14 16:19:07,012 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-14 16:19:07,014 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-14 16:19:07,031 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-14 16:19:07,031 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-14 16:19:07,032 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-14 16:19:07,032 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-14 16:19:07,032 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-14 16:19:07,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#false} assume !false; {700#false} is VALID [2019-02-14 16:19:07,033 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-14 16:19:07,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:07,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#false} assume !false; {700#false} is VALID [2019-02-14 16:19:07,187 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-14 16:19:07,187 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-14 16:19:07,188 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-14 16:19:07,188 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-14 16:19:07,201 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-14 16:19:07,203 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-14 16:19:07,203 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-14 16:19:07,206 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-14 16:19:07,211 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-14 16:19:07,211 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-14 16:19:07,212 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-14 16:19:07,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:07,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-02-14 16:19:07,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:07,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-14 16:19:07,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:07,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-14 16:19:07,241 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-14 16:19:07,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-14 16:19:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-14 16:19:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-14 16:19:07,242 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-14 16:19:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:07,379 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-02-14 16:19:07,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:19:07,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-14 16:19:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:19:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-02-14 16:19:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:19:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-02-14 16:19:07,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2019-02-14 16:19:07,449 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-14 16:19:07,450 INFO L225 Difference]: With dead ends: 19 [2019-02-14 16:19:07,450 INFO L226 Difference]: Without dead ends: 13 [2019-02-14 16:19:07,450 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-14 16:19:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-14 16:19:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-14 16:19:07,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:07,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-02-14 16:19:07,503 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-02-14 16:19:07,503 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-02-14 16:19:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:07,504 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-14 16:19:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-14 16:19:07,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:07,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:07,505 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-02-14 16:19:07,505 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-02-14 16:19:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:07,506 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-14 16:19:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-14 16:19:07,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:07,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:07,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:07,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-14 16:19:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-02-14 16:19:07,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-02-14 16:19:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:07,508 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-02-14 16:19:07,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-14 16:19:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-14 16:19:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-14 16:19:07,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:07,509 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-02-14 16:19:07,509 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2019-02-14 16:19:07,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:07,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:07,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:07,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:07,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:07,603 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-14 16:19:07,604 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-14 16:19:07,604 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-14 16:19:07,604 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-14 16:19:07,609 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-14 16:19:07,609 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-14 16:19:07,610 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-14 16:19:07,615 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-14 16:19:07,616 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-14 16:19:07,617 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-14 16:19:07,618 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-14 16:19:07,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} assume !false; {854#false} is VALID [2019-02-14 16:19:07,618 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-14 16:19:07,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:07,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:07,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:07,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:07,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:07,619 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-14 16:19:07,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-14 16:19:07,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-14 16:19:07,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-14 16:19:07,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:07,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:07,754 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-14 16:19:07,754 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-14 16:19:07,755 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-14 16:19:07,755 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-14 16:19:07,756 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-14 16:19:07,756 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-14 16:19:07,757 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-14 16:19:07,758 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-14 16:19:07,759 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-14 16:19:07,763 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-14 16:19:07,764 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-14 16:19:07,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} assume !false; {854#false} is VALID [2019-02-14 16:19:07,765 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-14 16:19:07,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:07,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {854#false} assume !false; {854#false} is VALID [2019-02-14 16:19:07,896 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-14 16:19:07,897 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-14 16:19:07,899 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-14 16:19:07,902 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-14 16:19:07,911 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-14 16:19:07,914 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-14 16:19:07,914 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-14 16:19:07,917 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-14 16:19:07,917 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-14 16:19:07,920 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-14 16:19:07,920 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-14 16:19:07,921 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-14 16:19:07,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:07,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-02-14 16:19:07,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:07,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-14 16:19:07,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:07,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:19:07,978 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-14 16:19:07,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:19:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:19:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-02-14 16:19:07,978 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-02-14 16:19:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:08,463 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-02-14 16:19:08,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-14 16:19:08,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-14 16:19:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:19:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-02-14 16:19:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:19:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-02-14 16:19:08,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2019-02-14 16:19:08,517 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-14 16:19:08,518 INFO L225 Difference]: With dead ends: 21 [2019-02-14 16:19:08,518 INFO L226 Difference]: Without dead ends: 19 [2019-02-14 16:19:08,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-14 16:19:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-14 16:19:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-14 16:19:08,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:08,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-02-14 16:19:08,572 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-02-14 16:19:08,572 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-02-14 16:19:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:08,575 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-02-14 16:19:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-14 16:19:08,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:08,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:08,576 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-02-14 16:19:08,576 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-02-14 16:19:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:08,578 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-02-14 16:19:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-14 16:19:08,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:08,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:08,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:08,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-14 16:19:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-02-14 16:19:08,580 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-02-14 16:19:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:08,580 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-02-14 16:19:08,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:19:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-14 16:19:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-14 16:19:08,581 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:08,581 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-02-14 16:19:08,581 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2019-02-14 16:19:08,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:08,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:08,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:08,657 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-14 16:19:08,658 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-14 16:19:08,658 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-14 16:19:08,659 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-14 16:19:08,659 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-14 16:19:08,659 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-14 16:19:08,659 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-14 16:19:08,660 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-14 16:19:08,660 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-14 16:19:08,660 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-14 16:19:08,661 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-14 16:19:08,662 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-14 16:19:08,665 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-14 16:19:08,665 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-14 16:19:08,665 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-14 16:19:08,666 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-14 16:19:08,666 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-14 16:19:08,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2019-02-14 16:19:08,667 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-14 16:19:08,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:08,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-14 16:19:08,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:08,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-02-14 16:19:08,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:08,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:08,681 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-14 16:19:08,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:19:08,683 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-02-14 16:19:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:08,816 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-02-14 16:19:08,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:08,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-02-14 16:19:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-14 16:19:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-14 16:19:08,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-02-14 16:19:08,867 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-14 16:19:08,868 INFO L225 Difference]: With dead ends: 29 [2019-02-14 16:19:08,868 INFO L226 Difference]: Without dead ends: 21 [2019-02-14 16:19:08,869 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-14 16:19:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-14 16:19:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-14 16:19:08,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:08,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-02-14 16:19:08,947 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-02-14 16:19:08,947 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-02-14 16:19:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:08,948 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-02-14 16:19:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-14 16:19:08,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:08,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:08,950 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-02-14 16:19:08,950 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-02-14 16:19:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:08,951 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-02-14 16:19:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-14 16:19:08,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:08,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:08,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:08,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-14 16:19:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-02-14 16:19:08,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-02-14 16:19:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:08,953 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-02-14 16:19:08,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-14 16:19:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-14 16:19:08,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:08,954 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-02-14 16:19:08,954 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2019-02-14 16:19:08,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:08,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:08,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:09,249 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-14 16:19:09,250 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-14 16:19:09,250 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-14 16:19:09,250 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-14 16:19:09,251 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-14 16:19:09,251 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-14 16:19:09,251 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-14 16:19:09,252 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-14 16:19:09,256 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-14 16:19:09,263 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-14 16:19:09,264 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-14 16:19:09,265 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-14 16:19:09,265 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-14 16:19:09,265 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-14 16:19:09,266 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-14 16:19:09,266 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-14 16:19:09,266 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-14 16:19:09,266 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-14 16:19:09,266 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-14 16:19:09,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2019-02-14 16:19:09,267 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-14 16:19:09,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:09,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:09,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:09,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:09,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:09,268 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-14 16:19:09,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:09,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:19:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:09,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:09,568 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-14 16:19:09,573 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-14 16:19:09,574 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-14 16:19:09,574 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-14 16:19:09,576 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-14 16:19:09,576 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-14 16:19:09,578 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-14 16:19:09,579 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-14 16:19:09,585 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-14 16:19:09,586 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-14 16:19:09,586 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-14 16:19:09,586 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-14 16:19:09,586 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-14 16:19:09,587 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-14 16:19:09,587 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-14 16:19:09,587 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-14 16:19:09,587 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-14 16:19:09,588 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-14 16:19:09,588 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-14 16:19:09,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2019-02-14 16:19:09,589 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-14 16:19:09,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:09,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2019-02-14 16:19:09,792 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-14 16:19:09,792 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-14 16:19:09,793 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-14 16:19:09,793 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-14 16:19:09,793 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-14 16:19:09,793 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-14 16:19:09,793 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-14 16:19:09,793 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-14 16:19:09,794 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-14 16:19:09,794 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-14 16:19:09,799 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-14 16:19:09,802 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-14 16:19:09,802 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-14 16:19:09,803 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-14 16:19:09,803 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-14 16:19:09,804 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-14 16:19:09,804 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-14 16:19:09,804 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-14 16:19:09,805 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-14 16:19:09,806 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-14 16:19:09,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-02-14 16:19:09,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:09,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-02-14 16:19:09,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:09,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-14 16:19:09,866 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-14 16:19:09,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-14 16:19:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-14 16:19:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-02-14 16:19:09,867 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-02-14 16:19:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:10,308 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-02-14 16:19:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-14 16:19:10,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-02-14 16:19:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:19:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-02-14 16:19:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:19:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-02-14 16:19:10,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2019-02-14 16:19:10,385 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-14 16:19:10,386 INFO L225 Difference]: With dead ends: 39 [2019-02-14 16:19:10,386 INFO L226 Difference]: Without dead ends: 26 [2019-02-14 16:19:10,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-02-14 16:19:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-14 16:19:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-14 16:19:10,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:10,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2019-02-14 16:19:10,477 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-02-14 16:19:10,477 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-02-14 16:19:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:10,478 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-14 16:19:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-14 16:19:10,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:10,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:10,479 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-02-14 16:19:10,479 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-02-14 16:19:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:10,480 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-14 16:19:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-14 16:19:10,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:10,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:10,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:10,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-14 16:19:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-02-14 16:19:10,482 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-02-14 16:19:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:10,482 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-02-14 16:19:10,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-14 16:19:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-14 16:19:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-14 16:19:10,483 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:10,483 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-02-14 16:19:10,483 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:10,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2019-02-14 16:19:10,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:10,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:10,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:10,742 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-14 16:19:10,742 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-14 16:19:10,743 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-14 16:19:10,743 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-14 16:19:10,743 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-14 16:19:10,743 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-14 16:19:10,744 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-14 16:19:10,744 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-14 16:19:10,746 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-14 16:19:10,748 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-14 16:19:10,749 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-14 16:19:10,751 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-14 16:19:10,752 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-14 16:19:10,753 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-14 16:19:10,753 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-14 16:19:10,753 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-14 16:19:10,753 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-14 16:19:10,753 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-14 16:19:10,753 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-14 16:19:10,754 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-14 16:19:10,754 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-14 16:19:10,754 INFO L273 TraceCheckUtils]: 21: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2019-02-14 16:19:10,754 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-14 16:19:10,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:10,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:10,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:10,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:10,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:10,755 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-14 16:19:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-14 16:19:10,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-14 16:19:10,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-14 16:19:10,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:10,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:10,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:19:10,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:10,879 INFO L267 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-14 16:19:10,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:19:10,882 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:10,882 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-14 16:19:10,883 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-14 16:19:11,228 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-14 16:19:11,229 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-14 16:19:11,229 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-14 16:19:11,229 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-14 16:19:11,230 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-14 16:19:11,231 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-14 16:19:11,233 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-14 16:19:11,235 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-14 16:19:11,236 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-14 16:19:11,236 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-14 16:19:11,237 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-14 16:19:11,237 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-14 16:19:11,238 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-14 16:19:11,239 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-14 16:19:11,239 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-14 16:19:11,240 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-14 16:19:11,241 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-14 16:19:11,242 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-14 16:19:11,243 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-14 16:19:11,243 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-14 16:19:11,244 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-14 16:19:11,245 INFO L273 TraceCheckUtils]: 21: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2019-02-14 16:19:11,249 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-14 16:19:11,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:11,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2019-02-14 16:19:11,329 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-14 16:19:11,330 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-14 16:19:11,331 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-14 16:19:11,331 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-14 16:19:11,332 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-14 16:19:11,333 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-14 16:19:11,334 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-14 16:19:11,334 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-14 16:19:11,335 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-14 16:19:11,336 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-14 16:19:11,336 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-14 16:19:11,337 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-14 16:19:11,338 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-14 16:19:11,338 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-14 16:19:11,339 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-14 16:19:11,341 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-14 16:19:11,341 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-14 16:19:11,341 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-14 16:19:11,341 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-14 16:19:11,342 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-14 16:19:11,342 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-14 16:19:11,345 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-14 16:19:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-14 16:19:11,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2019-02-14 16:19:11,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:11,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-02-14 16:19:11,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:11,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:19:11,380 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-14 16:19:11,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:19:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:19:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:19:11,381 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-02-14 16:19:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:11,718 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-14 16:19:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:19:11,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-02-14 16:19:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-02-14 16:19:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:19:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-02-14 16:19:11,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2019-02-14 16:19:11,732 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-14 16:19:11,732 INFO L225 Difference]: With dead ends: 26 [2019-02-14 16:19:11,732 INFO L226 Difference]: Without dead ends: 0 [2019-02-14 16:19:11,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-02-14 16:19:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-14 16:19:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-14 16:19:11,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:11,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:11,734 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:11,734 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:11,735 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:19:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:19:11,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:11,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:11,735 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:11,735 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:19:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:11,736 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:19:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:19:11,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:11,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:11,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:11,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-14 16:19:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-14 16:19:11,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-02-14 16:19:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:11,737 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-14 16:19:11,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:19:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:19:11,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:11,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-14 16:19:11,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-14 16:19:11,983 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-02-14 16:19:12,157 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-02-14 16:19:12,157 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-02-14 16:19:12,158 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-02-14 16:19:12,158 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-14 16:19:12,158 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-02-14 16:19:12,158 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-14 16:19:12,158 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-14 16:19:12,160 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-14 16:19:12,184 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-14 16:19:12,187 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-14 16:19:12,198 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 04:19:12 BoogieIcfgContainer [2019-02-14 16:19:12,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-14 16:19:12,200 INFO L168 Benchmark]: Toolchain (without parser) took 17940.98 ms. Allocated memory was 138.9 MB in the beginning and 332.4 MB in the end (delta: 193.5 MB). Free memory was 106.2 MB in the beginning and 225.5 MB in the end (delta: -119.3 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:12,201 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:19:12,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 138.9 MB. Free memory was 106.0 MB in the beginning and 104.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:12,202 INFO L168 Benchmark]: Boogie Preprocessor took 33.41 ms. Allocated memory is still 138.9 MB. Free memory was 104.3 MB in the beginning and 103.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:12,203 INFO L168 Benchmark]: RCFGBuilder took 464.62 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 89.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:12,203 INFO L168 Benchmark]: TraceAbstraction took 17388.15 ms. Allocated memory was 138.9 MB in the beginning and 332.4 MB in the end (delta: 193.5 MB). Free memory was 89.7 MB in the beginning and 225.5 MB in the end (delta: -135.8 MB). Peak memory consumption was 57.6 MB. Max. memory is 7.1 GB. [2019-02-14 16:19:12,207 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.20 ms. Allocated memory is still 138.9 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 138.9 MB. Free memory was 106.0 MB in the beginning and 104.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.41 ms. Allocated memory is still 138.9 MB. Free memory was 104.3 MB in the beginning and 103.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.62 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 89.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17388.15 ms. Allocated memory was 138.9 MB in the beginning and 332.4 MB in the end (delta: 193.5 MB). Free memory was 89.7 MB in the beginning and 225.5 MB in the end (delta: -135.8 MB). Peak memory consumption was 57.6 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.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s 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.3s 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.6s 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...