java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AbstractInterpretationInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:58:44,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:58:44,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:58:44,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:58:44,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:58:44,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:58:44,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:58:44,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:58:44,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:58:44,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:58:44,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:58:44,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:58:44,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:58:44,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:58:44,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:58:44,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:58:44,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:58:44,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:58:44,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:58:44,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:58:44,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:58:44,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:58:44,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:58:44,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:58:44,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:58:44,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:58:44,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:58:44,212 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:58:44,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:58:44,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:58:44,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:58:44,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:58:44,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:58:44,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:58:44,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:58:44,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:58:44,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_oct_cong.epf [2019-01-11 11:58:44,235 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:58:44,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:58:44,237 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:58:44,238 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:58:44,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:58:44,238 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:58:44,238 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:58:44,239 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:58:44,239 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:58:44,239 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:58:44,239 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:58:44,239 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:58:44,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:58:44,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:58:44,240 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:58:44,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:58:44,242 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:58:44,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:58:44,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:58:44,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:58:44,243 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:58:44,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:58:44,243 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:58:44,243 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:58:44,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:58:44,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:58:44,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:58:44,246 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:58:44,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:58:44,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:58:44,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:58:44,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:58:44,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:58:44,247 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:58:44,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:58:44,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:58:44,247 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:58:44,247 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:58:44,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:58:44,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:58:44,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:58:44,301 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:58:44,302 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:58:44,303 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2019-01-11 11:58:44,303 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-01-11 11:58:44,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:58:44,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:58:44,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:58:44,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:58:44,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:58:44,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:58:44,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:58:44,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:58:44,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:58:44,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:58:44,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:58:44,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:58:44,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:58:44,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:44" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:58:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:58:44,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:58:44,788 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-01-11 11:58:44,790 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:58:44,791 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-11 11:58:44,792 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:58:44 BoogieIcfgContainer [2019-01-11 11:58:44,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:58:44,795 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-11 11:58:44,795 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-11 11:58:44,795 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-11 11:58:44,797 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:58:44" (1/1) ... [2019-01-11 11:58:44,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:58:45,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:58:45,273 INFO L272 AbstractInterpreter]: Visited 9 different actions 55 times. Merged at 4 different actions 23 times. Widened at 4 different actions 10 times. Performed 424 root evaluator evaluations with a maximum evaluation depth of 3. Performed 424 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:58:45,276 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-11 11:58:45,277 INFO L168 Benchmark]: Toolchain (without parser) took 935.66 ms. Allocated memory is still 130.5 MB. Free memory was 104.4 MB in the beginning and 65.2 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:45,279 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 130.5 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:58:45,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.48 ms. Allocated memory is still 130.5 MB. Free memory was 104.4 MB in the beginning and 102.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:45,282 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 ms. Allocated memory is still 130.5 MB. Free memory was 102.6 MB in the beginning and 101.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:45,283 INFO L168 Benchmark]: RCFGBuilder took 382.63 ms. Allocated memory is still 130.5 MB. Free memory was 101.4 MB in the beginning and 91.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:45,285 INFO L168 Benchmark]: Abstract Interpretation took 481.40 ms. Allocated memory is still 130.5 MB. Free memory was 90.9 MB in the beginning and 65.2 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:45,291 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 130.5 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.48 ms. Allocated memory is still 130.5 MB. Free memory was 104.4 MB in the beginning and 102.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.45 ms. Allocated memory is still 130.5 MB. Free memory was 102.6 MB in the beginning and 101.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 382.63 ms. Allocated memory is still 130.5 MB. Free memory was 101.4 MB in the beginning and 91.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 481.40 ms. Allocated memory is still 130.5 MB. Free memory was 90.9 MB in the beginning and 65.2 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 76]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L21] ~array := ~array[0 := 0]; [L22] ~array := ~array[1 := 0]; [L23] ~array := ~array[2 := 0]; [L24] ~array := ~array[3 := 0]; [L25] ~array := ~array[4 := 0]; [L26] ~n := 5; [L27] havoc main_#res; [L28] havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7; [L29] havoc main_~array~7; [L30] havoc main_~i~7; [L31] main_~i~7 := 4; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L39] assume !(main_~i~7 >= 0); [L40] havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4; [L41] havoc SelectionSort_~lh~4; [L42] havoc SelectionSort_~rh~4; [L43] havoc SelectionSort_~i~4; [L44] havoc SelectionSort_~temp~4; [L45] SelectionSort_~lh~4 := 0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L60] assume !(SelectionSort_~lh~4 < ~n); [L61] main_~i~7 := 0; [L63] assume !!(main_~i~7 < 5); [L64] __VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0); [L65] havoc __VERIFIER_assert_~cond; [L66] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L67] assume __VERIFIER_assert_~cond == 0; [L68] assume !false; [L76] assert false; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...