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-0302a3f [2019-02-27 12:54:53,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 12:54:53,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 12:54:53,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 12:54:53,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 12:54:53,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 12:54:53,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 12:54:53,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 12:54:53,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 12:54:53,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 12:54:53,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 12:54:53,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 12:54:53,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 12:54:53,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 12:54:53,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 12:54:53,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 12:54:53,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 12:54:53,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 12:54:53,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 12:54:53,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 12:54:53,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 12:54:53,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 12:54:53,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 12:54:53,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 12:54:53,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 12:54:53,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 12:54:53,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 12:54:53,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 12:54:53,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 12:54:53,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 12:54:53,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 12:54:53,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 12:54:53,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 12:54:53,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 12:54:53,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 12:54:53,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 12:54:53,333 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-27 12:54:53,346 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 12:54:53,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 12:54:53,347 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 12:54:53,347 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 12:54:53,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 12:54:53,348 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 12:54:53,348 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 12:54:53,348 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 12:54:53,348 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 12:54:53,349 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 12:54:53,349 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 12:54:53,349 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 12:54:53,349 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 12:54:53,349 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 12:54:53,350 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 12:54:53,351 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 12:54:53,351 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 12:54:53,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 12:54:53,351 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 12:54:53,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 12:54:53,352 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 12:54:53,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 12:54:53,352 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 12:54:53,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 12:54:53,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 12:54:53,353 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 12:54:53,353 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 12:54:53,353 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 12:54:53,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 12:54:53,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 12:54:53,354 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 12:54:53,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:54:53,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 12:54:53,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 12:54:53,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 12:54:53,356 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 12:54:53,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 12:54:53,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 12:54:53,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 12:54:53,404 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 12:54:53,404 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 12:54:53,405 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-27 12:54:53,405 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-02-27 12:54:53,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 12:54:53,470 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 12:54:53,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 12:54:53,472 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 12:54:53,490 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,502 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 12:54:53,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 12:54:53,526 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,527 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,528 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,529 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,534 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,540 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,542 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 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 12:54:53,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 12:54:53,549 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 12:54:53,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (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-27 12:54:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-27 12:54:53,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-27 12:54:54,221 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-27 12:54:54,223 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-27 12:54:54,225 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-02-27 12:54:54,226 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:54:54 BoogieIcfgContainer [2019-02-27 12:54:54,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 12:54:54,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 12:54:54,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 12:54:54,232 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 12:54:54,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/2) ... [2019-02-27 12:54:54,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ea1caa and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 12:54:54, skipping insertion in model container [2019-02-27 12:54:54,233 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 27.02 12:54:54" (2/2) ... [2019-02-27 12:54:54,235 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-02-27 12:54:54,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 12:54:54,259 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-27 12:54:54,276 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-27 12:54:54,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 12:54:54,316 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 12:54:54,317 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 12:54:54,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 12:54:54,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 12:54:54,317 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 12:54:54,317 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 12:54:54,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 12:54:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-27 12:54:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:54:54,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:54,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:54:54,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-27 12:54:54,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:54,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:54,548 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-27 12:54:54,551 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-27 12:54:54,552 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-27 12:54:54,552 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-02-27 12:54:54,555 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-27 12:54:54,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:54:54,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:54:54,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:54:54,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-27 12:54:54,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:54,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:54:54,608 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-27 12:54:54,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:54:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:54:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:54:54,619 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-27 12:54:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:54,740 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-27 12:54:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:54:54,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-27 12:54:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-27 12:54:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-27 12:54:54,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-02-27 12:54:54,827 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-27 12:54:54,839 INFO L225 Difference]: With dead ends: 11 [2019-02-27 12:54:54,839 INFO L226 Difference]: Without dead ends: 7 [2019-02-27 12:54:54,842 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-27 12:54:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-27 12:54:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-27 12:54:54,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:54:54,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:54,950 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:54,951 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:54,953 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-27 12:54:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-27 12:54:54,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:54,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:54,955 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:54,955 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-27 12:54:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:54,957 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-27 12:54:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-27 12:54:54,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:54,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:54,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:54:54,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:54:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-27 12:54:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-02-27 12:54:54,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-02-27 12:54:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:54:54,962 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-02-27 12:54:54,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:54:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-27 12:54:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-27 12:54:54,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:54,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-27 12:54:54,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-02-27 12:54:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:55,236 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-27 12:54:55,261 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-27 12:54:55,270 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-27 12:54:55,271 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-27 12:54:55,271 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2019-02-27 12:54:55,271 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-27 12:54:55,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:54:55,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:54:55,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-27 12:54:55,275 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-02-27 12:54:55,308 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:54:55,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:54:55,576 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-27 12:54:55,578 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-27 12:54:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:55,584 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-27 12:54:55,742 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2019-02-27 12:54:55,772 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-27 12:54:55,836 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-27 12:54:55,859 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-27 12:54:55,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-27 12:54:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-02-27 12:54:55,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:54:55,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-27 12:54:55,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:55,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:54:55,876 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-27 12:54:55,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:54:55,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:54:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:54:55,877 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-02-27 12:54:56,490 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:56,490 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:56,491 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:56,492 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,492 WARN L224 ngHoareTripleChecker]: Pre: {103#true} [2019-02-27 12:54:56,493 WARN L228 ngHoareTripleChecker]: Action: ~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; [2019-02-27 12:54:56,493 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2019-02-27 12:54:56,493 WARN L230 ngHoareTripleChecker]: Post: {104#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,494 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:56,494 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,495 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:56,500 WARN L270 ngHoareTripleChecker]: Pre: {103#true} [2019-02-27 12:54:56,501 WARN L274 ngHoareTripleChecker]: Action: ~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; [2019-02-27 12:54:56,502 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2019-02-27 12:54:56,513 WARN L276 ngHoareTripleChecker]: Post: {104#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,514 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,514 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:56,514 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: 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, ~n, 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: 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, ~n, 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-27 12:54:56,515 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~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;) [2019-02-27 12:54:56,515 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:54:56,515 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,553 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:56,553 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:56,554 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:56,554 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,554 WARN L224 ngHoareTripleChecker]: Pre: {113#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,555 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:54:56,555 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-27 12:54:56,555 WARN L230 ngHoareTripleChecker]: Post: {114#false} [2019-02-27 12:54:56,555 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:56,556 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,556 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:56,599 WARN L270 ngHoareTripleChecker]: Pre: {113#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,599 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:54:56,599 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-27 12:54:56,601 WARN L276 ngHoareTripleChecker]: Post: {114#false} [2019-02-27 12:54:56,601 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,601 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:56,602 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~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 , 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-27 12:54:56,602 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-27 12:54:56,602 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:54:56,602 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,617 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:56,617 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:56,617 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:56,618 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,618 WARN L224 ngHoareTripleChecker]: Pre: {118#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,618 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-27 12:54:56,618 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-27 12:54:56,619 WARN L230 ngHoareTripleChecker]: Post: {119#false} [2019-02-27 12:54:56,619 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:56,620 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,620 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:56,703 WARN L270 ngHoareTripleChecker]: Pre: {118#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,704 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-27 12:54:56,704 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-27 12:54:56,709 WARN L276 ngHoareTripleChecker]: Post: {119#false} [2019-02-27 12:54:56,709 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,709 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:56,710 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~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 , 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-27 12:54:56,710 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-27 12:54:56,710 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:54:56,710 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,753 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:56,753 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:56,757 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:56,757 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,757 WARN L224 ngHoareTripleChecker]: Pre: {126#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,758 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-27 12:54:56,758 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-27 12:54:56,758 WARN L230 ngHoareTripleChecker]: Post: {127#false} [2019-02-27 12:54:56,758 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:56,759 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,759 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:56,784 WARN L270 ngHoareTripleChecker]: Pre: {126#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:56,785 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-27 12:54:56,785 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-27 12:54:56,787 WARN L276 ngHoareTripleChecker]: Post: {127#false} [2019-02-27 12:54:56,787 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,787 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:56,788 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~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 , 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-27 12:54:56,788 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-27 12:54:56,789 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:54:56,789 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,802 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:56,802 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:56,802 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:56,803 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,803 WARN L224 ngHoareTripleChecker]: Pre: {128#(= c_~n 5)} [2019-02-27 12:54:56,803 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-27 12:54:56,803 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-27 12:54:56,803 WARN L230 ngHoareTripleChecker]: Post: {129#false} [2019-02-27 12:54:56,804 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:56,804 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:56,805 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:56,811 WARN L270 ngHoareTripleChecker]: Pre: {128#(= ~n 5)} [2019-02-27 12:54:56,811 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-27 12:54:56,811 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-27 12:54:56,813 WARN L276 ngHoareTripleChecker]: Post: {129#false} [2019-02-27 12:54:56,813 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:56,813 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:56,814 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-27 12:54:56,814 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-27 12:54:56,814 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:54:56,814 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:57,431 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:57,431 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:57,432 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:57,432 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:57,433 WARN L224 ngHoareTripleChecker]: Pre: {130#(= c_~n 5)} [2019-02-27 12:54:57,433 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-27 12:54: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-27 12:54:57,433 WARN L230 ngHoareTripleChecker]: Post: {131#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:57,433 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:57,441 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:57,441 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:57,475 WARN L270 ngHoareTripleChecker]: Pre: {130#(= ~n 5)} [2019-02-27 12:54:57,475 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-27 12:54:57,476 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-27 12:54:57,488 WARN L276 ngHoareTripleChecker]: Post: {131#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:57,488 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:57,488 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:57,489 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-27 12:54:57,489 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-27 12:54:57,489 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:54:57,489 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:58,097 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:58,097 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:58,098 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:58,098 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:58,098 WARN L224 ngHoareTripleChecker]: Pre: {134#(= c_~n 5)} [2019-02-27 12:54:58,098 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:54:58,098 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-27 12:54:58,098 WARN L230 ngHoareTripleChecker]: Post: {135#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:58,099 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:58,099 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:58,100 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:58,104 WARN L270 ngHoareTripleChecker]: Pre: {134#(= ~n 5)} [2019-02-27 12:54:58,104 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:54:58,104 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-27 12:54:58,116 WARN L276 ngHoareTripleChecker]: Post: {135#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:58,116 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:58,116 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:58,117 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-27 12:54:58,117 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-27 12:54:58,117 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:54:58,118 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:58,716 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:58,716 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:58,716 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:58,716 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:58,716 WARN L224 ngHoareTripleChecker]: Pre: {139#(= c_~n 5)} [2019-02-27 12:54:58,717 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-27 12:54:58,717 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-27 12:54:58,717 WARN L230 ngHoareTripleChecker]: Post: {140#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:58,717 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:58,717 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:58,718 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:58,721 WARN L270 ngHoareTripleChecker]: Pre: {139#(= ~n 5)} [2019-02-27 12:54:58,721 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-27 12:54:58,722 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-27 12:54:58,727 WARN L276 ngHoareTripleChecker]: Post: {140#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:58,727 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:58,727 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:58,728 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-27 12:54:58,728 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-27 12:54:58,729 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:54:58,729 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:54:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:58,737 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-27 12:54:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:54:58,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-27 12:54:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:54:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-27 12:54:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:54:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-27 12:54:58,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-27 12:54:58,891 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-27 12:54:58,892 INFO L225 Difference]: With dead ends: 11 [2019-02-27 12:54:58,893 INFO L226 Difference]: Without dead ends: 9 [2019-02-27 12:54:58,894 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-27 12:54:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-27 12:54:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-27 12:54:58,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:54:58,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2019-02-27 12:54:58,968 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2019-02-27 12:54:58,968 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2019-02-27 12:54:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:58,970 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-27 12:54:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-27 12:54:58,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:58,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:58,971 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2019-02-27 12:54:58,972 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2019-02-27 12:54:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:58,974 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-27 12:54:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-27 12:54:58,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:58,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:58,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:54:58,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:54:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 12:54:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-02-27 12:54:58,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-02-27 12:54:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:54:58,976 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-02-27 12:54:58,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:54:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-27 12:54:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-27 12:54:58,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:58,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-27 12:54:58,977 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-02-27 12:54:58,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:58,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:58,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:58,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:58,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:59,070 INFO L273 TraceCheckUtils]: 0: Hoare triple {175#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; {177#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:54:59,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#(<= 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; {178#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:54:59,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {178#(<= 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; {176#false} is VALID [2019-02-27 12:54:59,073 INFO L273 TraceCheckUtils]: 3: Hoare triple {176#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {176#false} is VALID [2019-02-27 12:54:59,073 INFO L273 TraceCheckUtils]: 4: Hoare triple {176#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; {176#false} is VALID [2019-02-27 12:54:59,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#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; {176#false} is VALID [2019-02-27 12:54:59,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#false} assume !false; {176#false} is VALID [2019-02-27 12:54:59,074 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-27 12:54:59,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:54:59,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:54:59,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-27 12:54:59,075 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-02-27 12:54:59,079 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:54:59,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:54:59,186 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-27 12:54:59,186 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-27 12:54:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:59,187 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-27 12:54:59,284 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2019-02-27 12:54:59,303 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-27 12:54:59,366 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-02-27 12:54:59,392 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-27 12:54:59,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-27 12:54:59,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-02-27 12:54:59,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:54:59,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-27 12:54:59,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:59,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-27 12:54:59,406 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-27 12:54:59,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-27 12:54:59,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-27 12:54:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:54:59,407 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-02-27 12:54:59,414 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:54:59,414 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:54:59,414 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:54:59,415 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:54:59,415 WARN L224 ngHoareTripleChecker]: Pre: {238#true} [2019-02-27 12:54:59,415 WARN L228 ngHoareTripleChecker]: Action: ~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; [2019-02-27 12:54:59,415 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2019-02-27 12:54:59,415 WARN L230 ngHoareTripleChecker]: Post: {239#(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))} [2019-02-27 12:54:59,415 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:54:59,416 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:54:59,416 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:54:59,418 WARN L270 ngHoareTripleChecker]: Pre: {238#true} [2019-02-27 12:54:59,418 WARN L274 ngHoareTripleChecker]: Action: ~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; [2019-02-27 12:54:59,418 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2019-02-27 12:54:59,429 WARN L276 ngHoareTripleChecker]: Post: {239#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:54:59,430 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:54:59,430 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:54:59,430 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: 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, ~n, 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: 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, ~n, 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-27 12:54:59,431 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~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;) [2019-02-27 12:54:59,431 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; 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; , }} [2019-02-27 12:54:59,431 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,059 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:00,059 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:00,060 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:00,060 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,060 WARN L224 ngHoareTripleChecker]: Pre: {240#true} [2019-02-27 12:55:00,060 WARN L228 ngHoareTripleChecker]: Action: ~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; [2019-02-27 12:55:00,060 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2019-02-27 12:55:00,061 WARN L230 ngHoareTripleChecker]: Post: {241#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,061 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:00,061 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,061 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:00,064 WARN L270 ngHoareTripleChecker]: Pre: {240#true} [2019-02-27 12:55:00,064 WARN L274 ngHoareTripleChecker]: Action: ~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; [2019-02-27 12:55:00,064 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2019-02-27 12:55:00,070 WARN L276 ngHoareTripleChecker]: Post: {241#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,071 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,071 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:00,071 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: 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, ~n, 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: 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, ~n, 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-27 12:55:00,071 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~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;) [2019-02-27 12:55:00,072 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:55:00,072 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,103 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:00,103 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:00,104 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:00,104 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,104 WARN L224 ngHoareTripleChecker]: Pre: {246#(= c_~n 5)} [2019-02-27 12:55:00,105 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-27 12:55:00,105 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-27 12:55:00,105 WARN L230 ngHoareTripleChecker]: Post: {247#(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))} [2019-02-27 12:55:00,105 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:00,106 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,106 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:00,146 WARN L270 ngHoareTripleChecker]: Pre: {246#(= ~n 5)} [2019-02-27 12:55:00,146 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-27 12:55:00,147 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-27 12:55:00,279 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-02-27 12:55:00,279 WARN L276 ngHoareTripleChecker]: Post: {247#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,279 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,279 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:00,280 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-27 12:55:00,280 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-27 12:55:00,280 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; 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; , }} [2019-02-27 12:55:00,280 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,366 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:00,366 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:00,367 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:00,367 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,367 WARN L224 ngHoareTripleChecker]: Pre: {250#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,367 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:55:00,368 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-27 12:55:00,368 WARN L230 ngHoareTripleChecker]: Post: {251#false} [2019-02-27 12:55:00,368 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:00,369 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,369 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:00,411 WARN L270 ngHoareTripleChecker]: Pre: {250#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,412 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:55:00,412 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-27 12:55:00,413 WARN L276 ngHoareTripleChecker]: Post: {251#false} [2019-02-27 12:55:00,414 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,414 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:00,414 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~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 , 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-27 12:55:00,414 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-27 12:55:00,414 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:55:00,415 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,437 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:00,438 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:00,438 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:00,438 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,439 WARN L224 ngHoareTripleChecker]: Pre: {258#(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))} [2019-02-27 12:55:00,439 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-27 12:55:00,439 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-27 12:55:00,439 WARN L230 ngHoareTripleChecker]: Post: {259#false} [2019-02-27 12:55:00,440 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:00,440 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,440 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:00,453 WARN L270 ngHoareTripleChecker]: Pre: {258#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,454 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-27 12:55:00,454 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-27 12:55:00,455 WARN L276 ngHoareTripleChecker]: Post: {259#false} [2019-02-27 12:55:00,455 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,455 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:00,455 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: 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 , 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-27 12:55:00,456 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-27 12:55:00,456 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:55:00,456 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,536 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:00,536 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:00,537 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:00,537 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,537 WARN L224 ngHoareTripleChecker]: Pre: {272#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,538 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-27 12:55:00,538 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-27 12:55:00,538 WARN L230 ngHoareTripleChecker]: Post: {273#false} [2019-02-27 12:55:00,538 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:00,539 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,539 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:00,548 WARN L270 ngHoareTripleChecker]: Pre: {272#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,548 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-27 12:55:00,548 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-27 12:55:00,552 WARN L276 ngHoareTripleChecker]: Post: {273#false} [2019-02-27 12:55:00,552 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,552 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:00,552 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~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 , 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-27 12:55:00,553 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-27 12:55:00,553 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:55:00,553 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,629 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:00,629 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:00,630 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:00,630 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,630 WARN L224 ngHoareTripleChecker]: Pre: {283#(= c_~n 5)} [2019-02-27 12:55:00,630 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-27 12:55:00,630 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-27 12:55:00,631 WARN L230 ngHoareTripleChecker]: Post: {284#false} [2019-02-27 12:55:00,631 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:00,631 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,631 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:00,634 WARN L270 ngHoareTripleChecker]: Pre: {283#(= ~n 5)} [2019-02-27 12:55:00,634 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-27 12:55:00,634 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-27 12:55:00,636 WARN L276 ngHoareTripleChecker]: Post: {284#false} [2019-02-27 12:55:00,636 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,637 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:00,637 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-27 12:55:00,637 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-27 12:55:00,638 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-02-27 12:55:00,638 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,646 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:00,646 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:00,646 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:00,647 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,647 WARN L224 ngHoareTripleChecker]: Pre: {285#(= c_~n 5)} [2019-02-27 12:55:00,647 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-27 12:55:00,647 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-27 12:55:00,647 WARN L230 ngHoareTripleChecker]: Post: {286#(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))} [2019-02-27 12:55:00,648 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:00,648 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:00,648 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:00,650 WARN L270 ngHoareTripleChecker]: Pre: {285#(= ~n 5)} [2019-02-27 12:55:00,650 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-27 12:55:00,650 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-27 12:55:00,664 WARN L276 ngHoareTripleChecker]: Post: {286#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:00,665 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:00,665 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:00,665 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-27 12:55:00,665 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-27 12:55:00,665 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; 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; , }} [2019-02-27 12:55:00,666 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:01,296 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:01,296 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:01,297 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:01,297 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:01,297 WARN L224 ngHoareTripleChecker]: Pre: {287#(= c_~n 5)} [2019-02-27 12:55:01,297 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-27 12:55:01,297 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-27 12:55:01,298 WARN L230 ngHoareTripleChecker]: Post: {288#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:01,298 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:01,298 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:01,299 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:01,317 WARN L270 ngHoareTripleChecker]: Pre: {287#(= ~n 5)} [2019-02-27 12:55:01,317 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-27 12:55:01,317 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-27 12:55:01,327 WARN L276 ngHoareTripleChecker]: Post: {288#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:01,328 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:01,328 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:01,328 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-27 12:55:01,328 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-27 12:55:01,329 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:55:01,329 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:01,343 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:01,344 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:01,344 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:01,345 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:01,345 WARN L224 ngHoareTripleChecker]: Pre: {291#(= c_~n 5)} [2019-02-27 12:55:01,345 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:55:01,345 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-27 12:55:01,345 WARN L230 ngHoareTripleChecker]: Post: {292#(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))} [2019-02-27 12:55:01,345 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:01,346 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:01,346 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:01,350 WARN L270 ngHoareTripleChecker]: Pre: {291#(= ~n 5)} [2019-02-27 12:55:01,350 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:55:01,350 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-27 12:55:01,363 WARN L276 ngHoareTripleChecker]: Post: {292#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:01,363 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:01,364 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:01,364 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-27 12:55:01,364 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-27 12:55:01,364 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; 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; , }} [2019-02-27 12:55:01,365 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:01,988 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:01,989 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:01,989 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:01,990 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:01,990 WARN L224 ngHoareTripleChecker]: Pre: {293#(= c_~n 5)} [2019-02-27 12:55:01,990 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:55:01,990 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-27 12:55:01,991 WARN L230 ngHoareTripleChecker]: Post: {294#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:01,991 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:01,992 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:01,992 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:01,995 WARN L270 ngHoareTripleChecker]: Pre: {293#(= ~n 5)} [2019-02-27 12:55:01,995 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-02-27 12:55:01,995 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-27 12:55:01,999 WARN L276 ngHoareTripleChecker]: Post: {294#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:02,000 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:02,000 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:02,001 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-27 12:55:02,001 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-27 12:55:02,001 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:55:02,001 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:02,636 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 12:55:02,636 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 12:55:02,637 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 12:55:02,637 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 12:55:02,637 WARN L224 ngHoareTripleChecker]: Pre: {298#(= c_~n 5)} [2019-02-27 12:55:02,637 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-27 12:55:02,638 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-27 12:55:02,638 WARN L230 ngHoareTripleChecker]: Post: {299#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:02,638 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 12:55:02,639 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 12:55:02,639 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 12:55:02,648 WARN L270 ngHoareTripleChecker]: Pre: {298#(= ~n 5)} [2019-02-27 12:55:02,648 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-27 12:55:02,648 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-27 12:55:02,663 WARN L276 ngHoareTripleChecker]: Post: {299#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-02-27 12:55:02,663 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 12:55:02,663 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 12:55:02,663 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-27 12:55:02,664 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-27 12:55:02,664 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-02-27 12:55:02,664 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 12:55:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:02,683 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-02-27 12:55:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-27 12:55:02,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-27 12:55:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-27 12:55:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-02-27 12:55:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-27 12:55:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-02-27 12:55:02,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2019-02-27 12:55:02,745 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-27 12:55:02,747 INFO L225 Difference]: With dead ends: 14 [2019-02-27 12:55:02,747 INFO L226 Difference]: Without dead ends: 10 [2019-02-27 12:55:02,748 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-27 12:55:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-27 12:55:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-27 12:55:02,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:02,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2019-02-27 12:55:02,766 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2019-02-27 12:55:02,766 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2019-02-27 12:55:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:02,767 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-02-27 12:55:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-02-27 12:55:02,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:02,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:02,768 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2019-02-27 12:55:02,768 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2019-02-27 12:55:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:02,769 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-02-27 12:55:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-02-27 12:55:02,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:02,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:02,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:02,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-27 12:55:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-02-27 12:55:02,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-02-27 12:55:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-02-27 12:55:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-27 12:55:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-02-27 12:55:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-27 12:55:02,772 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:02,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-27 12:55:02,772 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2019-02-27 12:55:02,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:02,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:02,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:02,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:02,845 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#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; {340#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:02,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#(<= 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; {341#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:02,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#(<= 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; {339#false} is VALID [2019-02-27 12:55:02,852 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2019-02-27 12:55:02,852 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:02,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:02,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:02,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-02-27 12:55:02,853 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-27 12:55:02,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:02,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:55:02,854 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-27 12:55:02,854 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2019-02-27 12:55:02,856 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:55:02,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:55:03,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:55:03,021 INFO L272 AbstractInterpreter]: Visited 8 different actions 32 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 299 root evaluator evaluations with a maximum evaluation depth of 4. Performed 299 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-27 12:55:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:03,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:55:03,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:03,024 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-27 12:55:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:03,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:55:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:03,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-27 12:55:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:03,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:55:03,223 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#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; {340#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#(<= 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; {341#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#(<= 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; {339#false} is VALID [2019-02-27 12:55:03,225 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2019-02-27 12:55:03,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:03,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:03,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:03,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-02-27 12:55:03,227 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-27 12:55:03,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:55:03,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-02-27 12:55:03,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:03,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:03,292 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#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; {339#false} is VALID [2019-02-27 12:55:03,292 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2019-02-27 12:55:03,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#(<= 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; {339#false} is VALID [2019-02-27 12:55:03,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {385#(< 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; {381#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,294 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#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; {385#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,294 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-27 12:55:03,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:55:03,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-27 12:55:03,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:55:03,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-27 12:55:03,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:03,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:03,327 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-27 12:55:03,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:03,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-27 12:55:03,328 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-02-27 12:55:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:03,475 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-02-27 12:55:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:03,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-27 12:55:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-27 12:55:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-27 12:55:03,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-02-27 12:55:03,529 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-27 12:55:03,529 INFO L225 Difference]: With dead ends: 16 [2019-02-27 12:55:03,530 INFO L226 Difference]: Without dead ends: 10 [2019-02-27 12:55:03,530 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-27 12:55:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-27 12:55:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-27 12:55:03,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:03,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-02-27 12:55:03,583 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-27 12:55:03,583 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-27 12:55:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:03,584 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-27 12:55:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-27 12:55:03,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:03,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:03,584 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-27 12:55:03,585 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-27 12:55:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:03,586 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-02-27 12:55:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-27 12:55:03,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:03,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:03,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:03,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-27 12:55:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-02-27 12:55:03,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-02-27 12:55:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:03,588 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-02-27 12:55:03,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-02-27 12:55:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-27 12:55:03,589 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:03,590 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-27 12:55:03,591 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:03,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2019-02-27 12:55:03,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:03,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:03,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:03,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:03,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:03,679 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#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; {457#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#(<= 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; {458#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#(<= 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; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,682 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(<= 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; {456#false} is VALID [2019-02-27 12:55:03,682 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2019-02-27 12:55:03,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-02-27 12:55:03,684 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-27 12:55:03,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:03,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:55:03,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 12:55:03,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 12:55:03,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:03,686 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-27 12:55:03,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-27 12:55:03,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-27 12:55:03,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-27 12:55:03,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-27 12:55:03,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-27 12:55:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:03,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:55:03,766 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#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; {457#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#(<= 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; {458#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#(<= 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; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,772 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(<= 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; {456#false} is VALID [2019-02-27 12:55:03,772 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2019-02-27 12:55:03,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-02-27 12:55:03,774 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-27 12:55:03,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:55:03,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-02-27 12:55:03,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#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; {456#false} is VALID [2019-02-27 12:55:03,838 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2019-02-27 12:55:03,840 INFO L273 TraceCheckUtils]: 3: Hoare triple {502#(<= 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; {456#false} is VALID [2019-02-27 12:55:03,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {506#(< 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; {502#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#(<= 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; {506#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,842 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#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; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:03,842 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-27 12:55:03,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:55:03,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-02-27 12:55:03,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:55:03,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-02-27 12:55:03,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:03,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-27 12:55:03,872 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-27 12:55:03,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-27 12:55:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-27 12:55:03,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:55:03,873 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-02-27 12:55:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:03,953 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-27 12:55:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-27 12:55:03,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-02-27 12:55:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-27 12:55:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-02-27 12:55:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-27 12:55:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-02-27 12:55:03,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2019-02-27 12:55:03,989 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-27 12:55:03,990 INFO L225 Difference]: With dead ends: 17 [2019-02-27 12:55:03,990 INFO L226 Difference]: Without dead ends: 11 [2019-02-27 12:55:03,991 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-27 12:55:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-27 12:55:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-27 12:55:04,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:04,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-02-27 12:55:04,011 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-27 12:55:04,011 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-27 12:55:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:04,012 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-27 12:55:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-27 12:55:04,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:04,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:04,013 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-27 12:55:04,013 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-27 12:55:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:04,014 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-27 12:55:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-27 12:55:04,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:04,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:04,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:04,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-27 12:55:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-27 12:55:04,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-02-27 12:55:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:04,016 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-27 12:55:04,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-27 12:55:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-27 12:55:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-27 12:55:04,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:04,017 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-02-27 12:55:04,017 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2019-02-27 12:55:04,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:04,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:04,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-27 12:55:04,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:04,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:04,114 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#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; {587#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#(<= 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; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#(<= 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; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,117 INFO L273 TraceCheckUtils]: 3: Hoare triple {589#(<= 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; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {590#(<= 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; {586#false} is VALID [2019-02-27 12:55:04,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2019-02-27 12:55:04,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-02-27 12:55:04,125 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-27 12:55:04,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:04,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:55:04,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 12:55:04,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 12:55:04,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:04,125 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-27 12:55:04,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-27 12:55:04,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-27 12:55:04,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-27 12:55:04,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-27 12:55:04,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-27 12:55:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:04,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:55:04,221 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#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; {587#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#(<= 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; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#(<= 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; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,228 INFO L273 TraceCheckUtils]: 3: Hoare triple {589#(<= 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; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,230 INFO L273 TraceCheckUtils]: 4: Hoare triple {590#(<= 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; {586#false} is VALID [2019-02-27 12:55:04,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2019-02-27 12:55:04,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-02-27 12:55:04,231 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-27 12:55:04,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:55:04,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-02-27 12:55:04,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#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; {586#false} is VALID [2019-02-27 12:55:04,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2019-02-27 12:55:04,292 INFO L273 TraceCheckUtils]: 4: Hoare triple {636#(<= 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; {586#false} is VALID [2019-02-27 12:55:04,293 INFO L273 TraceCheckUtils]: 3: Hoare triple {590#(<= 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; {636#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {589#(<= 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; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#(<= 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; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,294 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#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; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,295 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-27 12:55:04,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:55:04,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-02-27 12:55:04,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:55:04,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-27 12:55:04,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:04,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 12:55:04,326 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-27 12:55:04,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 12:55:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 12:55:04,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:55:04,328 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-02-27 12:55:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:04,412 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-02-27 12:55:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-27 12:55:04,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-27 12:55:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:55:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-02-27 12:55:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 12:55:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-02-27 12:55:04,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2019-02-27 12:55:04,463 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-27 12:55:04,464 INFO L225 Difference]: With dead ends: 18 [2019-02-27 12:55:04,464 INFO L226 Difference]: Without dead ends: 12 [2019-02-27 12:55:04,465 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-27 12:55:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-27 12:55:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-27 12:55:04,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:04,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-02-27 12:55:04,487 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-27 12:55:04,487 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-27 12:55:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:04,489 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-27 12:55:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-27 12:55:04,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:04,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:04,490 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-27 12:55:04,490 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-27 12:55:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:04,491 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-02-27 12:55:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-27 12:55:04,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:04,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:04,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:04,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-27 12:55:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-27 12:55:04,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-02-27 12:55:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:04,493 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-27 12:55:04,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-27 12:55:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-27 12:55:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-27 12:55:04,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:04,494 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2019-02-27 12:55:04,494 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2019-02-27 12:55:04,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:04,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:04,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-27 12:55:04,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:04,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:04,606 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#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; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 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; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 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; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,610 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 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; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,611 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 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; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 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; {728#false} is VALID [2019-02-27 12:55:04,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2019-02-27 12:55:04,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-02-27 12:55:04,614 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-27 12:55:04,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:04,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:55:04,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 12:55:04,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 12:55:04,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:04,616 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-27 12:55:04,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:04,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:55:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:04,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-27 12:55:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:04,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:55:04,761 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#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; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 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; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 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; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,764 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 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; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,765 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 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; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 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; {728#false} is VALID [2019-02-27 12:55:04,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2019-02-27 12:55:04,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-02-27 12:55:04,769 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-27 12:55:04,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:55:04,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-02-27 12:55:04,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#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; {728#false} is VALID [2019-02-27 12:55:04,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2019-02-27 12:55:04,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 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; {728#false} is VALID [2019-02-27 12:55:04,842 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 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; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,846 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 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; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 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; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 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; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,849 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#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; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2019-02-27 12:55:04,850 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-27 12:55:04,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:55:04,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-02-27 12:55:04,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:55:04,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-27 12:55:04,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:04,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-27 12:55:04,883 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-27 12:55:04,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-27 12:55:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-27 12:55:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:55:04,884 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-27 12:55:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:05,038 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-02-27 12:55:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-27 12:55:05,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-02-27 12:55:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-27 12:55:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-02-27 12:55:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-27 12:55:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-02-27 12:55:05,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2019-02-27 12:55:05,088 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-27 12:55:05,088 INFO L225 Difference]: With dead ends: 19 [2019-02-27 12:55:05,088 INFO L226 Difference]: Without dead ends: 13 [2019-02-27 12:55:05,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:55:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-27 12:55:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-27 12:55:05,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:05,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-02-27 12:55:05,196 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-02-27 12:55:05,197 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-02-27 12:55:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:05,198 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-27 12:55:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-27 12:55:05,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:05,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:05,198 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-02-27 12:55:05,199 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-02-27 12:55:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:05,199 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-27 12:55:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-27 12:55:05,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:05,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:05,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:05,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-27 12:55:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-02-27 12:55:05,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-02-27 12:55:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:05,202 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-02-27 12:55:05,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-27 12:55:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-02-27 12:55:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-27 12:55:05,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:05,202 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-02-27 12:55:05,203 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:05,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:05,203 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2019-02-27 12:55:05,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:05,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:05,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:05,316 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#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; {881#true} is VALID [2019-02-27 12:55:05,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {881#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; {881#true} is VALID [2019-02-27 12:55:05,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {881#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; {881#true} is VALID [2019-02-27 12:55:05,317 INFO L273 TraceCheckUtils]: 3: Hoare triple {881#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; {881#true} is VALID [2019-02-27 12:55:05,317 INFO L273 TraceCheckUtils]: 4: Hoare triple {881#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; {881#true} is VALID [2019-02-27 12:55:05,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {881#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; {881#true} is VALID [2019-02-27 12:55:05,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {881#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; {881#true} is VALID [2019-02-27 12:55:05,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {881#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {883#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4)} is VALID [2019-02-27 12:55:05,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {883#(<= (+ 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; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-27 12:55:05,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {884#(<= (+ 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; {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2019-02-27 12:55:05,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#(<= (+ 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; {882#false} is VALID [2019-02-27 12:55:05,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-02-27 12:55:05,323 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-27 12:55:05,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:05,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:55:05,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 12:55:05,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 12:55:05,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:05,324 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-27 12:55:05,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-27 12:55:05,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-27 12:55:05,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-27 12:55:05,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-27 12:55:05,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-27 12:55:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:05,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:55:05,463 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#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; {889#(<= 5 ~n)} is VALID [2019-02-27 12:55:05,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {889#(<= 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; {889#(<= 5 ~n)} is VALID [2019-02-27 12:55:05,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {889#(<= 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; {889#(<= 5 ~n)} is VALID [2019-02-27 12:55:05,467 INFO L273 TraceCheckUtils]: 3: Hoare triple {889#(<= 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; {889#(<= 5 ~n)} is VALID [2019-02-27 12:55:05,467 INFO L273 TraceCheckUtils]: 4: Hoare triple {889#(<= 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; {889#(<= 5 ~n)} is VALID [2019-02-27 12:55:05,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {889#(<= 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; {889#(<= 5 ~n)} is VALID [2019-02-27 12:55:05,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {889#(<= 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; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-27 12:55:05,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {908#(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; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-27 12:55:05,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {908#(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; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-27 12:55:05,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {908#(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; {918#(and (<= ULTIMATE.start_SelectionSort_~lh~4 1) (<= 5 ~n))} is VALID [2019-02-27 12:55:05,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(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; {882#false} is VALID [2019-02-27 12:55:05,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-02-27 12:55:05,496 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-27 12:55:05,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:55:05,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-02-27 12:55:05,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#(<= (+ 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; {882#false} is VALID [2019-02-27 12:55:05,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {884#(<= (+ 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; {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2019-02-27 12:55:05,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#(<= (+ 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; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-27 12:55:05,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(<= (+ 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; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-27 12:55:05,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {940#(< 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; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-27 12:55:05,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {940#(< 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; {940#(< 1 ~n)} is VALID [2019-02-27 12:55:05,576 INFO L273 TraceCheckUtils]: 4: Hoare triple {940#(< 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; {940#(< 1 ~n)} is VALID [2019-02-27 12:55:05,577 INFO L273 TraceCheckUtils]: 3: Hoare triple {940#(< 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; {940#(< 1 ~n)} is VALID [2019-02-27 12:55:05,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {940#(< 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; {940#(< 1 ~n)} is VALID [2019-02-27 12:55:05,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {940#(< 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; {940#(< 1 ~n)} is VALID [2019-02-27 12:55:05,579 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#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; {940#(< 1 ~n)} is VALID [2019-02-27 12:55:05,580 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-27 12:55:05,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:55:05,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-02-27 12:55:05,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:55:05,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-27 12:55:05,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:05,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-27 12:55:05,635 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-27 12:55:05,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-27 12:55:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-27 12:55:05,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-02-27 12:55:05,636 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-02-27 12:55:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:06,016 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-02-27 12:55:06,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-27 12:55:06,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-27 12:55:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 12:55:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-02-27 12:55:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 12:55:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-02-27 12:55:06,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2019-02-27 12:55:06,060 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-27 12:55:06,062 INFO L225 Difference]: With dead ends: 21 [2019-02-27 12:55:06,062 INFO L226 Difference]: Without dead ends: 19 [2019-02-27 12:55:06,063 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-27 12:55:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-27 12:55:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-27 12:55:06,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:06,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-02-27 12:55:06,122 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-02-27 12:55:06,123 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-02-27 12:55:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:06,125 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-02-27 12:55:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-27 12:55:06,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:06,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:06,126 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-02-27 12:55:06,126 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-02-27 12:55:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:06,127 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-02-27 12:55:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-27 12:55:06,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:06,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:06,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:06,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-27 12:55:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-02-27 12:55:06,129 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-02-27 12:55:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:06,129 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-02-27 12:55:06,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-27 12:55:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-02-27 12:55:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-27 12:55:06,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:06,130 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-02-27 12:55:06,130 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2019-02-27 12:55:06,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:06,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:06,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-27 12:55:06,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:06,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:06,202 INFO L273 TraceCheckUtils]: 0: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,204 INFO L273 TraceCheckUtils]: 3: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,204 INFO L273 TraceCheckUtils]: 4: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {1079#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1079#true} is VALID [2019-02-27 12:55:06,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {1079#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; {1079#true} is VALID [2019-02-27 12:55:06,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {1079#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1081#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-27 12:55:06,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {1081#(<= 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; {1082#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} is VALID [2019-02-27 12:55:06,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1080#false} is VALID [2019-02-27 12:55:06,208 INFO L273 TraceCheckUtils]: 13: Hoare triple {1080#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; {1080#false} is VALID [2019-02-27 12:55:06,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {1080#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1080#false} is VALID [2019-02-27 12:55:06,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#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; {1080#false} is VALID [2019-02-27 12:55:06,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {1080#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; {1080#false} is VALID [2019-02-27 12:55:06,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2019-02-27 12:55:06,210 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-27 12:55:06,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:06,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-27 12:55:06,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:06,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-02-27 12:55:06,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:06,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:06,233 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-27 12:55:06,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:06,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:55:06,234 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-02-27 12:55:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:06,371 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-02-27 12:55:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:06,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-02-27 12:55:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-27 12:55:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-02-27 12:55:06,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-02-27 12:55:06,439 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-27 12:55:06,440 INFO L225 Difference]: With dead ends: 29 [2019-02-27 12:55:06,440 INFO L226 Difference]: Without dead ends: 21 [2019-02-27 12:55:06,440 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-27 12:55:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-27 12:55:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-27 12:55:06,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:06,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-02-27 12:55:06,588 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-02-27 12:55:06,588 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-02-27 12:55:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:06,589 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-02-27 12:55:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-27 12:55:06,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:06,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:06,590 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-02-27 12:55:06,590 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-02-27 12:55:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:06,592 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-02-27 12:55:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-27 12:55:06,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:06,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:06,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:06,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-27 12:55:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-02-27 12:55:06,594 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-02-27 12:55:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:06,594 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-02-27 12:55:06,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-02-27 12:55:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-27 12:55:06,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:06,595 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-02-27 12:55:06,595 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2019-02-27 12:55:06,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:06,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-27 12:55:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:06,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:06,979 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#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; {1225#true} is VALID [2019-02-27 12:55:06,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {1225#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; {1225#true} is VALID [2019-02-27 12:55:06,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {1225#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; {1225#true} is VALID [2019-02-27 12:55:06,980 INFO L273 TraceCheckUtils]: 3: Hoare triple {1225#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; {1225#true} is VALID [2019-02-27 12:55:06,981 INFO L273 TraceCheckUtils]: 4: Hoare triple {1225#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; {1225#true} is VALID [2019-02-27 12:55:06,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {1225#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; {1225#true} is VALID [2019-02-27 12:55:06,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#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; {1225#true} is VALID [2019-02-27 12:55:06,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {1225#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1227#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-27 12:55:06,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {1227#(<= 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; {1228#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2019-02-27 12:55:06,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {1228#(<= 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; {1229#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-27 12:55:06,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {1229#(<= ~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; {1230#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2019-02-27 12:55:06,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {1230#(<= ~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; {1226#false} is VALID [2019-02-27 12:55:06,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:06,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:06,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:06,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:06,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:06,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:06,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:06,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-02-27 12:55:06,995 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-27 12:55:06,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:06,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:55:06,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 12:55:06,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 12:55:06,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:06,995 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-27 12:55:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:07,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:55:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:07,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-27 12:55:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:55:07,177 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#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; {1234#(<= 5 ~n)} is VALID [2019-02-27 12:55:07,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {1234#(<= 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; {1234#(<= 5 ~n)} is VALID [2019-02-27 12:55:07,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {1234#(<= 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; {1234#(<= 5 ~n)} is VALID [2019-02-27 12:55:07,188 INFO L273 TraceCheckUtils]: 3: Hoare triple {1234#(<= 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; {1234#(<= 5 ~n)} is VALID [2019-02-27 12:55:07,188 INFO L273 TraceCheckUtils]: 4: Hoare triple {1234#(<= 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; {1234#(<= 5 ~n)} is VALID [2019-02-27 12:55:07,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {1234#(<= 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; {1234#(<= 5 ~n)} is VALID [2019-02-27 12:55:07,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {1234#(<= 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; {1253#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2019-02-27 12:55:07,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {1253#(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; {1257#(and (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 5 ~n))} is VALID [2019-02-27 12:55:07,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {1257#(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; {1261#(and (<= ULTIMATE.start_SelectionSort_~i~4 2) (<= 5 ~n))} is VALID [2019-02-27 12:55:07,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {1261#(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; {1226#false} is VALID [2019-02-27 12:55:07,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:07,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:07,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:07,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-02-27 12:55:07,204 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-27 12:55:07,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:55:07,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-02-27 12:55:07,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:07,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:07,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#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; {1226#false} is VALID [2019-02-27 12:55:07,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2019-02-27 12:55:07,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {1325#(< 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; {1226#false} is VALID [2019-02-27 12:55:07,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {1329#(< (+ 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; {1325#(< ULTIMATE.start_SelectionSort_~i~4 ~n)} is VALID [2019-02-27 12:55:07,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#(< (+ 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; {1329#(< (+ ULTIMATE.start_SelectionSort_~i~4 1) ~n)} is VALID [2019-02-27 12:55:07,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {1337#(< 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; {1333#(< (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2019-02-27 12:55:07,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {1337#(< 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; {1337#(< 2 ~n)} is VALID [2019-02-27 12:55:07,284 INFO L273 TraceCheckUtils]: 4: Hoare triple {1337#(< 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; {1337#(< 2 ~n)} is VALID [2019-02-27 12:55:07,284 INFO L273 TraceCheckUtils]: 3: Hoare triple {1337#(< 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; {1337#(< 2 ~n)} is VALID [2019-02-27 12:55:07,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {1337#(< 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; {1337#(< 2 ~n)} is VALID [2019-02-27 12:55:07,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {1337#(< 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; {1337#(< 2 ~n)} is VALID [2019-02-27 12:55:07,286 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#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; {1337#(< 2 ~n)} is VALID [2019-02-27 12:55:07,287 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-27 12:55:07,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:55:07,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-02-27 12:55:07,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:55:07,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-02-27 12:55:07,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:07,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-27 12:55:07,353 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-27 12:55:07,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-27 12:55:07,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-27 12:55:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-02-27 12:55:07,354 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-02-27 12:55:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:07,820 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-02-27 12:55:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-27 12:55:07,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-02-27 12:55:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-27 12:55:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-02-27 12:55:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-27 12:55:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-02-27 12:55:07,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2019-02-27 12:55:07,867 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-27 12:55:07,867 INFO L225 Difference]: With dead ends: 39 [2019-02-27 12:55:07,867 INFO L226 Difference]: Without dead ends: 26 [2019-02-27 12:55:07,868 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-27 12:55:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-27 12:55:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-27 12:55:07,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:07,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2019-02-27 12:55:07,971 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-02-27 12:55:07,971 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-02-27 12:55:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:07,972 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-27 12:55:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-27 12:55:07,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:07,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:07,973 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-02-27 12:55:07,973 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-02-27 12:55:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:07,974 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-27 12:55:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-27 12:55:07,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:07,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:07,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:07,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-27 12:55:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-02-27 12:55:07,976 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-02-27 12:55:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:07,977 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-02-27 12:55:07,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-27 12:55:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-02-27 12:55:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-27 12:55:07,978 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:07,978 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-02-27 12:55:07,978 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:07,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2019-02-27 12:55:07,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:07,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:07,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:07,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:08,240 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,241 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,242 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {1544#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1546#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2019-02-27 12:55:08,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(<= 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; {1547#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2019-02-27 12:55:08,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {1547#(<= 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; {1548#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 3))} is VALID [2019-02-27 12:55:08,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {1548#(<= 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; {1549#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2019-02-27 12:55:08,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~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; {1550#(<= ~n (+ ULTIMATE.start_SelectionSort_~i~4 1))} is VALID [2019-02-27 12:55:08,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {1550#(<= ~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; {1551#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2019-02-27 12:55:08,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {1551#(<= ~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; {1545#false} is VALID [2019-02-27 12:55:08,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {1545#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; {1545#false} is VALID [2019-02-27 12:55:08,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {1545#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1545#false} is VALID [2019-02-27 12:55:08,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {1545#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; {1545#false} is VALID [2019-02-27 12:55:08,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {1545#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; {1545#false} is VALID [2019-02-27 12:55:08,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {1545#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1545#false} is VALID [2019-02-27 12:55:08,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {1545#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; {1545#false} is VALID [2019-02-27 12:55:08,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {1545#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; {1545#false} is VALID [2019-02-27 12:55:08,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-02-27 12:55:08,281 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-27 12:55:08,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:08,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:55:08,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-27 12:55:08,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-27 12:55:08,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:55:08,282 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-27 12:55:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-27 12:55:08,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-27 12:55:08,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-27 12:55:08,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-27 12:55:08,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-27 12:55:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:08,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:55:08,399 INFO L467 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-27 12:55:08,406 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:55:08,421 INFO L301 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-27 12:55:08,421 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-27 12:55:08,424 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:55:08,424 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-27 12:55:08,424 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-27 12:55:08,758 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,759 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,759 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#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; {1570#(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-27 12:55:08,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {1570#(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; {1574#(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-27 12:55:08,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {1574#(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; {1574#(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-27 12:55:08,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {1574#(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; {1574#(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-27 12:55:08,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {1574#(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; {1574#(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-27 12:55:08,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(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; {1574#(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-27 12:55:08,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(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; {1574#(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-27 12:55:08,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {1574#(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; {1574#(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-27 12:55:08,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#(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; {1574#(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-27 12:55:08,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {1574#(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; {1574#(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-27 12:55:08,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {1574#(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; {1574#(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-27 12:55:08,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {1574#(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; {1574#(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-27 12:55:08,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {1574#(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; {1574#(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-27 12:55:08,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {1574#(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; {1574#(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-27 12:55:08,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {1574#(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; {1574#(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-27 12:55:08,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {1574#(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; {1545#false} is VALID [2019-02-27 12:55:08,821 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-02-27 12:55:08,825 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-27 12:55:08,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:55:08,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-02-27 12:55:08,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {1623#(= (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; {1545#false} is VALID [2019-02-27 12:55:08,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {1623#(= (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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {1666#(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; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2019-02-27 12:55:08,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#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; {1666#(or (<= 0 ULTIMATE.start_main_~i~7) (= (select ULTIMATE.start_main_~array~7 0) 0))} is VALID [2019-02-27 12:55:08,962 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,962 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,963 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#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; {1544#true} is VALID [2019-02-27 12:55:08,965 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-27 12:55:08,984 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-27 12:55:08,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2019-02-27 12:55:08,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:08,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-02-27 12:55:08,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:08,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:08,995 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-27 12:55:08,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-02-27 12:55:08,997 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-02-27 12:55:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:09,240 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-02-27 12:55:09,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:09,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-02-27 12:55:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-02-27 12:55:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-02-27 12:55:09,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2019-02-27 12:55:09,256 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-27 12:55:09,256 INFO L225 Difference]: With dead ends: 26 [2019-02-27 12:55:09,256 INFO L226 Difference]: Without dead ends: 0 [2019-02-27 12:55:09,257 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-27 12:55:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-27 12:55:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-27 12:55:09,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:09,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-27 12:55:09,258 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:55:09,258 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:55:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:09,259 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:55:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:55:09,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:09,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:09,259 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:55:09,259 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:55:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:09,260 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:55:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:55:09,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:09,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:09,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:09,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-27 12:55:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-27 12:55:09,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-02-27 12:55:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:09,261 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-27 12:55:09,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:55:09,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:09,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-27 12:55:09,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-27 12:55:09,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-27 12:55:09,540 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-02-27 12:55:09,726 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-02-27 12:55:09,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-02-27 12:55:09,734 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-02-27 12:55:09,734 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-27 12:55:09,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-02-27 12:55:09,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-02-27 12:55:09,735 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 (= ULTIMATE.start_SelectionSort_~lh~4 0)) (and .cse0 .cse1 .cse2 (<= .cse3 ~n) .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) .cse4))) [2019-02-27 12:55:09,735 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (= ~n 5))) (or (and (<= 4 ULTIMATE.start_main_~i~7) .cse0) (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))) [2019-02-27 12:55:09,737 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-27 12:55:09,750 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-27 12:55:09,755 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-27 12:55:09,767 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.02 12:55:09 BoogieIcfgContainer [2019-02-27 12:55:09,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-27 12:55:09,769 INFO L168 Benchmark]: Toolchain (without parser) took 16299.60 ms. Allocated memory was 131.6 MB in the beginning and 342.4 MB in the end (delta: 210.8 MB). Free memory was 106.4 MB in the beginning and 226.9 MB in the end (delta: -120.6 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,770 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 131.6 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 12:55:09,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.55 ms. Allocated memory is still 131.6 MB. Free memory was 106.4 MB in the beginning and 104.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,771 INFO L168 Benchmark]: Boogie Preprocessor took 30.43 ms. Allocated memory is still 131.6 MB. Free memory was 104.7 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,772 INFO L168 Benchmark]: RCFGBuilder took 678.07 ms. Allocated memory is still 131.6 MB. Free memory was 103.4 MB in the beginning and 90.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,773 INFO L168 Benchmark]: TraceAbstraction took 15540.38 ms. Allocated memory was 131.6 MB in the beginning and 342.4 MB in the end (delta: 210.8 MB). Free memory was 89.8 MB in the beginning and 226.9 MB in the end (delta: -137.1 MB). Peak memory consumption was 73.7 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,777 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.18 ms. Allocated memory is still 131.6 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.55 ms. Allocated memory is still 131.6 MB. Free memory was 106.4 MB in the beginning and 104.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.43 ms. Allocated memory is still 131.6 MB. Free memory was 104.7 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 678.07 ms. Allocated memory is still 131.6 MB. Free memory was 103.4 MB in the beginning and 90.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15540.38 ms. Allocated memory was 131.6 MB in the beginning and 342.4 MB in the end (delta: 210.8 MB). Free memory was 89.8 MB in the beginning and 226.9 MB in the end (delta: -137.1 MB). Peak memory consumption was 73.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((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) || (((((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_~i~4 <= SelectionSort_~lh~4 + 1) && ~n <= SelectionSort_~i~4) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (4 <= main_~i~7 && ~n == 5) || ((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) - 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, 15.4s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 51 SDslu, 87 SDs, 0 SdLazy, 143 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.2s 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.5s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, -0.7066666666666667 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 30 NumberOfFragments, 234 HoareAnnotationTreeSize, 4 FomulaSimplifications, 859 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s 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...