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_exp_cong.epf -i ../../../trunk/examples/programs/quantifier/Arrays/Arrays17.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 12:17:36,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 12:17:36,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 12:17:36,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 12:17:36,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 12:17:36,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 12:17:36,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 12:17:36,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 12:17:36,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 12:17:36,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 12:17:36,125 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 12:17:36,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 12:17:36,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 12:17:36,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 12:17:36,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 12:17:36,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 12:17:36,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 12:17:36,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 12:17:36,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 12:17:36,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 12:17:36,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 12:17:36,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 12:17:36,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 12:17:36,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 12:17:36,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 12:17:36,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 12:17:36,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 12:17:36,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 12:17:36,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 12:17:36,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 12:17:36,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 12:17:36,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 12:17:36,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 12:17:36,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 12:17:36,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 12:17:36,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 12:17:36,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 12:17:36,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 12:17:36,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 12:17:36,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 12:17:36,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 12:17:36,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-08-05 12:17:36,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-05 12:17:36,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-05 12:17:36,171 INFO L136 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-08-05 12:17:36,171 INFO L138 SettingsManager]: * Show backtranslation warnings=false [2019-08-05 12:17:36,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-08-05 12:17:36,172 INFO L138 SettingsManager]: * User list type=DISABLED [2019-08-05 12:17:36,172 INFO L138 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-08-05 12:17:36,172 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-08-05 12:17:36,172 INFO L138 SettingsManager]: * Explicit value domain=true [2019-08-05 12:17:36,173 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-08-05 12:17:36,173 INFO L138 SettingsManager]: * Octagon Domain=false [2019-08-05 12:17:36,173 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-08-05 12:17:36,173 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-08-05 12:17:36,173 INFO L138 SettingsManager]: * Interval Domain=false [2019-08-05 12:17:36,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-05 12:17:36,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-05 12:17:36,175 INFO L138 SettingsManager]: * Use SBE=true [2019-08-05 12:17:36,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-05 12:17:36,175 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-05 12:17:36,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-05 12:17:36,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-05 12:17:36,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-05 12:17:36,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-05 12:17:36,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-05 12:17:36,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-05 12:17:36,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-05 12:17:36,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-05 12:17:36,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-05 12:17:36,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-05 12:17:36,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-05 12:17:36,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-05 12:17:36,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:17:36,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-05 12:17:36,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-05 12:17:36,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-05 12:17:36,179 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-08-05 12:17:36,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-05 12:17:36,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-05 12:17:36,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-05 12:17:36,179 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-08-05 12:17:36,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 12:17:36,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 12:17:36,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 12:17:36,249 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 12:17:36,249 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 12:17:36,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays17.bpl [2019-08-05 12:17:36,250 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays17.bpl' [2019-08-05 12:17:36,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 12:17:36,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 12:17:36,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:36,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 12:17:36,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 12:17:36,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,330 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 12:17:36,330 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 12:17:36,330 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 12:17:36,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:36,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 12:17:36,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 12:17:36,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 12:17:36,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (1/1) ... [2019-08-05 12:17:36,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 12:17:36,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 12:17:36,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 12:17:36,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 12:17:36,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:36" (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-08-05 12:17:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure p2 [2019-08-05 12:17:36,461 INFO L138 BoogieDeclarations]: Found implementation of procedure p2 [2019-08-05 12:17:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 12:17:36,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 12:17:37,018 INFO L275 CfgBuilder]: Using library mode [2019-08-05 12:17:37,018 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 12:17:37,019 INFO L202 PluginConnector]: Adding new model Arrays17.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:37 BoogieIcfgContainer [2019-08-05 12:17:37,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 12:17:37,020 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-08-05 12:17:37,020 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-08-05 12:17:37,021 INFO L275 PluginConnector]: Abstract Interpretation initialized [2019-08-05 12:17:37,021 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "Arrays17.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:37" (1/1) ... [2019-08-05 12:17:37,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-08-05 12:17:37,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-08-05 12:17:37,267 INFO L272 AbstractInterpreter]: Visited 50 different actions 54 times. Merged at 6 different actions 6 times. Never widened. Performed 158 root evaluator evaluations with a maximum evaluation depth of 5. Performed 158 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-08-05 12:17:37,267 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-08-05 12:17:37,271 INFO L168 Benchmark]: Toolchain (without parser) took 978.73 ms. Allocated memory is still 133.7 MB. Free memory was 107.6 MB in the beginning and 81.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:37,272 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 12:17:37,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.40 ms. Allocated memory is still 133.7 MB. Free memory was 107.4 MB in the beginning and 105.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:37,275 INFO L168 Benchmark]: Boogie Preprocessor took 24.70 ms. Allocated memory is still 133.7 MB. Free memory was 105.1 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:37,277 INFO L168 Benchmark]: RCFGBuilder took 644.29 ms. Allocated memory is still 133.7 MB. Free memory was 103.8 MB in the beginning and 89.7 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:37,278 INFO L168 Benchmark]: Abstract Interpretation took 247.22 ms. Allocated memory is still 133.7 MB. Free memory was 89.4 MB in the beginning and 81.0 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:37,284 INFO L335 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.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.40 ms. Allocated memory is still 133.7 MB. Free memory was 107.4 MB in the beginning and 105.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.70 ms. Allocated memory is still 133.7 MB. Free memory was 105.1 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 644.29 ms. Allocated memory is still 133.7 MB. Free memory was 103.8 MB in the beginning and 89.7 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 247.22 ms. Allocated memory is still 133.7 MB. Free memory was 89.4 MB in the beginning and 81.0 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 44]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; - UnprovableResult [Line: 47]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND FALSE !(i < 10 && i >= 0) [L46] i := 0; [L47] assert a[i] == 1; - UnprovableResult [Line: 51]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; - UnprovableResult [Line: 49]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND FALSE !(i < 10 && i >= 0) [L46] i := 0; [L47] assert a[i] == 1; [L48] i := i + 1; [L49] assert a[i] == 2; - UnprovableResult [Line: 52]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; - UnprovableResult [Line: 53]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; - UnprovableResult [Line: 54]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; - UnprovableResult [Line: 55]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; - UnprovableResult [Line: 56]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; - UnprovableResult [Line: 57]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; - UnprovableResult [Line: 58]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; - UnprovableResult [Line: 59]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; - UnprovableResult [Line: 60]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; [L60] assert a[10] == 11; - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; [L60] assert a[10] == 11; [L61] assert a[11] == 12; - UnprovableResult [Line: 62]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; [L60] assert a[10] == 11; [L61] assert a[11] == 12; [L62] assert a[12] == 13; - UnprovableResult [Line: 67]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; [L60] assert a[10] == 11; [L61] assert a[11] == 12; [L62] assert a[12] == 13; [L63] COND FALSE !(i < 10 && i >= 0) [L66] i := 0; [L67] assert a[i] == 1; - UnprovableResult [Line: 64]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; [L60] assert a[10] == 11; [L61] assert a[11] == 12; [L62] assert a[12] == 13; [L63] COND TRUE i < 10 && i >= 0 [L64] assert a[i] <= 10; - UnprovableResult [Line: 69]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; [L60] assert a[10] == 11; [L61] assert a[11] == 12; [L62] assert a[12] == 13; [L63] COND FALSE !(i < 10 && i >= 0) [L66] i := 0; [L67] assert a[i] == 1; [L68] i := i + 1; [L69] assert a[i] == 2; - UnprovableResult [Line: 72]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L23] a[0] := 1; [L24] a[1] := 2; [L25] a[2] := 3; [L26] a[3] := 4; [L27] a[4] := 5; [L28] a[5] := 6; [L29] a[6] := 7; [L30] a[7] := 8; [L31] a[8] := 9; [L32] a[9] := 10; [L33] a[10] := 11; [L34] a[11] := 12; [L35] a[12] := 13; [L36] a[13] := 14; [L37] a[14] := 15; [L38] a[15] := 16; [L39] a[16] := 17; [L40] a[17] := 18; [L41] a[18] := 18; [L42] a[19] := 110; [L43] COND TRUE i < 10 && i >= 0 [L44] assert a[i] <= 10; [L51] assert a[0] == 1; [L52] assert a[1] == 2; [L53] assert a[2] == 3; [L54] assert a[3] == 4; [L55] assert a[4] == 5; [L56] assert a[5] == 6; [L57] assert a[6] == 7; [L58] assert a[7] == 8; [L59] assert a[8] == 9; [L60] assert a[10] == 11; [L61] assert a[11] == 12; [L62] assert a[12] == 13; [L63] COND TRUE i < 10 && i >= 0 [L64] assert a[i] <= 10; [L11] COND TRUE i > 0 [L12] a[0] := 0; [L72] assert a[0] == 0 || a[0] == -1; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...