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_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:30:27,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:30:27,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:30:27,723 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:30:27,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:30:27,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:30:27,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:30:27,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:30:27,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:30:27,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:30:27,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:30:27,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:30:27,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:30:27,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:30:27,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:30:27,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:30:27,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:30:27,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:30:27,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:30:27,748 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:30:27,749 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:30:27,750 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:30:27,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:30:27,753 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:30:27,753 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:30:27,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:30:27,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:30:27,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:30:27,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:30:27,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:30:27,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:30:27,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:30:27,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:30:27,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:30:27,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:30:27,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:30:27,762 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 14:30:27,786 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:30:27,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:30:27,787 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:30:27,788 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:30:27,788 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:30:27,788 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:30:27,788 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:30:27,788 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:30:27,789 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:30:27,789 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:30:27,789 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:30:27,789 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:30:27,789 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:30:27,793 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:30:27,794 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:30:27,794 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:30:27,794 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:30:27,795 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:30:27,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:30:27,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:30:27,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:30:27,795 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:30:27,795 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:30:27,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:30:27,798 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:30:27,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:30:27,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:30:27,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:30:27,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:30:27,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:30:27,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:30:27,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:30:27,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:30:27,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:30:27,801 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:30:27,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:30:27,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:30:27,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:30:27,802 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:30:27,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:30:27,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:30:27,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:30:27,897 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:30:27,898 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:30:27,898 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl [2019-01-07 14:30:27,899 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl' [2019-01-07 14:30:27,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:30:27,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:30:27,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:30:27,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:30:27,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:30:27,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:27,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:27,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:30:27,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:30:27,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:30:27,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:30:27,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:28,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:28,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:28,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:28,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:28,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:28,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/1) ... [2019-01-07 14:30:28,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:30:28,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:30:28,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:30:28,012 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:30:28,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (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-01-07 14:30:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:30:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:30:28,541 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:30:28,541 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-07 14:30:28,542 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:30:28 BoogieIcfgContainer [2019-01-07 14:30:28,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:30:28,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:30:28,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:30:28,556 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:30:28,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:27" (1/2) ... [2019-01-07 14:30:28,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c08816a and model type insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:30:28, skipping insertion in model container [2019-01-07 14:30:28,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:30:28" (2/2) ... [2019-01-07 14:30:28,563 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort.i_3.bpl [2019-01-07 14:30:28,582 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:30:28,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:30:28,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:30:28,645 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:30:28,646 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:30:28,646 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:30:28,646 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:30:28,646 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:30:28,646 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:30:28,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:30:28,647 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:30:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 14:30:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:30:28,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:30:28,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:30:28,672 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:30:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:30:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-07 14:30:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:30:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:28,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:30:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:28,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:30:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:30:28,941 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {11#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:30:28,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] 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-01-07 14:30:28,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-01-07 14:30:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:30:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:30:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:30:28,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:30:28,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:30:28,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:30:28,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:30:28,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:30:28,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:30:29,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:30:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:30:29,008 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 14:30:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:30:29,118 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 14:30:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:30:29,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:30:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:30:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:30:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-07 14:30:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:30:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-07 14:30:29,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-01-07 14:30:29,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:30:29,176 INFO L225 Difference]: With dead ends: 9 [2019-01-07 14:30:29,177 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 14:30:29,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:30:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 14:30:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 14:30:29,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:30:29,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:29,212 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:29,212 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:30:29,214 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:30:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:30:29,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:30:29,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:30:29,215 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:29,215 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:30:29,216 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:30:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:30:29,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:30:29,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:30:29,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:30:29,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:30:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:30:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 14:30:29,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 14:30:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:30:29,221 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 14:30:29,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:30:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:30:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:30:29,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:30:29,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:30:29,222 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:30:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:30:29,223 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-07 14:30:29,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:30:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:29,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:30:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:29,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:30:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:30:29,513 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:30:29,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-01-07 14:30:29,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-01-07 14:30:29,521 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-07 14:30:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:30:29,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:30:29,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:30:29,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 14:30:29,525 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-07 14:30:29,600 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:30:29,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:30:29,740 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-01-07 14:30:34,696 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:30:34,697 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:30:34,698 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:30:34,699 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:30:34,699 WARN L224 ngHoareTripleChecker]: Pre: {2147483637#(or (forall ((v_idx_18 Int)) (exists ((v_v_2_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 2)) (= v_v_2_1 (select c_ULTIMATE.start_main_~v~5 v_idx_18)) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 2)))) (forall ((v_idx_21 Int) (v_idx_22 Int) (v_idx_20 Int) (v_idx_19 Int)) (exists ((v_v_8_1 Int) (v_v_3_1 Int) (v_b_2_1 Int) (v_v_4_1 Int) (v_b_3_1 Int) (v_b_0_1 Int) (v_v_7_1 Int)) (and (= (- c_ULTIMATE.start_main_~i~5) (+ v_b_3_1 (- 2))) (<= (- c_ULTIMATE.start_main_~j~5 v_b_3_1) 0) (<= (- c_ULTIMATE.start_main_~i~5 v_b_2_1) (- 1)) (<= (- (- v_b_0_1) v_b_2_1) (- 1)) (= 1 (+ (- c_ULTIMATE.start_main_~j~5) 3)) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_0_1)) (- 2)) (or (= v_v_8_1 (select c_ULTIMATE.start_main_~v~5 v_idx_22)) (< v_idx_22 v_b_3_1)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_3_1)) 0) (<= (- v_v_4_1 v_v_7_1) 0) (or (<= v_b_3_1 v_idx_21) (= (select c_ULTIMATE.start_main_~v~5 v_idx_21) v_v_7_1) (< v_idx_21 v_b_2_1)) (<= (- (- v_b_0_1) v_b_3_1) (- 2)) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) 2) (= (+ v_b_2_1 (- 1)) (+ v_b_3_1 (- 2))) (<= (- c_ULTIMATE.start_main_~i~5 c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- c_ULTIMATE.start_main_~key~5 v_v_7_1) 0) (<= (- (- c_ULTIMATE.start_main_~i~5) (- c_ULTIMATE.start_main_~j~5)) 2) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_2_1)) 3) (<= (- v_b_2_1 (- v_b_3_1)) 3) (<= (- (- v_b_0_1) (- v_b_2_1)) 1) (<= (- c_ULTIMATE.start_main_~j~5 v_b_2_1) 1) (<= (- v_b_3_1 (- v_b_3_1)) 4) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_2_1)) 1) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_2_1) (- 3)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_4_1)) 0) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) (+ (- v_b_2_1) 3)) (= (+ v_b_3_1 (- 2)) (+ (- v_b_3_1) 2)) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) v_b_3_1) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_0_1)) 2) (<= (- (- v_b_3_1) v_b_3_1) (- 4)) (= (+ v_b_2_1 1) (+ (- c_ULTIMATE.start_main_~i~5) 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_3_1)) 4) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 4)) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_3_1)) 2) (= (+ v_b_3_1 (- 2)) (+ c_ULTIMATE.start_main_~j~5 (- 2))) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~i~5) 0) (<= (- v_b_2_1 v_b_3_1) (- 1)) (= c_ULTIMATE.start_main_~j~5 (+ (- c_ULTIMATE.start_main_~i~5) 2)) (= 1 (+ c_ULTIMATE.start_main_~j~5 (- 1))) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) (+ (- c_ULTIMATE.start_main_~j~5) 4)) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- v_b_0_1 v_b_2_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_3_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_2_1)) 1) (<= (- (- v_b_2_1) v_b_3_1) (- 3)) (or (= (select c_ULTIMATE.start_main_~v~5 v_idx_20) v_v_4_1) (<= v_b_2_1 v_idx_20) (< v_idx_20 v_b_0_1)) (= (+ v_b_3_1 (- 2)) (+ (- v_b_2_1) 1)) (or (= v_v_3_1 (select c_ULTIMATE.start_main_~v~5 v_idx_19)) (<= v_b_0_1 v_idx_19)) (<= (- (- v_b_2_1) v_b_2_1) (- 2)) (= 1 (+ v_b_0_1 1)) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_3_1) (- 4)) (= c_ULTIMATE.start_main_~i~5 (+ v_b_3_1 (- 2))) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_0_1) (- 2)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_3_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_7_1)) 0) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_2_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_0_1) 0) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_2_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_0_1)) 0) (<= (- (- v_b_0_1) (- v_b_3_1)) 2) (= 1 (+ c_ULTIMATE.start_main_~i~5 1)) (= 1 (+ (- v_b_0_1) 1)) (= (+ v_b_0_1 2) (+ (- c_ULTIMATE.start_main_~i~5) 2)) (<= (- (- v_b_2_1) (- v_b_3_1)) 1) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 4) (<= (- v_b_2_1 (- v_b_2_1)) 2) (= (+ v_b_3_1 (- 2)) (+ (- c_ULTIMATE.start_main_~j~5) 2)) (= (+ v_b_3_1 (- 2)) v_b_0_1) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~j~5)) 2) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) (+ c_ULTIMATE.start_main_~i~5 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_3_1)) 2) (= 1 (+ v_b_3_1 (- 1))) (= 1 v_b_2_1) (= (+ (- v_b_3_1) 3) 1) (<= (- c_ULTIMATE.start_main_~j~5 v_b_0_1) 2) (= (+ v_b_3_1 (- 2)) 0) (<= (- v_b_0_1 (- v_b_2_1)) 1) (<= (- c_ULTIMATE.start_main_~i~5 v_b_0_1) 0) (<= (- v_b_0_1 v_b_3_1) (- 2)) (= 1 (+ (- c_ULTIMATE.start_main_~i~5) 1)) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_0_1)) 0) (<= (- v_b_0_1 (- v_b_3_1)) 2) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~i~5)) 0) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) (+ (- v_b_0_1) 2))))))} [2019-01-07 14:30:34,700 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-07 14:30:34,701 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (or (not (<= 0 c_ULTIMATE.start_main_~i~5_primed)) (not (< c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~i~5_primed)))) (= c_ULTIMATE.start_main_~v~5_primed (store c_ULTIMATE.start_main_~v~5 (+ c_ULTIMATE.start_main_~i~5_primed 1) c_ULTIMATE.start_main_~key~5_primed)) (= (+ c_ULTIMATE.start_main_~j~5 1) c_ULTIMATE.start_main_~j~5_primed) (= c_ULTIMATE.start_main_~i~5_primed (+ c_ULTIMATE.start_main_~j~5 (- 1))) (< (mod c_ULTIMATE.start_main_~j~5 4294967296) (mod c_ULTIMATE.start_main_~SIZE~5 4294967296)) (= c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~j~5))) [2019-01-07 14:30:34,702 WARN L230 ngHoareTripleChecker]: Post: {2147483636#(or (forall ((v_idx_25 Int) (v_idx_26 Int) (v_idx_23 Int) (v_idx_24 Int)) (exists ((v_b_6_1 Int) (v_b_7_1 Int) (v_b_4_1 Int) (v_v_20_1 Int) (v_v_21_1 Int) (v_v_17_1 Int) (v_v_16_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- v_v_17_1 v_v_20_1) 0) (= (+ (- v_b_6_1) 3) v_b_7_1) (= (- c_ULTIMATE.start_main_~i~5) 0) (= 0 (+ v_b_7_1 (- 2))) (<= (- v_b_4_1 (- v_b_7_1)) 2) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_6_1)) 1) (= c_ULTIMATE.start_main_~i~5 0) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_7_1)) 4) (= (+ (- v_b_7_1) 3) (+ (- c_ULTIMATE.start_main_~j~5) 3)) (<= (- c_ULTIMATE.start_main_~i~5 c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_6_1) (- 3)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_6_1)) (- 1)) (<= (- (- v_b_4_1) (- v_b_6_1)) 1) (<= (- (- v_b_4_1) v_b_7_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- c_ULTIMATE.start_main_~j~5)) 2) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_7_1)) 2) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_6_1) (- 1)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_6_1)) 3) (= (+ (- v_b_6_1) 3) (+ (- c_ULTIMATE.start_main_~j~5) 4)) (or (<= v_b_4_1 v_idx_23) (= (select c_ULTIMATE.start_main_~v~5 v_idx_23) v_v_16_1)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_7_1)) 0) (= (+ (- v_b_7_1) 3) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_4_1)) 2) (<= (- (- v_b_6_1) v_b_6_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_6_1)) 1) (= (+ (- v_b_7_1) 3) (+ v_b_4_1 1)) (<= (- v_b_4_1 (- v_b_4_1)) 0) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 4)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_7_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_4_1) 0) (= (+ (- v_b_6_1) 3) (+ v_b_6_1 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~i~5) 0) (= (+ (- v_b_6_1) 3) (+ (- v_b_4_1) 2)) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_7_1) (- 4)) (= (+ (- v_b_7_1) 3) (+ (- v_b_4_1) 1)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_6_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_17_1)) 0) (= (+ (- v_b_6_1) 3) (+ v_b_4_1 2)) (or (< v_idx_24 v_b_4_1) (= (select c_ULTIMATE.start_main_~v~5 v_idx_24) v_v_17_1) (<= v_b_6_1 v_idx_24)) (= 0 (+ c_ULTIMATE.start_main_~j~5 (- 2))) (<= (- (- v_b_6_1) v_b_7_1) (- 3)) (<= (- v_b_4_1 v_b_7_1) (- 2)) (or (< v_idx_26 v_b_7_1) (= (select c_ULTIMATE.start_main_~v~5 v_idx_26) v_v_21_1)) (<= (- v_b_4_1 (- v_b_6_1)) 1) (= (+ (- v_b_7_1) 2) 0) (<= (- (- v_b_4_1) v_b_4_1) 0) (<= (- (- v_b_4_1) v_b_6_1) (- 1)) (= (+ (- v_b_7_1) 3) 1) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_7_1)) 2) (= (+ (- v_b_6_1) 3) (+ c_ULTIMATE.start_main_~i~5 2)) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_4_1) (- 2)) (<= (- (- v_b_6_1) (- v_b_7_1)) 1) (<= (- (- v_b_4_1) (- v_b_7_1)) 2) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_4_1)) 0) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_7_1) (- 2)) (<= (- v_b_6_1 (- v_b_7_1)) 3) (<= (- c_ULTIMATE.start_main_~key~5 v_v_20_1) 0) (<= (- c_ULTIMATE.start_main_~j~5 v_b_6_1) 1) (<= (- c_ULTIMATE.start_main_~j~5 v_b_7_1) 0) (= 0 (+ v_b_6_1 (- 1))) (= 0 v_b_4_1) (= (+ (- v_b_7_1) 3) (+ (- c_ULTIMATE.start_main_~i~5) 1)) (<= (- v_b_4_1 v_b_6_1) (- 1)) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_4_1)) 0) (<= (- v_b_7_1 (- v_b_7_1)) 4) (= (+ (- v_b_7_1) 3) (+ v_b_7_1 (- 1))) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) (+ (- v_b_6_1) 3)) (<= (- v_b_6_1 v_b_7_1) (- 1)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_4_1) 0) (<= (- v_b_6_1 (- v_b_6_1)) 2) (= c_ULTIMATE.start_main_~j~5 (+ (- v_b_6_1) 3)) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 4) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_4_1)) (- 2)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_20_1)) 0) (or (<= v_b_7_1 v_idx_25) (= (select c_ULTIMATE.start_main_~v~5 v_idx_25) v_v_20_1) (< v_idx_25 v_b_6_1)) (= (+ (- v_b_6_1) 3) 2) (<= (- (- v_b_7_1) v_b_7_1) (- 4)) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~j~5)) 2) (= 0 (+ (- c_ULTIMATE.start_main_~j~5) 2)) (<= (- c_ULTIMATE.start_main_~j~5 v_b_4_1) 2) (= (+ (- v_b_7_1) 3) (+ c_ULTIMATE.start_main_~i~5 1)) (= 0 (+ (- v_b_6_1) 1)) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~i~5)) 0) (= (+ (- v_b_7_1) 3) v_b_6_1)))) (forall ((v_idx_30 Int) (v_idx_31 Int) (v_idx_29 Int) (v_idx_27 Int) (v_idx_28 Int)) (exists ((v_b_11_1 Int) (v_v_23_1 Int) (v_b_8_1 Int) (v_v_3_1 Int) (v_v_4_1 Int) (v_b_10_1 Int) (v_b_0_1 Int) (v_v_26_1 Int) (v_v_27_1 Int)) (and (<= (- v_b_8_1 (- v_b_8_1)) 2) (or (<= v_b_10_1 v_idx_29) (< v_idx_29 v_b_8_1) (= (select c_ULTIMATE.start_main_~v~5 v_idx_29) v_v_23_1)) (<= (- (- v_b_0_1) (- v_b_8_1)) 1) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) (+ (- v_b_10_1) 3)) (or (<= v_b_11_1 v_idx_30) (< v_idx_30 v_b_10_1) (= (select c_ULTIMATE.start_main_~v~5 v_idx_30) v_v_26_1)) (= (+ (- v_b_10_1) 5) (+ v_b_0_1 3)) (<= (- v_b_10_1 (- v_b_11_1)) 5) (<= (- c_ULTIMATE.start_main_~j~5 v_b_11_1) 0) (<= (- (- v_b_10_1) v_b_10_1) (- 4)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_8_1)) 4) (<= (- c_ULTIMATE.start_main_~i~5 c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_0_1)) 3) (<= (- (- v_b_0_1) v_b_11_1) (- 3)) (= (+ v_b_8_1 1) (+ (- c_ULTIMATE.start_main_~j~5) 5)) (= 1 (+ (- v_b_10_1) 3)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_4_1)) 0) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_26_1)) 0) (= 2 (+ (- c_ULTIMATE.start_main_~j~5) 5)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_10_1) (- 1)) (= (+ (- v_b_11_1) 3) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_8_1)) 2) (= c_ULTIMATE.start_main_~i~5 (+ (- v_b_10_1) 3)) (<= (- (- v_v_23_1) (- v_v_4_1)) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (= (+ (- v_b_10_1) 5) v_b_11_1) (= (+ (- v_b_10_1) 3) (+ c_ULTIMATE.start_main_~j~5 (- 2))) (= (+ (- c_ULTIMATE.start_main_~j~5) 5) (+ (- c_ULTIMATE.start_main_~i~5) 3)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_8_1) (- 2)) (<= (- (- v_b_11_1) (- v_b_8_1)) (- 2)) (= (+ (- c_ULTIMATE.start_main_~j~5) 5) (+ (- v_b_11_1) 5)) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 6)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_11_1)) 6) (<= (- (- v_b_0_1) (- v_b_11_1)) 3) (<= (- (- v_b_8_1) v_b_8_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_8_1)) (- 2)) (= (+ (- c_ULTIMATE.start_main_~i~5) 4) (+ (- v_b_10_1) 5)) (or (< v_idx_28 v_b_0_1) (<= v_b_8_1 v_idx_28) (= v_v_4_1 (select c_ULTIMATE.start_main_~v~5 v_idx_28))) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_11_1)) 2) (= v_b_0_1 (+ c_ULTIMATE.start_main_~j~5 (- 3))) (<= (- v_b_0_1 v_b_8_1) (- 1)) (<= (- c_ULTIMATE.start_main_~j~5 v_b_10_1) 1) (= (+ v_b_8_1 (- 1)) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- v_b_11_1) v_b_11_1) (- 6)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_0_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_10_1)) 1) (<= (- c_ULTIMATE.start_main_~i~5 v_b_11_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_0_1)) (- 1)) (= (+ (- c_ULTIMATE.start_main_~j~5) 5) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (= v_b_8_1 (+ (- v_b_10_1) 3)) (= (+ (- v_b_8_1) 1) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_10_1)) (- 1)) (<= (- (- v_b_10_1) (- v_b_11_1)) 1) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_0_1)) (- 3)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_10_1) (- 3)) (= (+ (- v_b_10_1) 5) (+ (- v_b_0_1) 3)) (= (+ v_b_11_1 (- 1)) (+ (- c_ULTIMATE.start_main_~j~5) 5)) (<= (- (- v_b_10_1) v_b_8_1) (- 3)) (= (+ (- v_b_10_1) 5) (+ c_ULTIMATE.start_main_~i~5 2)) (= (+ v_b_0_1 1) (+ (- v_b_10_1) 3)) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~j~5)) 4) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_8_1)) 0) (<= (- c_ULTIMATE.start_main_~i~5 v_b_0_1) 1) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~j~5) (- 4)) (= 3 (+ (- v_b_10_1) 5)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_11_1) (- 4)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- c_ULTIMATE.start_main_~j~5)) 2) (<= (- c_ULTIMATE.start_main_~i~5 v_b_8_1) 0) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_10_1) (- 5)) (<= (- v_v_23_1 v_v_26_1) 0) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_10_1)) 5) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_11_1) (- 6)) (or (< v_idx_31 v_b_11_1) (= (select c_ULTIMATE.start_main_~v~5 v_idx_31) v_v_27_1)) (= (+ (- v_b_10_1) 3) (+ (- c_ULTIMATE.start_main_~j~5) 4)) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_8_1) (- 4)) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- v_b_10_1 (- v_b_10_1)) 4) (= (+ (- v_b_10_1) 3) (+ v_b_10_1 (- 1))) (<= (- v_b_0_1 v_b_10_1) (- 2)) (= (+ c_ULTIMATE.start_main_~j~5 (- 3)) (+ (- c_ULTIMATE.start_main_~j~5) 3)) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 6) (<= (- v_b_0_1 (- v_b_8_1)) 1) (<= (- v_b_11_1 (- v_b_11_1)) 6) (<= (- (- v_v_26_1) (- v_v_4_1)) 0) (= v_b_10_1 (+ (- c_ULTIMATE.start_main_~j~5) 5)) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~i~5) (- 2)) (<= (- c_ULTIMATE.start_main_~j~5 v_b_0_1) 3) (<= (- (- v_b_11_1) v_b_8_1) (- 4)) (<= (- v_b_11_1 (- v_b_8_1)) 4) (= (+ (- c_ULTIMATE.start_main_~j~5) 5) (+ (- v_b_0_1) 2)) (<= (- (- v_b_0_1) (- v_b_10_1)) 2) (<= (- (- v_b_0_1) v_b_8_1) (- 1)) (= (+ (- c_ULTIMATE.start_main_~i~5) 1) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- v_b_0_1) v_b_10_1) (- 2)) (= (+ (- c_ULTIMATE.start_main_~j~5) 5) (+ c_ULTIMATE.start_main_~i~5 1)) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_0_1) (- 3)) (= (+ v_b_11_1 (- 2)) (+ (- v_b_10_1) 3)) (= (+ (- v_b_10_1) 5) (+ v_b_8_1 2)) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~i~5)) 2) (<= (- (- v_b_10_1) v_b_11_1) (- 5)) (<= (- v_b_10_1 v_b_8_1) 1) (<= (- v_b_11_1 v_b_8_1) 2) (= (+ (- v_b_10_1) 5) (+ v_b_10_1 1)) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_11_1)) 4) (<= (- c_ULTIMATE.start_main_~key~5 v_v_26_1) 0) (<= (- c_ULTIMATE.start_main_~j~5 v_b_8_1) 2) (<= (- v_b_10_1 v_b_11_1) (- 1)) (= (+ c_ULTIMATE.start_main_~i~5 (- 1)) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- v_b_10_1) (- v_b_8_1)) (- 1)) (<= (- v_b_0_1 v_b_11_1) (- 3)) (or (= v_v_3_1 (select c_ULTIMATE.start_main_~v~5 v_idx_27)) (<= v_b_0_1 v_idx_27)) (<= (- v_b_10_1 (- v_b_8_1)) 3) (= 0 (+ c_ULTIMATE.start_main_~j~5 (- 3))) (= (+ (- v_b_10_1) 3) (+ (- v_b_0_1) 1)) (= (+ v_b_10_1 (- 2)) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (= (+ (- v_b_11_1) 4) (+ (- v_b_10_1) 3)) (= c_ULTIMATE.start_main_~j~5 (+ (- v_b_10_1) 5)) (= (+ (- v_b_10_1) 5) (+ (- c_ULTIMATE.start_main_~j~5) 6)) (= (+ (- v_b_10_1) 5) (+ (- v_b_8_1) 4)) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_0_1)) 1) (<= (- v_b_0_1 (- v_b_11_1)) 3) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_10_1)) 3) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_11_1)) 0) (= (+ (- v_b_10_1) 2) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (= (+ v_b_0_1 2) (+ (- c_ULTIMATE.start_main_~j~5) 5)) (= (+ (- v_b_8_1) 3) (+ (- c_ULTIMATE.start_main_~j~5) 5)) (<= (- v_b_0_1 (- v_b_10_1)) 2) (= (+ v_b_11_1 (- 3)) (+ c_ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_23_1)) 0)))))} [2019-01-07 14:30:34,702 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:30:35,117 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:30:35,117 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:30:37,395 WARN L181 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 219 [2019-01-07 14:30:37,396 WARN L270 ngHoareTripleChecker]: Pre: {2147483637#(or (forall ((v_idx_18 Int)) (exists ((v_v_2_1 Int)) (and (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 2)) (= v_v_2_1 (select ULTIMATE.start_main_~v~5 v_idx_18)) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 2)))) (forall ((v_idx_21 Int) (v_idx_22 Int) (v_idx_20 Int) (v_idx_19 Int)) (exists ((v_v_8_1 Int) (v_v_3_1 Int) (v_b_2_1 Int) (v_v_4_1 Int) (v_b_3_1 Int) (v_b_0_1 Int) (v_v_7_1 Int)) (and (= (- ULTIMATE.start_main_~i~5) (+ v_b_3_1 (- 2))) (<= (- ULTIMATE.start_main_~j~5 v_b_3_1) 0) (<= (- ULTIMATE.start_main_~i~5 v_b_2_1) (- 1)) (<= (- (- v_b_0_1) v_b_2_1) (- 1)) (= 1 (+ (- ULTIMATE.start_main_~j~5) 3)) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~j~5) (- 2)) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_0_1)) (- 2)) (or (= v_v_8_1 (select ULTIMATE.start_main_~v~5 v_idx_22)) (< v_idx_22 v_b_3_1)) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_3_1)) 0) (<= (- v_v_4_1 v_v_7_1) 0) (or (<= v_b_3_1 v_idx_21) (= (select ULTIMATE.start_main_~v~5 v_idx_21) v_v_7_1) (< v_idx_21 v_b_2_1)) (<= (- (- v_b_0_1) v_b_3_1) (- 2)) (= (+ (- ULTIMATE.start_main_~i~5) 2) 2) (= (+ v_b_2_1 (- 1)) (+ v_b_3_1 (- 2))) (<= (- ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~j~5) (- 2)) (<= (- ULTIMATE.start_main_~key~5 v_v_7_1) 0) (<= (- (- ULTIMATE.start_main_~i~5) (- ULTIMATE.start_main_~j~5)) 2) (<= (- ULTIMATE.start_main_~j~5 (- v_b_2_1)) 3) (<= (- v_b_2_1 (- v_b_3_1)) 3) (<= (- (- v_b_0_1) (- v_b_2_1)) 1) (<= (- ULTIMATE.start_main_~j~5 v_b_2_1) 1) (<= (- v_b_3_1 (- v_b_3_1)) 4) (<= (- ULTIMATE.start_main_~i~5 (- v_b_2_1)) 1) (<= (- (- ULTIMATE.start_main_~j~5) v_b_2_1) (- 3)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_4_1)) 0) (= (+ (- ULTIMATE.start_main_~i~5) 2) (+ (- v_b_2_1) 3)) (= (+ v_b_3_1 (- 2)) (+ (- v_b_3_1) 2)) (= (+ (- ULTIMATE.start_main_~i~5) 2) v_b_3_1) (<= (- ULTIMATE.start_main_~j~5 (- v_b_0_1)) 2) (<= (- (- v_b_3_1) v_b_3_1) (- 4)) (= (+ v_b_2_1 1) (+ (- ULTIMATE.start_main_~i~5) 2)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_3_1)) 4) (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 4)) (<= (- ULTIMATE.start_main_~i~5 (- v_b_3_1)) 2) (= (+ v_b_3_1 (- 2)) (+ ULTIMATE.start_main_~j~5 (- 2))) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~i~5) 0) (<= (- v_b_2_1 v_b_3_1) (- 1)) (= ULTIMATE.start_main_~j~5 (+ (- ULTIMATE.start_main_~i~5) 2)) (= 1 (+ ULTIMATE.start_main_~j~5 (- 1))) (= (+ (- ULTIMATE.start_main_~i~5) 2) (+ (- ULTIMATE.start_main_~j~5) 4)) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- v_b_0_1 v_b_2_1) (- 1)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_3_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_2_1)) 1) (<= (- (- v_b_2_1) v_b_3_1) (- 3)) (or (= (select ULTIMATE.start_main_~v~5 v_idx_20) v_v_4_1) (<= v_b_2_1 v_idx_20) (< v_idx_20 v_b_0_1)) (= (+ v_b_3_1 (- 2)) (+ (- v_b_2_1) 1)) (or (= v_v_3_1 (select ULTIMATE.start_main_~v~5 v_idx_19)) (<= v_b_0_1 v_idx_19)) (<= (- (- v_b_2_1) v_b_2_1) (- 2)) (= 1 (+ v_b_0_1 1)) (<= (- (- ULTIMATE.start_main_~j~5) v_b_3_1) (- 4)) (= ULTIMATE.start_main_~i~5 (+ v_b_3_1 (- 2))) (<= (- (- ULTIMATE.start_main_~j~5) v_b_0_1) (- 2)) (<= (- ULTIMATE.start_main_~i~5 v_b_3_1) (- 2)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_7_1)) 0) (<= (- (- ULTIMATE.start_main_~i~5) v_b_2_1) (- 1)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_0_1) 0) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_2_1)) (- 1)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_0_1)) 0) (<= (- (- v_b_0_1) (- v_b_3_1)) 2) (= 1 (+ ULTIMATE.start_main_~i~5 1)) (= 1 (+ (- v_b_0_1) 1)) (= (+ v_b_0_1 2) (+ (- ULTIMATE.start_main_~i~5) 2)) (<= (- (- v_b_2_1) (- v_b_3_1)) 1) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 4) (<= (- v_b_2_1 (- v_b_2_1)) 2) (= (+ v_b_3_1 (- 2)) (+ (- ULTIMATE.start_main_~j~5) 2)) (= (+ v_b_3_1 (- 2)) v_b_0_1) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~j~5)) 2) (= (+ (- ULTIMATE.start_main_~i~5) 2) (+ ULTIMATE.start_main_~i~5 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_3_1)) 2) (= 1 (+ v_b_3_1 (- 1))) (= 1 v_b_2_1) (= (+ (- v_b_3_1) 3) 1) (<= (- ULTIMATE.start_main_~j~5 v_b_0_1) 2) (= (+ v_b_3_1 (- 2)) 0) (<= (- v_b_0_1 (- v_b_2_1)) 1) (<= (- ULTIMATE.start_main_~i~5 v_b_0_1) 0) (<= (- v_b_0_1 v_b_3_1) (- 2)) (= 1 (+ (- ULTIMATE.start_main_~i~5) 1)) (<= (- ULTIMATE.start_main_~i~5 (- v_b_0_1)) 0) (<= (- v_b_0_1 (- v_b_3_1)) 2) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~i~5)) 0) (= (+ (- ULTIMATE.start_main_~i~5) 2) (+ (- v_b_0_1) 2))))))} [2019-01-07 14:30:37,396 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-07 14:30:37,397 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (or (not (<= 0 c_ULTIMATE.start_main_~i~5_primed)) (not (< c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~i~5_primed)))) (= c_ULTIMATE.start_main_~v~5_primed (store c_ULTIMATE.start_main_~v~5 (+ c_ULTIMATE.start_main_~i~5_primed 1) c_ULTIMATE.start_main_~key~5_primed)) (= (+ c_ULTIMATE.start_main_~j~5 1) c_ULTIMATE.start_main_~j~5_primed) (= c_ULTIMATE.start_main_~i~5_primed (+ c_ULTIMATE.start_main_~j~5 (- 1))) (< (mod c_ULTIMATE.start_main_~j~5 4294967296) (mod c_ULTIMATE.start_main_~SIZE~5 4294967296)) (= c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~j~5))) [2019-01-07 14:30:47,734 WARN L181 SmtUtils]: Spent 10.34 s on a formula simplification that was a NOOP. DAG size: 483 [2019-01-07 14:30:47,735 WARN L276 ngHoareTripleChecker]: Post: {2147483636#(or (forall ((v_idx_25 Int) (v_idx_26 Int) (v_idx_23 Int) (v_idx_24 Int)) (exists ((v_b_6_1 Int) (v_b_7_1 Int) (v_b_4_1 Int) (v_v_20_1 Int) (v_v_21_1 Int) (v_v_17_1 Int) (v_v_16_1 Int)) (and (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~j~5) (- 2)) (<= (- v_v_17_1 v_v_20_1) 0) (= (+ (- v_b_6_1) 3) v_b_7_1) (= (- ULTIMATE.start_main_~i~5) 0) (= 0 (+ v_b_7_1 (- 2))) (<= (- v_b_4_1 (- v_b_7_1)) 2) (<= (- ULTIMATE.start_main_~i~5 (- v_b_6_1)) 1) (= ULTIMATE.start_main_~i~5 0) (<= (- ULTIMATE.start_main_~j~5 (- v_b_7_1)) 4) (= (+ (- v_b_7_1) 3) (+ (- ULTIMATE.start_main_~j~5) 3)) (<= (- ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~j~5) (- 2)) (<= (- (- ULTIMATE.start_main_~j~5) v_b_6_1) (- 3)) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_6_1)) (- 1)) (<= (- (- v_b_4_1) (- v_b_6_1)) 1) (<= (- (- v_b_4_1) v_b_7_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- ULTIMATE.start_main_~j~5)) 2) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_7_1)) 2) (<= (- (- ULTIMATE.start_main_~i~5) v_b_6_1) (- 1)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_6_1)) 3) (= (+ (- v_b_6_1) 3) (+ (- ULTIMATE.start_main_~j~5) 4)) (or (<= v_b_4_1 v_idx_23) (= (select ULTIMATE.start_main_~v~5 v_idx_23) v_v_16_1)) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_7_1)) 0) (= (+ (- v_b_7_1) 3) (+ ULTIMATE.start_main_~j~5 (- 1))) (<= (- ULTIMATE.start_main_~j~5 (- v_b_4_1)) 2) (<= (- (- v_b_6_1) v_b_6_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_6_1)) 1) (= (+ (- v_b_7_1) 3) (+ v_b_4_1 1)) (<= (- v_b_4_1 (- v_b_4_1)) 0) (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 4)) (<= (- ULTIMATE.start_main_~i~5 v_b_7_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_4_1) 0) (= (+ (- v_b_6_1) 3) (+ v_b_6_1 1)) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~i~5) 0) (= (+ (- v_b_6_1) 3) (+ (- v_b_4_1) 2)) (<= (- (- ULTIMATE.start_main_~j~5) v_b_7_1) (- 4)) (= (+ (- v_b_7_1) 3) (+ (- v_b_4_1) 1)) (<= (- ULTIMATE.start_main_~i~5 v_b_6_1) (- 1)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_17_1)) 0) (= (+ (- v_b_6_1) 3) (+ v_b_4_1 2)) (or (< v_idx_24 v_b_4_1) (= (select ULTIMATE.start_main_~v~5 v_idx_24) v_v_17_1) (<= v_b_6_1 v_idx_24)) (= 0 (+ ULTIMATE.start_main_~j~5 (- 2))) (<= (- (- v_b_6_1) v_b_7_1) (- 3)) (<= (- v_b_4_1 v_b_7_1) (- 2)) (or (< v_idx_26 v_b_7_1) (= (select ULTIMATE.start_main_~v~5 v_idx_26) v_v_21_1)) (<= (- v_b_4_1 (- v_b_6_1)) 1) (= (+ (- v_b_7_1) 2) 0) (<= (- (- v_b_4_1) v_b_4_1) 0) (<= (- (- v_b_4_1) v_b_6_1) (- 1)) (= (+ (- v_b_7_1) 3) 1) (<= (- ULTIMATE.start_main_~i~5 (- v_b_7_1)) 2) (= (+ (- v_b_6_1) 3) (+ ULTIMATE.start_main_~i~5 2)) (<= (- (- ULTIMATE.start_main_~j~5) v_b_4_1) (- 2)) (<= (- (- v_b_6_1) (- v_b_7_1)) 1) (<= (- (- v_b_4_1) (- v_b_7_1)) 2) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_4_1)) 0) (<= (- (- ULTIMATE.start_main_~i~5) v_b_7_1) (- 2)) (<= (- v_b_6_1 (- v_b_7_1)) 3) (<= (- ULTIMATE.start_main_~key~5 v_v_20_1) 0) (<= (- ULTIMATE.start_main_~j~5 v_b_6_1) 1) (<= (- ULTIMATE.start_main_~j~5 v_b_7_1) 0) (= 0 (+ v_b_6_1 (- 1))) (= 0 v_b_4_1) (= (+ (- v_b_7_1) 3) (+ (- ULTIMATE.start_main_~i~5) 1)) (<= (- v_b_4_1 v_b_6_1) (- 1)) (<= (- ULTIMATE.start_main_~i~5 (- v_b_4_1)) 0) (<= (- v_b_7_1 (- v_b_7_1)) 4) (= (+ (- v_b_7_1) 3) (+ v_b_7_1 (- 1))) (= (+ (- ULTIMATE.start_main_~i~5) 2) (+ (- v_b_6_1) 3)) (<= (- v_b_6_1 v_b_7_1) (- 1)) (<= (- ULTIMATE.start_main_~i~5 v_b_4_1) 0) (<= (- v_b_6_1 (- v_b_6_1)) 2) (= ULTIMATE.start_main_~j~5 (+ (- v_b_6_1) 3)) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 4) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_4_1)) (- 2)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_20_1)) 0) (or (<= v_b_7_1 v_idx_25) (= (select ULTIMATE.start_main_~v~5 v_idx_25) v_v_20_1) (< v_idx_25 v_b_6_1)) (= (+ (- v_b_6_1) 3) 2) (<= (- (- v_b_7_1) v_b_7_1) (- 4)) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~j~5)) 2) (= 0 (+ (- ULTIMATE.start_main_~j~5) 2)) (<= (- ULTIMATE.start_main_~j~5 v_b_4_1) 2) (= (+ (- v_b_7_1) 3) (+ ULTIMATE.start_main_~i~5 1)) (= 0 (+ (- v_b_6_1) 1)) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~i~5)) 0) (= (+ (- v_b_7_1) 3) v_b_6_1)))) (forall ((v_idx_30 Int) (v_idx_31 Int) (v_idx_29 Int) (v_idx_27 Int) (v_idx_28 Int)) (exists ((v_b_11_1 Int) (v_v_23_1 Int) (v_b_8_1 Int) (v_v_3_1 Int) (v_v_4_1 Int) (v_b_10_1 Int) (v_b_0_1 Int) (v_v_26_1 Int) (v_v_27_1 Int)) (and (<= (- v_b_8_1 (- v_b_8_1)) 2) (or (<= v_b_10_1 v_idx_29) (< v_idx_29 v_b_8_1) (= (select ULTIMATE.start_main_~v~5 v_idx_29) v_v_23_1)) (<= (- (- v_b_0_1) (- v_b_8_1)) 1) (= (+ (- ULTIMATE.start_main_~i~5) 2) (+ (- v_b_10_1) 3)) (or (<= v_b_11_1 v_idx_30) (< v_idx_30 v_b_10_1) (= (select ULTIMATE.start_main_~v~5 v_idx_30) v_v_26_1)) (= (+ (- v_b_10_1) 5) (+ v_b_0_1 3)) (<= (- v_b_10_1 (- v_b_11_1)) 5) (<= (- ULTIMATE.start_main_~j~5 v_b_11_1) 0) (<= (- (- v_b_10_1) v_b_10_1) (- 4)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_8_1)) 4) (<= (- ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~j~5) (- 2)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_0_1)) 3) (<= (- (- v_b_0_1) v_b_11_1) (- 3)) (= (+ v_b_8_1 1) (+ (- ULTIMATE.start_main_~j~5) 5)) (= 1 (+ (- v_b_10_1) 3)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_4_1)) 0) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_26_1)) 0) (= 2 (+ (- ULTIMATE.start_main_~j~5) 5)) (<= (- ULTIMATE.start_main_~i~5 v_b_10_1) (- 1)) (= (+ (- v_b_11_1) 3) (+ ULTIMATE.start_main_~j~5 (- 3))) (<= (- ULTIMATE.start_main_~i~5 (- v_b_8_1)) 2) (= ULTIMATE.start_main_~i~5 (+ (- v_b_10_1) 3)) (<= (- (- v_v_23_1) (- v_v_4_1)) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (= (+ (- v_b_10_1) 5) v_b_11_1) (= (+ (- v_b_10_1) 3) (+ ULTIMATE.start_main_~j~5 (- 2))) (= (+ (- ULTIMATE.start_main_~j~5) 5) (+ (- ULTIMATE.start_main_~i~5) 3)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_8_1) (- 2)) (<= (- (- v_b_11_1) (- v_b_8_1)) (- 2)) (= (+ (- ULTIMATE.start_main_~j~5) 5) (+ (- v_b_11_1) 5)) (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 6)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_11_1)) 6) (<= (- (- v_b_0_1) (- v_b_11_1)) 3) (<= (- (- v_b_8_1) v_b_8_1) (- 2)) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_8_1)) (- 2)) (= (+ (- ULTIMATE.start_main_~i~5) 4) (+ (- v_b_10_1) 5)) (or (< v_idx_28 v_b_0_1) (<= v_b_8_1 v_idx_28) (= v_v_4_1 (select ULTIMATE.start_main_~v~5 v_idx_28))) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_11_1)) 2) (= v_b_0_1 (+ ULTIMATE.start_main_~j~5 (- 3))) (<= (- v_b_0_1 v_b_8_1) (- 1)) (<= (- ULTIMATE.start_main_~j~5 v_b_10_1) 1) (= (+ v_b_8_1 (- 1)) (+ ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- v_b_11_1) v_b_11_1) (- 6)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_0_1) (- 1)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_10_1)) 1) (<= (- ULTIMATE.start_main_~i~5 v_b_11_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_0_1)) (- 1)) (= (+ (- ULTIMATE.start_main_~j~5) 5) (+ ULTIMATE.start_main_~j~5 (- 1))) (= v_b_8_1 (+ (- v_b_10_1) 3)) (= (+ (- v_b_8_1) 1) (+ ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_10_1)) (- 1)) (<= (- (- v_b_10_1) (- v_b_11_1)) 1) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_0_1)) (- 3)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_10_1) (- 3)) (= (+ (- v_b_10_1) 5) (+ (- v_b_0_1) 3)) (= (+ v_b_11_1 (- 1)) (+ (- ULTIMATE.start_main_~j~5) 5)) (<= (- (- v_b_10_1) v_b_8_1) (- 3)) (= (+ (- v_b_10_1) 5) (+ ULTIMATE.start_main_~i~5 2)) (= (+ v_b_0_1 1) (+ (- v_b_10_1) 3)) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~j~5)) 4) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_8_1)) 0) (<= (- ULTIMATE.start_main_~i~5 v_b_0_1) 1) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~j~5) (- 4)) (= 3 (+ (- v_b_10_1) 5)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_11_1) (- 4)) (<= (- (- ULTIMATE.start_main_~i~5) (- ULTIMATE.start_main_~j~5)) 2) (<= (- ULTIMATE.start_main_~i~5 v_b_8_1) 0) (<= (- (- ULTIMATE.start_main_~j~5) v_b_10_1) (- 5)) (<= (- v_v_23_1 v_v_26_1) 0) (<= (- ULTIMATE.start_main_~j~5 (- v_b_10_1)) 5) (<= (- (- ULTIMATE.start_main_~j~5) v_b_11_1) (- 6)) (or (< v_idx_31 v_b_11_1) (= (select ULTIMATE.start_main_~v~5 v_idx_31) v_v_27_1)) (= (+ (- v_b_10_1) 3) (+ (- ULTIMATE.start_main_~j~5) 4)) (<= (- (- ULTIMATE.start_main_~j~5) v_b_8_1) (- 4)) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- v_b_10_1 (- v_b_10_1)) 4) (= (+ (- v_b_10_1) 3) (+ v_b_10_1 (- 1))) (<= (- v_b_0_1 v_b_10_1) (- 2)) (= (+ ULTIMATE.start_main_~j~5 (- 3)) (+ (- ULTIMATE.start_main_~j~5) 3)) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 6) (<= (- v_b_0_1 (- v_b_8_1)) 1) (<= (- v_b_11_1 (- v_b_11_1)) 6) (<= (- (- v_v_26_1) (- v_v_4_1)) 0) (= v_b_10_1 (+ (- ULTIMATE.start_main_~j~5) 5)) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~i~5) (- 2)) (<= (- ULTIMATE.start_main_~j~5 v_b_0_1) 3) (<= (- (- v_b_11_1) v_b_8_1) (- 4)) (<= (- v_b_11_1 (- v_b_8_1)) 4) (= (+ (- ULTIMATE.start_main_~j~5) 5) (+ (- v_b_0_1) 2)) (<= (- (- v_b_0_1) (- v_b_10_1)) 2) (<= (- (- v_b_0_1) v_b_8_1) (- 1)) (= (+ (- ULTIMATE.start_main_~i~5) 1) (+ ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- v_b_0_1) v_b_10_1) (- 2)) (= (+ (- ULTIMATE.start_main_~j~5) 5) (+ ULTIMATE.start_main_~i~5 1)) (<= (- (- ULTIMATE.start_main_~j~5) v_b_0_1) (- 3)) (= (+ v_b_11_1 (- 2)) (+ (- v_b_10_1) 3)) (= (+ (- v_b_10_1) 5) (+ v_b_8_1 2)) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~i~5)) 2) (<= (- (- v_b_10_1) v_b_11_1) (- 5)) (<= (- v_b_10_1 v_b_8_1) 1) (<= (- v_b_11_1 v_b_8_1) 2) (= (+ (- v_b_10_1) 5) (+ v_b_10_1 1)) (<= (- ULTIMATE.start_main_~i~5 (- v_b_11_1)) 4) (<= (- ULTIMATE.start_main_~key~5 v_v_26_1) 0) (<= (- ULTIMATE.start_main_~j~5 v_b_8_1) 2) (<= (- v_b_10_1 v_b_11_1) (- 1)) (= (+ ULTIMATE.start_main_~i~5 (- 1)) (+ ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- v_b_10_1) (- v_b_8_1)) (- 1)) (<= (- v_b_0_1 v_b_11_1) (- 3)) (or (= v_v_3_1 (select ULTIMATE.start_main_~v~5 v_idx_27)) (<= v_b_0_1 v_idx_27)) (<= (- v_b_10_1 (- v_b_8_1)) 3) (= 0 (+ ULTIMATE.start_main_~j~5 (- 3))) (= (+ (- v_b_10_1) 3) (+ (- v_b_0_1) 1)) (= (+ v_b_10_1 (- 2)) (+ ULTIMATE.start_main_~j~5 (- 3))) (= (+ (- v_b_11_1) 4) (+ (- v_b_10_1) 3)) (= ULTIMATE.start_main_~j~5 (+ (- v_b_10_1) 5)) (= (+ (- v_b_10_1) 5) (+ (- ULTIMATE.start_main_~j~5) 6)) (= (+ (- v_b_10_1) 5) (+ (- v_b_8_1) 4)) (<= (- ULTIMATE.start_main_~i~5 (- v_b_0_1)) 1) (<= (- v_b_0_1 (- v_b_11_1)) 3) (<= (- ULTIMATE.start_main_~i~5 (- v_b_10_1)) 3) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_11_1)) 0) (= (+ (- v_b_10_1) 2) (+ ULTIMATE.start_main_~j~5 (- 3))) (= (+ v_b_0_1 2) (+ (- ULTIMATE.start_main_~j~5) 5)) (= (+ (- v_b_8_1) 3) (+ (- ULTIMATE.start_main_~j~5) 5)) (<= (- v_b_0_1 (- v_b_10_1)) 2) (= (+ v_b_11_1 (- 3)) (+ ULTIMATE.start_main_~j~5 (- 3))) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_23_1)) 0)))))} [2019-01-07 14:30:58,024 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:30:58,025 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:30:58,025 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:30:58,026 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:30:58,026 WARN L224 ngHoareTripleChecker]: Pre: {2147483633#(or (forall ((v_idx_40 Int)) (exists ((v_v_2_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 2) (= v_v_2_1 (select c_ULTIMATE.start_main_~v~5 v_idx_40))))) (forall ((v_idx_43 Int) (v_idx_41 Int) (v_idx_42 Int)) (exists ((v_b_12_1 Int) (v_v_172_1 Int) (v_v_174_1 Int) (v_b_14_1 Int) (v_v_179_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_14_1)) 0) (<= (- (- v_b_12_1) (- v_b_14_1)) 2) (or (<= v_b_14_1 v_idx_42) (= v_v_174_1 (select c_ULTIMATE.start_main_~v~5 v_idx_42)) (< v_idx_42 v_b_12_1)) (or (< v_idx_43 v_b_14_1) (= v_v_179_1 (select c_ULTIMATE.start_main_~v~5 v_idx_43))) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- v_b_12_1 (- v_b_12_1)) 0) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_14_1)) 2) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_14_1) (- 4)) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~i~5)) 2) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_12_1)) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_12_1) 0) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_12_1) (- 2)) (<= (- v_b_14_1 (- v_b_14_1)) 4) (<= (- c_ULTIMATE.start_main_~i~5 c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_14_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_14_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- c_ULTIMATE.start_main_~j~5)) 2) (= (+ v_b_14_1 (- 2)) v_b_12_1) (= (+ v_b_12_1 2) v_b_14_1) (<= (- v_b_12_1 (- v_b_14_1)) 2) (<= (- (- v_b_12_1) v_b_14_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 4)) (<= (- c_ULTIMATE.start_main_~j~5 v_b_14_1) 1) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~i~5) 0) (= 2 (+ v_b_12_1 2)) (<= (- v_b_12_1 v_b_14_1) (- 2)) (or (<= v_b_12_1 v_idx_41) (= v_v_172_1 (select c_ULTIMATE.start_main_~v~5 v_idx_41))) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_12_1)) 0) (<= (- (- v_b_14_1) v_b_14_1) (- 4)) (= (+ (- v_b_12_1) 2) (+ v_b_12_1 2)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_12_1) 1) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_14_1)) 3) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_174_1)) 0) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_12_1)) 1) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_12_1)) 3) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_14_1)) 5) (= (+ v_b_14_1 (- 2)) 0) (= (+ v_b_14_1 (- 2)) (+ (- v_b_14_1) 2)) (<= (- (- v_b_12_1) v_b_12_1) 0) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 6) (<= (- c_ULTIMATE.start_main_~j~5 v_b_12_1) 3) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~j~5)) 4)))))} [2019-01-07 14:30:58,026 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-07 14:30:58,026 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (or (not (<= 0 c_ULTIMATE.start_main_~i~5_primed)) (not (< c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~i~5_primed)))) (= c_ULTIMATE.start_main_~v~5_primed (store c_ULTIMATE.start_main_~v~5 (+ c_ULTIMATE.start_main_~i~5_primed 1) c_ULTIMATE.start_main_~key~5_primed)) (= (+ c_ULTIMATE.start_main_~j~5 1) c_ULTIMATE.start_main_~j~5_primed) (= c_ULTIMATE.start_main_~i~5_primed (+ c_ULTIMATE.start_main_~j~5 (- 1))) (< (mod c_ULTIMATE.start_main_~j~5 4294967296) (mod c_ULTIMATE.start_main_~SIZE~5 4294967296)) (= c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~j~5))) [2019-01-07 14:30:58,027 WARN L230 ngHoareTripleChecker]: Post: {2147483632#(or (forall ((v_idx_48 Int) (v_idx_50 Int) (v_idx_51 Int) (v_idx_49 Int)) (exists ((v_v_232_1 Int) (v_b_22_1 Int) (v_v_231_1 Int) (v_b_25_1 Int) (v_b_24_1 Int) (v_v_236_1 Int) (v_v_235_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_22_1) (- 4)) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_25_1) (- 6)) (<= (- v_b_22_1 (- v_b_22_1)) 4) (<= (- c_ULTIMATE.start_main_~key~5 v_v_235_1) 0) (<= (- (- v_b_22_1) v_b_25_1) (- 4)) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~j~5) (- 4)) (<= (- (- v_b_22_1) v_b_22_1) (- 2)) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~j~5)) 6) (or (<= v_b_22_1 v_idx_48) (= v_v_231_1 (select c_ULTIMATE.start_main_~v~5 v_idx_48))) (<= (- c_ULTIMATE.start_main_~i~5 c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- c_ULTIMATE.start_main_~j~5 v_b_22_1) 2) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_22_1)) (- 2)) (= (+ v_b_24_1 (- 1)) v_b_22_1) (<= (- (- c_ULTIMATE.start_main_~i~5) (- c_ULTIMATE.start_main_~j~5)) 2) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_22_1) (- 2)) (or (<= v_b_25_1 v_idx_50) (< v_idx_50 v_b_24_1) (= (select c_ULTIMATE.start_main_~v~5 v_idx_50) v_v_235_1)) (<= (- c_ULTIMATE.start_main_~j~5 v_b_25_1) 0) (<= (- v_b_24_1 (- v_b_25_1)) 7) (<= (- c_ULTIMATE.start_main_~i~5 v_b_22_1) 0) (<= (- v_b_24_1 v_b_25_1) (- 1)) (<= (- (- v_b_22_1) (- v_b_25_1)) 2) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_24_1) (- 3)) (<= (- (- v_b_25_1) v_b_25_1) (- 6)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_24_1) (- 1)) (<= (- (- v_b_24_1) (- v_b_25_1)) 1) (= c_ULTIMATE.start_main_~j~5 (+ c_ULTIMATE.start_main_~i~5 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_24_1)) 7) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_22_1)) 6) (<= (- v_v_232_1 v_v_235_1) 0) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~i~5) (- 2)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_235_1)) 0) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_24_1)) 5) (<= (- v_b_24_1 (- v_b_24_1)) 6) (= (+ v_b_22_1 2) (+ c_ULTIMATE.start_main_~i~5 2)) (<= (- v_b_25_1 (- v_b_25_1)) 8) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 6)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_25_1)) 2) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_24_1) (- 5)) (<= (- v_b_22_1 v_b_24_1) (- 1)) (= v_b_24_1 (+ v_b_22_1 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_22_1)) 0) (<= (- c_ULTIMATE.start_main_~j~5 v_b_24_1) 1) (<= (- (- v_b_22_1) (- v_b_24_1)) 1) (or (= v_v_236_1 (select c_ULTIMATE.start_main_~v~5 v_idx_51)) (< v_idx_51 v_b_25_1)) (<= (- (- v_b_24_1) v_b_25_1) (- 5)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_232_1)) 0) (<= (- (- v_b_22_1) v_b_24_1) (- 3)) (<= (- c_ULTIMATE.start_main_~i~5 v_b_25_1) (- 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_25_1)) 8) (<= (- (- v_b_24_1) v_b_24_1) (- 4)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_24_1)) (- 1)) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~i~5)) 4) (= (+ v_b_22_1 1) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (= (+ v_b_24_1 (- 1)) (+ v_b_25_1 (- 2))) (<= (- v_b_22_1 (- v_b_24_1)) 5) (= (+ c_ULTIMATE.start_main_~i~5 1) (+ v_b_22_1 1)) (= v_b_25_1 (+ c_ULTIMATE.start_main_~i~5 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 8) (<= (- v_b_22_1 v_b_25_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_24_1)) 1) (= (+ v_b_24_1 (- 1)) (+ c_ULTIMATE.start_main_~j~5 (- 2))) (= c_ULTIMATE.start_main_~i~5 (+ v_b_24_1 (- 1))) (= (+ v_b_25_1 (- 1)) (+ v_b_22_1 1)) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_25_1)) 6) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_25_1)) 0) (<= (- v_b_22_1 (- v_b_25_1)) 6) (= (+ v_b_24_1 1) (+ c_ULTIMATE.start_main_~i~5 2)) (or (= (select c_ULTIMATE.start_main_~v~5 v_idx_49) v_v_232_1) (< v_idx_49 v_b_22_1) (<= v_b_24_1 v_idx_49)) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_22_1)) 4) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_25_1) (- 4))))) (forall ((v_idx_47 Int) (v_idx_45 Int) (v_idx_46 Int) (v_idx_44 Int)) (exists ((v_v_225_1 Int) (v_b_18_1 Int) (v_v_226_1 Int) (v_v_229_1 Int) (v_b_21_1 Int) (v_v_230_1 Int) (v_b_20_1 Int)) (and (= c_ULTIMATE.start_main_~j~5 (+ v_b_18_1 2)) (= (+ v_b_21_1 (- 2)) (+ c_ULTIMATE.start_main_~j~5 (- 2))) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~j~5) (- 2)) (= c_ULTIMATE.start_main_~i~5 (+ v_b_21_1 (- 2))) (= (+ v_b_18_1 2) v_b_21_1) (= (+ (- c_ULTIMATE.start_main_~i~5) 1) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (or (<= v_b_21_1 v_idx_46) (< v_idx_46 v_b_20_1) (= v_v_229_1 (select c_ULTIMATE.start_main_~v~5 v_idx_46))) (<= (- c_ULTIMATE.start_main_~i~5 c_ULTIMATE.start_main_~j~5) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- c_ULTIMATE.start_main_~j~5)) 2) (<= (- (- v_b_18_1) v_b_20_1) (- 1)) (<= (- v_b_20_1 v_b_21_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_226_1)) 0) (<= (- c_ULTIMATE.start_main_~j~5 v_b_21_1) 0) (<= (- v_b_18_1 v_b_20_1) (- 1)) (= (+ (- v_b_21_1) 3) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) (- 4)) (= (+ v_b_21_1 (- 2)) (+ (- c_ULTIMATE.start_main_~j~5) 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) c_ULTIMATE.start_main_~i~5) 0) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_18_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_20_1)) 1) (= (+ v_b_21_1 (- 2)) (+ (- v_b_20_1) 1)) (= 1 (+ c_ULTIMATE.start_main_~j~5 (- 1))) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_18_1)) 0) (or (<= v_b_18_1 v_idx_44) (= v_v_225_1 (select c_ULTIMATE.start_main_~v~5 v_idx_44))) (<= (- v_v_226_1 v_v_229_1) 0) (<= (- (- v_b_21_1) v_b_21_1) (- 4)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_18_1)) (- 2)) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_21_1) (- 2)) (<= (- v_b_20_1 (- v_b_20_1)) 2) (or (< v_idx_45 v_b_18_1) (= v_v_226_1 (select c_ULTIMATE.start_main_~v~5 v_idx_45)) (<= v_b_20_1 v_idx_45)) (= (+ v_b_18_1 2) (+ v_b_20_1 1)) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_18_1)) 0) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_21_1)) 0) (<= (- (- v_b_18_1) v_b_18_1) 0) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_20_1)) 1) (= (+ v_b_21_1 (- 2)) v_b_18_1) (= (+ v_b_21_1 (- 2)) (+ (- v_b_21_1) 2)) (<= (- (- v_b_20_1) v_b_21_1) (- 3)) (= (- c_ULTIMATE.start_main_~i~5) (+ v_b_21_1 (- 2))) (= (+ v_b_18_1 2) (+ c_ULTIMATE.start_main_~i~5 2)) (= (+ v_b_18_1 2) (+ (- v_b_18_1) 2)) (<= (- (- v_b_20_1) v_b_20_1) (- 2)) (= (+ (- v_b_18_1) 1) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (= v_b_20_1 (+ c_ULTIMATE.start_main_~j~5 (- 1))) (<= (- c_ULTIMATE.start_main_~j~5 v_b_18_1) 2) (<= (- v_b_20_1 (- v_b_21_1)) 3) (<= (- (- c_ULTIMATE.start_main_~j~5) (- v_b_20_1)) (- 1)) (= (+ v_b_18_1 1) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (<= (- c_ULTIMATE.start_main_~i~5 v_b_20_1) (- 1)) (= (+ (- c_ULTIMATE.start_main_~j~5) 3) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (or (< v_idx_47 v_b_21_1) (= v_v_230_1 (select c_ULTIMATE.start_main_~v~5 v_idx_47))) (<= (- (- v_b_18_1) (- v_b_21_1)) 2) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_20_1) (- 3)) (<= (- c_ULTIMATE.start_main_~j~5 v_b_20_1) 1) (<= (- v_b_18_1 (- v_b_20_1)) 1) (= (+ v_b_21_1 (- 2)) (+ v_b_20_1 (- 1))) (<= (- c_ULTIMATE.start_main_~i~5 v_b_21_1) (- 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 4) (<= (- c_ULTIMATE.start_main_~i~5 (- v_b_21_1)) 2) (<= (- (- v_b_20_1) (- v_b_21_1)) 1) (<= (- (- c_ULTIMATE.start_main_~i~5) (- v_b_21_1)) 2) (<= (- v_b_21_1 (- v_b_21_1)) 4) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_20_1) (- 1)) (= (+ (- c_ULTIMATE.start_main_~i~5) 2) (+ v_b_18_1 2)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_18_1)) 2) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_21_1)) 4) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~j~5)) 2) (= (+ v_b_21_1 (- 1)) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (<= (- (- c_ULTIMATE.start_main_~i~5) v_b_18_1) 0) (<= (- v_b_18_1 v_b_21_1) (- 2)) (= (+ v_b_18_1 2) (+ (- v_b_20_1) 3)) (<= (- c_ULTIMATE.start_main_~j~5 (- v_b_20_1)) 3) (<= (- (- v_b_18_1) (- v_b_20_1)) 1) (<= (- (- c_ULTIMATE.start_main_~key~5) (- v_v_229_1)) 0) (= (+ v_b_18_1 2) 2) (<= (- c_ULTIMATE.start_main_~i~5 v_b_18_1) 0) (<= (- c_ULTIMATE.start_main_~key~5 v_v_229_1) 0) (= (+ v_b_18_1 2) (+ (- c_ULTIMATE.start_main_~j~5) 4)) (<= (- v_b_18_1 (- v_b_21_1)) 2) (<= (- (- c_ULTIMATE.start_main_~j~5) v_b_21_1) (- 4)) (= (+ v_b_21_1 (- 2)) 0) (<= (- (- v_b_18_1) v_b_21_1) (- 2)) (<= (- v_b_18_1 (- v_b_18_1)) 0) (= (+ c_ULTIMATE.start_main_~i~5 1) (+ c_ULTIMATE.start_main_~j~5 (- 1))) (<= (- c_ULTIMATE.start_main_~i~5 (- c_ULTIMATE.start_main_~i~5)) 0)))))} [2019-01-07 14:30:58,027 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:30:58,066 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:30:58,067 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:31:00,238 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 130 [2019-01-07 14:31:00,239 WARN L270 ngHoareTripleChecker]: Pre: {2147483633#(or (forall ((v_idx_40 Int)) (exists ((v_v_2_1 Int)) (and (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 2)) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 2) (= v_v_2_1 (select ULTIMATE.start_main_~v~5 v_idx_40))))) (forall ((v_idx_43 Int) (v_idx_41 Int) (v_idx_42 Int)) (exists ((v_b_12_1 Int) (v_v_172_1 Int) (v_v_174_1 Int) (v_b_14_1 Int) (v_v_179_1 Int)) (and (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_14_1)) 0) (<= (- (- v_b_12_1) (- v_b_14_1)) 2) (or (<= v_b_14_1 v_idx_42) (= v_v_174_1 (select ULTIMATE.start_main_~v~5 v_idx_42)) (< v_idx_42 v_b_12_1)) (or (< v_idx_43 v_b_14_1) (= v_v_179_1 (select ULTIMATE.start_main_~v~5 v_idx_43))) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~j~5) (- 2)) (<= (- v_b_12_1 (- v_b_12_1)) 0) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_14_1)) 2) (<= (- (- ULTIMATE.start_main_~j~5) v_b_14_1) (- 4)) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~i~5)) 2) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_12_1)) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_12_1) 0) (<= (- (- ULTIMATE.start_main_~j~5) v_b_12_1) (- 2)) (<= (- v_b_14_1 (- v_b_14_1)) 4) (<= (- ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~j~5) (- 2)) (<= (- ULTIMATE.start_main_~i~5 v_b_14_1) (- 1)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_14_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- ULTIMATE.start_main_~j~5)) 2) (= (+ v_b_14_1 (- 2)) v_b_12_1) (= (+ v_b_12_1 2) v_b_14_1) (<= (- v_b_12_1 (- v_b_14_1)) 2) (<= (- (- v_b_12_1) v_b_14_1) (- 2)) (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 4)) (<= (- ULTIMATE.start_main_~j~5 v_b_14_1) 1) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~i~5) 0) (= 2 (+ v_b_12_1 2)) (<= (- v_b_12_1 v_b_14_1) (- 2)) (or (<= v_b_12_1 v_idx_41) (= v_v_172_1 (select ULTIMATE.start_main_~v~5 v_idx_41))) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_12_1)) 0) (<= (- (- v_b_14_1) v_b_14_1) (- 4)) (= (+ (- v_b_12_1) 2) (+ v_b_12_1 2)) (<= (- ULTIMATE.start_main_~i~5 v_b_12_1) 1) (<= (- ULTIMATE.start_main_~i~5 (- v_b_14_1)) 3) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_174_1)) 0) (<= (- ULTIMATE.start_main_~i~5 (- v_b_12_1)) 1) (<= (- ULTIMATE.start_main_~j~5 (- v_b_12_1)) 3) (<= (- ULTIMATE.start_main_~j~5 (- v_b_14_1)) 5) (= (+ v_b_14_1 (- 2)) 0) (= (+ v_b_14_1 (- 2)) (+ (- v_b_14_1) 2)) (<= (- (- v_b_12_1) v_b_12_1) 0) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 6) (<= (- ULTIMATE.start_main_~j~5 v_b_12_1) 3) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~j~5)) 4)))))} [2019-01-07 14:31:00,239 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-07 14:31:00,242 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (or (not (<= 0 c_ULTIMATE.start_main_~i~5_primed)) (not (< c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~i~5_primed)))) (= c_ULTIMATE.start_main_~v~5_primed (store c_ULTIMATE.start_main_~v~5 (+ c_ULTIMATE.start_main_~i~5_primed 1) c_ULTIMATE.start_main_~key~5_primed)) (= (+ c_ULTIMATE.start_main_~j~5 1) c_ULTIMATE.start_main_~j~5_primed) (= c_ULTIMATE.start_main_~i~5_primed (+ c_ULTIMATE.start_main_~j~5 (- 1))) (< (mod c_ULTIMATE.start_main_~j~5 4294967296) (mod c_ULTIMATE.start_main_~SIZE~5 4294967296)) (= c_ULTIMATE.start_main_~key~5_primed (select c_ULTIMATE.start_main_~v~5 c_ULTIMATE.start_main_~j~5))) [2019-01-07 14:31:06,694 WARN L181 SmtUtils]: Spent 6.45 s on a formula simplification that was a NOOP. DAG size: 369 [2019-01-07 14:31:06,694 WARN L276 ngHoareTripleChecker]: Post: {2147483632#(or (forall ((v_idx_48 Int) (v_idx_50 Int) (v_idx_51 Int) (v_idx_49 Int)) (exists ((v_v_232_1 Int) (v_b_22_1 Int) (v_v_231_1 Int) (v_b_25_1 Int) (v_b_24_1 Int) (v_v_236_1 Int) (v_v_235_1 Int)) (and (<= (- (- ULTIMATE.start_main_~j~5) v_b_22_1) (- 4)) (<= (- (- ULTIMATE.start_main_~j~5) v_b_25_1) (- 6)) (<= (- v_b_22_1 (- v_b_22_1)) 4) (<= (- ULTIMATE.start_main_~key~5 v_v_235_1) 0) (<= (- (- v_b_22_1) v_b_25_1) (- 4)) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~j~5) (- 4)) (<= (- (- v_b_22_1) v_b_22_1) (- 2)) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~j~5)) 6) (or (<= v_b_22_1 v_idx_48) (= v_v_231_1 (select ULTIMATE.start_main_~v~5 v_idx_48))) (<= (- ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~j~5) (- 2)) (<= (- ULTIMATE.start_main_~j~5 v_b_22_1) 2) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_22_1)) (- 2)) (= (+ v_b_24_1 (- 1)) v_b_22_1) (<= (- (- ULTIMATE.start_main_~i~5) (- ULTIMATE.start_main_~j~5)) 2) (<= (- (- ULTIMATE.start_main_~i~5) v_b_22_1) (- 2)) (or (<= v_b_25_1 v_idx_50) (< v_idx_50 v_b_24_1) (= (select ULTIMATE.start_main_~v~5 v_idx_50) v_v_235_1)) (<= (- ULTIMATE.start_main_~j~5 v_b_25_1) 0) (<= (- v_b_24_1 (- v_b_25_1)) 7) (<= (- ULTIMATE.start_main_~i~5 v_b_22_1) 0) (<= (- v_b_24_1 v_b_25_1) (- 1)) (<= (- (- v_b_22_1) (- v_b_25_1)) 2) (<= (- (- ULTIMATE.start_main_~i~5) v_b_24_1) (- 3)) (<= (- (- v_b_25_1) v_b_25_1) (- 6)) (<= (- ULTIMATE.start_main_~i~5 v_b_24_1) (- 1)) (<= (- (- v_b_24_1) (- v_b_25_1)) 1) (= ULTIMATE.start_main_~j~5 (+ ULTIMATE.start_main_~i~5 2)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_24_1)) 7) (<= (- ULTIMATE.start_main_~j~5 (- v_b_22_1)) 6) (<= (- v_v_232_1 v_v_235_1) 0) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~i~5) (- 2)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_235_1)) 0) (<= (- ULTIMATE.start_main_~i~5 (- v_b_24_1)) 5) (<= (- v_b_24_1 (- v_b_24_1)) 6) (= (+ v_b_22_1 2) (+ ULTIMATE.start_main_~i~5 2)) (<= (- v_b_25_1 (- v_b_25_1)) 8) (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 6)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_25_1)) 2) (<= (- (- ULTIMATE.start_main_~j~5) v_b_24_1) (- 5)) (<= (- v_b_22_1 v_b_24_1) (- 1)) (= v_b_24_1 (+ v_b_22_1 1)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_22_1)) 0) (<= (- ULTIMATE.start_main_~j~5 v_b_24_1) 1) (<= (- (- v_b_22_1) (- v_b_24_1)) 1) (or (= v_v_236_1 (select ULTIMATE.start_main_~v~5 v_idx_51)) (< v_idx_51 v_b_25_1)) (<= (- (- v_b_24_1) v_b_25_1) (- 5)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_232_1)) 0) (<= (- (- v_b_22_1) v_b_24_1) (- 3)) (<= (- ULTIMATE.start_main_~i~5 v_b_25_1) (- 2)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_25_1)) 8) (<= (- (- v_b_24_1) v_b_24_1) (- 4)) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_24_1)) (- 1)) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~i~5)) 4) (= (+ v_b_22_1 1) (+ ULTIMATE.start_main_~j~5 (- 1))) (= (+ v_b_24_1 (- 1)) (+ v_b_25_1 (- 2))) (<= (- v_b_22_1 (- v_b_24_1)) 5) (= (+ ULTIMATE.start_main_~i~5 1) (+ v_b_22_1 1)) (= v_b_25_1 (+ ULTIMATE.start_main_~i~5 2)) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 8) (<= (- v_b_22_1 v_b_25_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_24_1)) 1) (= (+ v_b_24_1 (- 1)) (+ ULTIMATE.start_main_~j~5 (- 2))) (= ULTIMATE.start_main_~i~5 (+ v_b_24_1 (- 1))) (= (+ v_b_25_1 (- 1)) (+ v_b_22_1 1)) (<= (- ULTIMATE.start_main_~i~5 (- v_b_25_1)) 6) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_25_1)) 0) (<= (- v_b_22_1 (- v_b_25_1)) 6) (= (+ v_b_24_1 1) (+ ULTIMATE.start_main_~i~5 2)) (or (= (select ULTIMATE.start_main_~v~5 v_idx_49) v_v_232_1) (< v_idx_49 v_b_22_1) (<= v_b_24_1 v_idx_49)) (<= (- ULTIMATE.start_main_~i~5 (- v_b_22_1)) 4) (<= (- (- ULTIMATE.start_main_~i~5) v_b_25_1) (- 4))))) (forall ((v_idx_47 Int) (v_idx_45 Int) (v_idx_46 Int) (v_idx_44 Int)) (exists ((v_v_225_1 Int) (v_b_18_1 Int) (v_v_226_1 Int) (v_v_229_1 Int) (v_b_21_1 Int) (v_v_230_1 Int) (v_b_20_1 Int)) (and (= ULTIMATE.start_main_~j~5 (+ v_b_18_1 2)) (= (+ v_b_21_1 (- 2)) (+ ULTIMATE.start_main_~j~5 (- 2))) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~j~5) (- 2)) (= ULTIMATE.start_main_~i~5 (+ v_b_21_1 (- 2))) (= (+ v_b_18_1 2) v_b_21_1) (= (+ (- ULTIMATE.start_main_~i~5) 1) (+ ULTIMATE.start_main_~j~5 (- 1))) (or (<= v_b_21_1 v_idx_46) (< v_idx_46 v_b_20_1) (= v_v_229_1 (select ULTIMATE.start_main_~v~5 v_idx_46))) (<= (- ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~j~5) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- ULTIMATE.start_main_~j~5)) 2) (<= (- (- v_b_18_1) v_b_20_1) (- 1)) (<= (- v_b_20_1 v_b_21_1) (- 1)) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_226_1)) 0) (<= (- ULTIMATE.start_main_~j~5 v_b_21_1) 0) (<= (- v_b_18_1 v_b_20_1) (- 1)) (= (+ (- v_b_21_1) 3) (+ ULTIMATE.start_main_~j~5 (- 1))) (<= (- (- ULTIMATE.start_main_~j~5) ULTIMATE.start_main_~j~5) (- 4)) (= (+ v_b_21_1 (- 2)) (+ (- ULTIMATE.start_main_~j~5) 2)) (<= (- (- ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~i~5) 0) (<= (- (- ULTIMATE.start_main_~j~5) v_b_18_1) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_20_1)) 1) (= (+ v_b_21_1 (- 2)) (+ (- v_b_20_1) 1)) (= 1 (+ ULTIMATE.start_main_~j~5 (- 1))) (<= (- ULTIMATE.start_main_~i~5 (- v_b_18_1)) 0) (or (<= v_b_18_1 v_idx_44) (= v_v_225_1 (select ULTIMATE.start_main_~v~5 v_idx_44))) (<= (- v_v_226_1 v_v_229_1) 0) (<= (- (- v_b_21_1) v_b_21_1) (- 4)) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_18_1)) (- 2)) (<= (- (- ULTIMATE.start_main_~i~5) v_b_21_1) (- 2)) (<= (- v_b_20_1 (- v_b_20_1)) 2) (or (< v_idx_45 v_b_18_1) (= v_v_226_1 (select ULTIMATE.start_main_~v~5 v_idx_45)) (<= v_b_20_1 v_idx_45)) (= (+ v_b_18_1 2) (+ v_b_20_1 1)) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_18_1)) 0) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_21_1)) 0) (<= (- (- v_b_18_1) v_b_18_1) 0) (<= (- ULTIMATE.start_main_~i~5 (- v_b_20_1)) 1) (= (+ v_b_21_1 (- 2)) v_b_18_1) (= (+ v_b_21_1 (- 2)) (+ (- v_b_21_1) 2)) (<= (- (- v_b_20_1) v_b_21_1) (- 3)) (= (- ULTIMATE.start_main_~i~5) (+ v_b_21_1 (- 2))) (= (+ v_b_18_1 2) (+ ULTIMATE.start_main_~i~5 2)) (= (+ v_b_18_1 2) (+ (- v_b_18_1) 2)) (<= (- (- v_b_20_1) v_b_20_1) (- 2)) (= (+ (- v_b_18_1) 1) (+ ULTIMATE.start_main_~j~5 (- 1))) (= v_b_20_1 (+ ULTIMATE.start_main_~j~5 (- 1))) (<= (- ULTIMATE.start_main_~j~5 v_b_18_1) 2) (<= (- v_b_20_1 (- v_b_21_1)) 3) (<= (- (- ULTIMATE.start_main_~j~5) (- v_b_20_1)) (- 1)) (= (+ v_b_18_1 1) (+ ULTIMATE.start_main_~j~5 (- 1))) (<= (- ULTIMATE.start_main_~i~5 v_b_20_1) (- 1)) (= (+ (- ULTIMATE.start_main_~j~5) 3) (+ ULTIMATE.start_main_~j~5 (- 1))) (or (< v_idx_47 v_b_21_1) (= v_v_230_1 (select ULTIMATE.start_main_~v~5 v_idx_47))) (<= (- (- v_b_18_1) (- v_b_21_1)) 2) (<= (- (- ULTIMATE.start_main_~j~5) v_b_20_1) (- 3)) (<= (- ULTIMATE.start_main_~j~5 v_b_20_1) 1) (<= (- v_b_18_1 (- v_b_20_1)) 1) (= (+ v_b_21_1 (- 2)) (+ v_b_20_1 (- 1))) (<= (- ULTIMATE.start_main_~i~5 v_b_21_1) (- 2)) (<= (- ULTIMATE.start_main_~j~5 (- ULTIMATE.start_main_~j~5)) 4) (<= (- ULTIMATE.start_main_~i~5 (- v_b_21_1)) 2) (<= (- (- v_b_20_1) (- v_b_21_1)) 1) (<= (- (- ULTIMATE.start_main_~i~5) (- v_b_21_1)) 2) (<= (- v_b_21_1 (- v_b_21_1)) 4) (<= (- (- ULTIMATE.start_main_~i~5) v_b_20_1) (- 1)) (= (+ (- ULTIMATE.start_main_~i~5) 2) (+ v_b_18_1 2)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_18_1)) 2) (<= (- ULTIMATE.start_main_~j~5 (- v_b_21_1)) 4) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~j~5)) 2) (= (+ v_b_21_1 (- 1)) (+ ULTIMATE.start_main_~j~5 (- 1))) (<= (- (- ULTIMATE.start_main_~i~5) v_b_18_1) 0) (<= (- v_b_18_1 v_b_21_1) (- 2)) (= (+ v_b_18_1 2) (+ (- v_b_20_1) 3)) (<= (- ULTIMATE.start_main_~j~5 (- v_b_20_1)) 3) (<= (- (- v_b_18_1) (- v_b_20_1)) 1) (<= (- (- ULTIMATE.start_main_~key~5) (- v_v_229_1)) 0) (= (+ v_b_18_1 2) 2) (<= (- ULTIMATE.start_main_~i~5 v_b_18_1) 0) (<= (- ULTIMATE.start_main_~key~5 v_v_229_1) 0) (= (+ v_b_18_1 2) (+ (- ULTIMATE.start_main_~j~5) 4)) (<= (- v_b_18_1 (- v_b_21_1)) 2) (<= (- (- ULTIMATE.start_main_~j~5) v_b_21_1) (- 4)) (= (+ v_b_21_1 (- 2)) 0) (<= (- (- v_b_18_1) v_b_21_1) (- 2)) (<= (- v_b_18_1 (- v_b_18_1)) 0) (= (+ ULTIMATE.start_main_~i~5 1) (+ ULTIMATE.start_main_~j~5 (- 1))) (<= (- ULTIMATE.start_main_~i~5 (- ULTIMATE.start_main_~i~5)) 0)))))} [2019-01-07 14:31:09,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 14:31:09,134 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 3 different actions 13 times. Widened at 1 different actions 3 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 14:31:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:31:09,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 14:31:09,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:31:09,142 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-01-07 14:31:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:31:09,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:31:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:31:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:31:09,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:31:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:31:09,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2019-01-07 14:31:09,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:31:09,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 14:31:09,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2019-01-07 14:31:09,300 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:31:09,300 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~v~5_7, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_~key~5]. (and (not (< ULTIMATE.start_main_~key~5 (select v_ULTIMATE.start_main_~v~5_7 ULTIMATE.start_main_~i~5))) (<= 0 ULTIMATE.start_main_~i~5) (= (store v_ULTIMATE.start_main_~v~5_7 (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~key~5) ULTIMATE.start_main_~v~5) (<= ULTIMATE.start_main_~i~5 0)) [2019-01-07 14:31:09,301 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~i~5]. (and (<= (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~i~5) (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~i~5 1))) (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)) [2019-01-07 14:31:09,503 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:31:09,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-01-07 14:31:09,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-01-07 14:31:09,530 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-07 14:31:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:31:09,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:31:09,706 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-07 14:31:09,738 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:31:09,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-07 14:31:09,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:31:09,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2019-01-07 14:31:09,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:31:09,753 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:31:09,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-07 14:31:09,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 14:31:09,796 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:31:09,799 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:31:09,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2019-01-07 14:31:09,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-07 14:31:09,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:31:09,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:5 [2019-01-07 14:31:09,836 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:31:09,837 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~v~5, v_ULTIMATE.start_main_~key~5_5, v_prenex_2, v_prenex_3]. (and (or (let ((.cse0 (store ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~j~5 v_ULTIMATE.start_main_~key~5_5))) (<= (select .cse0 0) (select .cse0 1))) (< v_ULTIMATE.start_main_~key~5_5 (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~j~5 (- 1))))) (or (<= 1 ULTIMATE.start_main_~j~5) (let ((.cse1 (store v_prenex_2 ULTIMATE.start_main_~j~5 v_prenex_3))) (<= (select .cse1 0) (select .cse1 1))))) [2019-01-07 14:31:09,837 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= 0 (+ ULTIMATE.start_main_~j~5 (- 1))) [2019-01-07 14:31:09,841 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-07 14:31:09,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-01-07 14:31:09,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-01-07 14:31:09,852 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:31:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:31:09,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:31:09,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2019-01-07 14:31:09,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:31:09,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:31:09,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:31:09,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:31:09,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:31:09,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:31:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:31:09,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:31:09,885 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-07 14:31:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:31:09,926 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:31:09,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:31:09,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:31:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:31:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:31:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-01-07 14:31:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:31:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-01-07 14:31:09,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5 transitions. [2019-01-07 14:31:09,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:31:09,999 INFO L225 Difference]: With dead ends: 5 [2019-01-07 14:31:09,999 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 14:31:10,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:31:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 14:31:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 14:31:10,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:31:10,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 14:31:10,001 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:31:10,001 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:31:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:31:10,002 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:31:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:31:10,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:31:10,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:31:10,002 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:31:10,002 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:31:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:31:10,003 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:31:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:31:10,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:31:10,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:31:10,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:31:10,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:31:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 14:31:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 14:31:10,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-01-07 14:31:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:31:10,004 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 14:31:10,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:31:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:31:10,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:31:10,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 14:31:10,054 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 56) no Hoare annotation was computed. [2019-01-07 14:31:10,054 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 56) no Hoare annotation was computed. [2019-01-07 14:31:10,055 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 56) no Hoare annotation was computed. [2019-01-07 14:31:10,055 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 54) the Hoare annotation is: false [2019-01-07 14:31:10,055 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 55) no Hoare annotation was computed. [2019-01-07 14:31:10,055 INFO L444 ceAbstractionStarter]: At program point L53(lines 26 53) the Hoare annotation is: (or (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))) [2019-01-07 14:31:10,057 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-07 14:31:10,064 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-07 14:31:10,064 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-07 14:31:10,064 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-07 14:31:10,064 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-07 14:31:10,071 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 02:31:10 BoogieIcfgContainer [2019-01-07 14:31:10,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 14:31:10,072 INFO L168 Benchmark]: Toolchain (without parser) took 42130.72 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -246.3 MB). Peak memory consumption was 587.3 MB. Max. memory is 7.1 GB. [2019-01-07 14:31:10,074 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:31:10,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.57 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:31:10,075 INFO L168 Benchmark]: Boogie Preprocessor took 25.42 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:31:10,076 INFO L168 Benchmark]: RCFGBuilder took 531.07 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 14:31:10,077 INFO L168 Benchmark]: TraceAbstraction took 41527.07 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -267.5 MB). Peak memory consumption was 566.2 MB. Max. memory is 7.1 GB. [2019-01-07 14:31:10,080 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.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.57 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.42 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 531.07 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41527.07 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -267.5 MB). Peak memory consumption was 566.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main_~v~5[0] <= main_~v~5[1] || (1 <= main_~j~5 && main_~j~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 41.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 1 SDs, 0 SdLazy, 8 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 39.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 3 NumberOfFragments, 16 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 7 NumberOfNonLiveVariables, 26 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...