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/Arrays15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 12:17:38,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 12:17:38,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 12:17:38,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 12:17:38,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 12:17:38,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 12:17:38,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 12:17:38,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 12:17:38,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 12:17:38,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 12:17:38,742 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 12:17:38,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 12:17:38,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 12:17:38,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 12:17:38,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 12:17:38,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 12:17:38,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 12:17:38,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 12:17:38,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 12:17:38,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 12:17:38,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 12:17:38,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 12:17:38,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 12:17:38,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 12:17:38,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 12:17:38,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 12:17:38,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 12:17:38,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 12:17:38,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 12:17:38,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 12:17:38,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 12:17:38,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 12:17:38,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 12:17:38,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 12:17:38,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 12:17:38,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 12:17:38,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 12:17:38,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 12:17:38,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 12:17:38,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 12:17:38,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 12:17:38,780 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:38,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-05 12:17:38,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-05 12:17:38,796 INFO L136 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-08-05 12:17:38,797 INFO L138 SettingsManager]: * Show backtranslation warnings=false [2019-08-05 12:17:38,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-08-05 12:17:38,797 INFO L138 SettingsManager]: * User list type=DISABLED [2019-08-05 12:17:38,797 INFO L138 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-08-05 12:17:38,797 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-08-05 12:17:38,798 INFO L138 SettingsManager]: * Explicit value domain=true [2019-08-05 12:17:38,798 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-08-05 12:17:38,798 INFO L138 SettingsManager]: * Octagon Domain=false [2019-08-05 12:17:38,798 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-08-05 12:17:38,798 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-08-05 12:17:38,798 INFO L138 SettingsManager]: * Interval Domain=false [2019-08-05 12:17:38,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-05 12:17:38,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-05 12:17:38,799 INFO L138 SettingsManager]: * Use SBE=true [2019-08-05 12:17:38,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-05 12:17:38,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-05 12:17:38,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-05 12:17:38,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-05 12:17:38,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-05 12:17:38,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-05 12:17:38,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-05 12:17:38,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-05 12:17:38,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-05 12:17:38,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-05 12:17:38,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-05 12:17:38,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-05 12:17:38,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-05 12:17:38,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-05 12:17:38,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:17:38,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-05 12:17:38,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-05 12:17:38,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-05 12:17:38,805 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-08-05 12:17:38,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-05 12:17:38,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-05 12:17:38,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-05 12:17:38,805 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-08-05 12:17:38,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 12:17:38,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 12:17:38,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 12:17:38,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 12:17:38,857 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 12:17:38,858 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays15.bpl [2019-08-05 12:17:38,858 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays15.bpl' [2019-08-05 12:17:38,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 12:17:38,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 12:17:38,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:38,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 12:17:38,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 12:17:38,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,932 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 12:17:38,932 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 12:17:38,932 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 12:17:38,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:38,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 12:17:38,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 12:17:38,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 12:17:38,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (1/1) ... [2019-08-05 12:17:38,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 12:17:38,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 12:17:38,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 12:17:38,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 12:17:38,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:38" (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:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 12:17:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 12:17:39,609 INFO L275 CfgBuilder]: Using library mode [2019-08-05 12:17:39,610 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 12:17:39,611 INFO L202 PluginConnector]: Adding new model Arrays15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:39 BoogieIcfgContainer [2019-08-05 12:17:39,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 12:17:39,612 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-08-05 12:17:39,612 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-08-05 12:17:39,612 INFO L275 PluginConnector]: Abstract Interpretation initialized [2019-08-05 12:17:39,613 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-08-05 12:17:39,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-08-05 12:17:39,833 INFO L272 AbstractInterpreter]: Visited 44 different actions 69 times. Merged at 26 different actions 26 times. Never widened. Performed 232 root evaluator evaluations with a maximum evaluation depth of 4. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-08-05 12:17:39,833 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-08-05 12:17:39,836 INFO L168 Benchmark]: Toolchain (without parser) took 937.65 ms. Allocated memory is still 134.7 MB. Free memory was 108.6 MB in the beginning and 83.3 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:39,837 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 134.7 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 12:17:39,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.15 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:39,840 INFO L168 Benchmark]: Boogie Preprocessor took 32.93 ms. Allocated memory is still 134.7 MB. Free memory was 106.5 MB in the beginning and 105.2 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:39,841 INFO L168 Benchmark]: RCFGBuilder took 642.59 ms. Allocated memory is still 134.7 MB. Free memory was 105.2 MB in the beginning and 91.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:39,842 INFO L168 Benchmark]: Abstract Interpretation took 221.16 ms. Allocated memory is still 134.7 MB. Free memory was 91.8 MB in the beginning and 83.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:39,847 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.13 ms. Allocated memory is still 134.7 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.15 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.93 ms. Allocated memory is still 134.7 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 642.59 ms. Allocated memory is still 134.7 MB. Free memory was 105.2 MB in the beginning and 91.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 221.16 ms. Allocated memory is still 134.7 MB. Free memory was 91.8 MB in the beginning and 83.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 33]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; - UnprovableResult [Line: 36]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND FALSE !(i < 10 && i >= 0) [L35] i := 0; [L36] assert a[i] == 1; - UnprovableResult [Line: 38]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND FALSE !(i < 10 && i >= 0) [L35] i := 0; [L36] assert a[i] == 1; [L37] i := i + 1; [L38] assert a[i] == 2; - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; - UnprovableResult [Line: 41]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND TRUE j < 10 && j >= 0 [L41] assert a[j] <= 10; - UnprovableResult [Line: 48]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; - UnprovableResult [Line: 43]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND TRUE j < 10 && j >= 0 [L41] assert a[j] <= 10; [L42] j := a[j]; [L43] assert j <= 10; - UnprovableResult [Line: 50]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; [L55] assert a[5] == 6; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; [L55] assert a[5] == 6; [L56] assert a[6] == 7; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; [L55] assert a[5] == 6; [L56] assert a[6] == 7; [L57] assert a[7] == 8; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; [L55] assert a[5] == 6; [L56] assert a[6] == 7; [L57] assert a[7] == 8; [L58] assert a[8] == 9; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; [L55] assert a[5] == 6; [L56] assert a[6] == 7; [L57] assert a[7] == 8; [L58] assert a[8] == 9; [L59] assert a[10] == 11; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; [L55] assert a[5] == 6; [L56] assert a[6] == 7; [L57] assert a[7] == 8; [L58] assert a[8] == 9; [L59] assert a[10] == 11; [L60] assert a[11] == 12; - 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: [L12] a[0] := 1; [L13] a[1] := 2; [L14] a[2] := 3; [L15] a[3] := 4; [L16] a[4] := 5; [L17] a[5] := 6; [L18] a[6] := 7; [L19] a[7] := 8; [L20] a[8] := 9; [L21] a[9] := 10; [L22] a[10] := 11; [L23] a[11] := 12; [L24] a[12] := 13; [L25] a[13] := 14; [L26] a[14] := 15; [L27] a[15] := 16; [L28] a[16] := 17; [L29] a[17] := 18; [L30] a[18] := 18; [L31] a[19] := 110; [L32] COND TRUE i < 10 && i >= 0 [L33] assert a[i] <= 10; [L40] COND FALSE !(j < 10 && j >= 0) [L45] j := 0; [L46] assert a[j] == 1; [L47] i := j + 1; [L48] assert a[i] == 2; [L50] assert a[0] == 1; [L51] assert a[1] == 2; [L52] assert a[2] == 3; [L53] assert a[3] == 4; [L54] assert a[4] == 5; [L55] assert a[5] == 6; [L56] assert a[6] == 7; [L57] assert a[7] == 8; [L58] assert a[8] == 9; [L59] assert a[10] == 11; [L60] assert a[11] == 12; [L61] assert a[12] == 13; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...