(0) Obligation:

JBC Problem based on JBC Program:
package example_4;

public class Examples {

int f = 10;

// usual getter and setter methods
public int getF() {
return f;
}

public void setF(int f) {
this.f = f;
}

}


package example_4;

/**
* @costaContext fields/Examples
*
*/
public class ExamplesCont {

Examples e;

public ExamplesCont() {
e = new Examples();
}
}


package example_4;

/**
* @costaContext example_4/Examples
*
*/
public class Test {
public void exampleMethods(ExamplesCont x, Examples y) {
int i = 0;

while (x.e.getF() > 0) {
i += y.getF();
x.e.setF(x.e.getF()-1);
}
}

public static void main(String[] args) {
Test o = new Test();
ExamplesCont x = new ExamplesCont();
Examples y = new Examples();
o.exampleMethods(x,y);
}
}


(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

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


(3) TerminationGraphToSCCProof (SOUND transformation)

Proven termination by absence of SCCs

(4) TRUE