The time complexity of the given JBC problem could be proven to be BOUNDS(CONSTANT, 224).

(0) Obligation:

Need to prove time_complexity of the following program:

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

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


public class SharingPair {
	SharingPair next;

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

		while (true) {
			if (i == 0) {
				one.next = new SharingPair();
				cur = cur.next;
			} else {
				two.next = new SharingPair();
				cur = cur.next;
			}
		}
	}
}

(1) JBCToGraph (BOTH CONCRETE BOUNDS(ID, ID) transformation)

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
SharingPair.main([Ljava/lang/String;)V: Graph of 245 nodes with 0 SCCs.

(3) TerminationGraphToComplexityProof (EQUIVALENT transformation)

Proven constant complexity by absence of SCCs and edges with non-constant weight

(4) BOUNDS(CONSTANT, 224)