Termination of the given JBC could be proven:

0 JBC
↳1 JBCToGraph (⇒, 20 ms)
↳2 JBCTerminationGraph
↳3 TerminationGraphToSCCProof (⇒, 0 ms)
↳4 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_16 (Sun Microsystems Inc.) Main-Class: TestJulia4 
/**
 * Method main() terminates.
 */

public class TestJulia4 {

    public static void main(String[] args) {
        int a, b = 10;

        if (args.length > 2)
            a = 3;
        else
            a = -2;

        for (int i = 0; i <= (a * 5) / b; i++) {
            a++;
        }
    }
}

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

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


(3) TerminationGraphToSCCProof (SOUND transformation)

Proven termination by absence of SCCs

(4) TRUE