/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 276 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 85 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 25 ms]
(16) IntTRS
(17) RankingReductionPairProof [EQUIVALENT, 0 ms]
(18) YES


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
public class Overflow {

  // does not terminate for any value of i
  public static void overflow(int i) {
    while(i <= 2147483647) {
      i++;
    }
  }

  public static void main(String[] args) {
    Random.args = args;
    overflow(Random.random());
  }
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}



----------------------------------------

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
public class Overflow {

  // does not terminate for any value of i
  public static void overflow(int i) {
    while(i <= 2147483647) {
      i++;
    }
  }

  public static void main(String[] args) {
    Random.args = args;
    overflow(Random.random());
  }
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}



----------------------------------------

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
Overflow.main([Ljava/lang/String;)V: Graph of 108 nodes with 1 SCC.





----------------------------------------

(5) TerminationGraphToSCCProof (SOUND)
Splitted TerminationGraph to 1 SCCs.
----------------------------------------

(6)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: Overflow.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:

*Marker field analysis yielded the following relations that could be markers:

----------------------------------------

(7) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 7 IRulesP rules:
f128_0_overflow_ConstantStackPush(EOS(STATIC_128), i18, i18) -> f131_0_overflow_GT(EOS(STATIC_131), i18, i18, 2147483647) :|: TRUE
f131_0_overflow_GT(EOS(STATIC_131), i22, i22, matching1) -> f144_0_overflow_GT(EOS(STATIC_144), i22, i22, 2147483647) :|: TRUE && matching1 = 2147483647
f144_0_overflow_GT(EOS(STATIC_144), i22, i22, matching1) -> f154_0_overflow_Inc(EOS(STATIC_154), i22) :|: i22 <= 2147483647 && matching1 = 2147483647
f154_0_overflow_Inc(EOS(STATIC_154), i22) -> f173_0_overflow_JMP(EOS(STATIC_173), i22 + 1) :|: TRUE
f173_0_overflow_JMP(EOS(STATIC_173), i26) -> f229_0_overflow_Load(EOS(STATIC_229), i26) :|: TRUE
f229_0_overflow_Load(EOS(STATIC_229), i26) -> f115_0_overflow_Load(EOS(STATIC_115), i26) :|: TRUE
f115_0_overflow_Load(EOS(STATIC_115), i18) -> f128_0_overflow_ConstantStackPush(EOS(STATIC_128), i18, i18) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f128_0_overflow_ConstantStackPush(EOS(STATIC_128), i18:0, i18:0) -> f128_0_overflow_ConstantStackPush(EOS(STATIC_128), i18:0 + 1, i18:0 + 1) :|: i18:0 < 2147483648
Filtered constant ground arguments:
   f128_0_overflow_ConstantStackPush(x1, x2, x3) -> f128_0_overflow_ConstantStackPush(x2, x3)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f128_0_overflow_ConstantStackPush(x1, x2) -> f128_0_overflow_ConstantStackPush(x2)
Finished conversion. Obtained 1 rules.P rules:
f128_0_overflow_ConstantStackPush(i18:0) -> f128_0_overflow_ConstantStackPush(i18:0 + 1) :|: i18:0 < 2147483648

----------------------------------------

(8)
Obligation:
Rules:
f128_0_overflow_ConstantStackPush(i18:0) -> f128_0_overflow_ConstantStackPush(i18:0 + 1) :|: i18:0 < 2147483648

----------------------------------------

(9) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(10)
Obligation:
Rules:
f128_0_overflow_ConstantStackPush(i18:0) -> f128_0_overflow_ConstantStackPush(arith) :|: i18:0 < 2147483648 && arith = i18:0 + 1

----------------------------------------

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f128_0_overflow_ConstantStackPush(i18:0) -> f128_0_overflow_ConstantStackPush(arith) :|: i18:0 < 2147483648 && arith = i18:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!
----------------------------------------

(12)
Obligation:

Termination digraph:
Nodes:
(1) f128_0_overflow_ConstantStackPush(i18:0) -> f128_0_overflow_ConstantStackPush(arith) :|: i18:0 < 2147483648 && arith = i18:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

----------------------------------------

(13) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(14)
Obligation:
Rules:
f128_0_overflow_ConstantStackPush(i18:0:0) -> f128_0_overflow_ConstantStackPush(i18:0:0 + 1) :|: i18:0:0 < 2147483648

----------------------------------------

(15) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f128_0_overflow_ConstantStackPush(INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(16)
Obligation:
Rules:
f128_0_overflow_ConstantStackPush(i18:0:0) -> f128_0_overflow_ConstantStackPush(c) :|: c = i18:0:0 + 1 && i18:0:0 < 2147483648

----------------------------------------

(17) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f128_0_overflow_ConstantStackPush ] = -1*f128_0_overflow_ConstantStackPush_1

The following rules are decreasing:
f128_0_overflow_ConstantStackPush(i18:0:0) -> f128_0_overflow_ConstantStackPush(c) :|: c = i18:0:0 + 1 && i18:0:0 < 2147483648

The following rules are bounded:
f128_0_overflow_ConstantStackPush(i18:0:0) -> f128_0_overflow_ConstantStackPush(c) :|: c = i18:0:0 + 1 && i18:0:0 < 2147483648


----------------------------------------

(18)
YES