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

(0) Obligation:

Need to prove time_complexity of the following program:

/**
 * A loop that might potentially throw a <tt>NullPointerException</tt>
 * because of the instance field access <tt>exc.f</tt>. If that happened,
 * the loop would diverge since the exception handler does not include any
 * progress statement. However, Julia can prove that <tt>exc</tt> is not
 * <tt>null</tt> at the point where <tt>exc.f</tt> is accessed, so that
 * no exception can be thrown there. Hence the loop is proved to terminate.
 *
 * All calls terminate.
 *
 * Julia + BinTerm prove that all calls terminate.
 *
 * Note: without a preliminary nullness analysis, termination could not
 *       be proved.
 *
 * @author <A HREF="mailto:[e-mail]">Fausto Spoto</A>
 */

public class Exc {
    private int f;

    public static void main(String[] args) {
	Exc exc = new Exc();
	int i = 0;

	while (i < 20) {
	    try {
		if (i > 10) exc.f = 5;
		i += 2;
	    }
	    catch (NullPointerException e) {
	    }
	}
    }
}

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

Constructed TerminationGraph.

(2) Obligation:

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

(3) TerminationGraphToComplexityProof (EQUIVALENT transformation)

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

(4) BOUNDS(CONSTANT, 120)