/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be disproven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 229 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 83 ms]
(6) NO


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
package simple.whileNested;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		WhileNested.increase(args.length);

	}

}


package simple.whileNested;

public class WhileNested {

	public static void increase(int i) {
		int j;
		while (i < 10) {
			j = i;
			while (j > 0) {
				j++;
			}
			i++;
		}
	}
}



----------------------------------------

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
package simple.whileNested;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		WhileNested.increase(args.length);

	}

}


package simple.whileNested;

public class WhileNested {

	public static void increase(int i) {
		int j;
		while (i < 10) {
			j = i;
			while (j > 0) {
				j++;
			}
			i++;
		}
	}
}



----------------------------------------

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
simple.whileNested.Main.main([Ljava/lang/String;)V: Graph of 27 nodes with 1 SCC.





----------------------------------------

(5) JBCNonTerm (COMPLETE)
Reached a loop using the following run: 

0:<simple.whileNested.Main.main||0: load ADDR args||args: a32|| ->
	a32([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
1:<simple.whileNested.Main.main||1: arraylength|| - ||a32>
	a32([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
2:<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase(I)V|| - ||1>
YES:  (JL1)
3:<simple.whileNested.WhileNested.increase||0: load INT i||i: 1|| ->
<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase|| - || ->
YES:  (JL1)
4:<simple.whileNested.WhileNested.increase||1: push 10||i: 1||1>
<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase|| - || ->
YES:  (JL1)
5:<simple.whileNested.WhileNested.increase||3: GE||i: 1||1, 10>
<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase|| - || ->
YES:  (JL1)
6:<simple.whileNested.WhileNested.increase||6: load INT i||i: 1|| ->
<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase|| - || ->
YES:  (JL1)
7:<simple.whileNested.WhileNested.increase||7: store INT to j||i: 1||1>
<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase|| - || ->
YES:  (JL1)
8:<simple.whileNested.WhileNested.increase||8: load INT j||i: 1, j: 1|| ->
<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase|| - || ->
YES:  (JL1)
Start state of loop: 

<simple.whileNested.WhileNested.increase||8: load INT j||i: i61, j: i62|| ->
[a12(lv_0_0)]
<simple.whileNested.Main.main||2: simple.whileNested.WhileNested.increase|| - || ->
	i61: [0,9](3,2){0,+inf}
	i62: [0,+inf)(l3)
	i42: [0,+inf)
	a12([java.lang.String...]): length i42 -->{java.lang.Object...}
YES:  (JL1)


In the loop head node, references [i62, i61] were interesting.

All methods calls in the loop body are side-effect free, hence they can be ignored.

By SMT, we could prove

((0 <= initial_i61 and initial_i61 <= 9 and 0 <= initial_i62 and 0 <= initial_i42) and (((path1_i62 = path1_i117 and path1_i120 = (path1_i117 + 1) and path1_i61 = res_i61 and path1_i120 = res_i62 and path1_i61 = initial_i61 and path1_i62 = initial_i62) and path1_i117 > 0) and ((res1_i62 = res1_i117 and res1_i120 = (res1_i117 + 1) and res_i61 = res1_i61 and res_i62 = res1_i62) and !res1_i117 > 0)))

to be UNSAT. Consequently, the loop will not terminate.
----------------------------------------

(6)
NO