Termination of the given JBC could be proven:

(0) Obligation:

JBC Problem based on JBC Program:

public class MinusBuiltIn{

  public static void main(String[] args) {
    Random.args = args;
    int x = Random.random();
    int y = Random.random();
    int res = 0;



    while (x > y) {

      y++;
      res++;

    }
  }

}



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

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

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
MinusBuiltIn.main([Ljava/lang/String;)V: Graph of 181 nodes with 1 SCC.

(3) TerminationGraphToSCCProof (SOUND transformation)

Splitted TerminationGraph to 1 SCCs.

(4) Obligation:

SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: MinusBuiltIn.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:
  

(5) SCCToIntTRSProof (SOUND transformation)

Transformed FIGraph SCCs to intTRSs. Log:

Generated rules. Obtained 8 IRules

P rules:
f687_0_main_Load(EOS, i18, i97, i18) → f690_0_main_LE(EOS, i18, i97, i18, i97)
f690_0_main_LE(EOS, i18, i97, i18, i97) → f693_0_main_LE(EOS, i18, i97, i18, i97)
f693_0_main_LE(EOS, i18, i97, i18, i97) → f698_0_main_Inc(EOS, i18, i97) | >(i18, i97)
f698_0_main_Inc(EOS, i18, i97) → f701_0_main_Inc(EOS, i18, +(i97, 1)) | >=(i97, 0)
f701_0_main_Inc(EOS, i18, i104) → f704_0_main_JMP(EOS, i18, i104)
f704_0_main_JMP(EOS, i18, i104) → f728_0_main_Load(EOS, i18, i104)
f728_0_main_Load(EOS, i18, i104) → f685_0_main_Load(EOS, i18, i104)
f685_0_main_Load(EOS, i18, i97) → f687_0_main_Load(EOS, i18, i97, i18)

Combined rules. Obtained 1 IRules

P rules:
f687_0_main_Load(EOS, x0, x1, x0) → f687_0_main_Load(EOS, x0, +(x1, 1), x0) | &&(<(x1, x0), >(+(x1, 1), 0))

Filtered ground terms:

f687_0_main_Load(x1, x2, x3, x4) → f687_0_main_Load(x2, x3, x4)
Cond_f687_0_main_Load(x1, x2, x3, x4, x5) → Cond_f687_0_main_Load(x1, x3, x4, x5)

Filtered duplicate terms:

f687_0_main_Load(x1, x2, x3) → f687_0_main_Load(x2, x3)
Cond_f687_0_main_Load(x1, x2, x3, x4) → Cond_f687_0_main_Load(x1, x3, x4)

Prepared 1 rules for path length conversion:

P rules:
f687_0_main_Load(x1, x0) → f687_0_main_Load(+(x1, 1), x0) | &&(<(x1, x0), >(+(x1, 1), 0))

Finished conversion. Obtained 1 rules.

P rules:
f687_0_main_Load(x0, x1) → f687_0_main_Load(+(x0, 1), x1) | &&(>(x0, -1), >(x1, x0))

(6) Obligation:

Rules:
f687_0_main_Load(x0, x1) → f687_0_main_Load(+(x0, 1), x1) | &&(>(x0, -1), >(x1, x0))

(7) PolynomialOrderProcessor (EQUIVALENT transformation)

Found the following polynomial interpretation:

[f687_0_main_Load(x3, x5)] = -x3 + x5

Therefore the following rule(s) have been dropped:

f687_0_main_Load(x0, x1) → f687_0_main_Load(+(x0, 1), x1) | &&(>(x0, -1), >(x1, x0))

(8) YES