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

(0) Obligation:

Need to prove time_complexity of the following program:

public class IntPath2 {
    public static void main(String[] args) {
        Random.args = args;
		Object obj = null;
        int i = Random.random();
		if (i > 0)
			obj = new Object();
		while (i == 0 && obj != null)
			obj = new Object();
    }
}


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

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

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

Constructed TerminationGraph.

(2) Obligation:

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

(3) TerminationGraphToComplexityProof (EQUIVALENT transformation)

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

(4) BOUNDS(CONSTANT, 95)

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

Constructed TerminationGraph.

(6) Obligation:

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