Termination of the given JBC could be proven:

(0) Obligation:

JBC Problem based on JBC Program:

public class NullPair {
	NullPair next;

	public static void main(String[] args) {
		Random.args = args;
		NullPair one = null;
		NullPair two = null;
		int i = Random.random();
		if (i == 0) {
			one = new NullPair();
		} else {
			two = new NullPair();
		}

		while (one == null && two == null);
	}
}


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:
NullPair.main([Ljava/lang/String;)V: Graph of 130 nodes with 0 SCCs.

(3) TerminationGraphToSCCProof (SOUND transformation)

Proven termination by absence of SCCs

(4) TRUE