/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, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 336 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 346 ms]
(6) NO


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

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

public class AlternDivWidening {

	public static void loop(int i) {
		int w = 5;
		while (i != 0) {
			if (i < -w) {
				i--;
				i = i*(-1);
			} else {
				if (i > w) {
					i++;
					i = i*(-1);
				} else {
					i = 0;
				}
			}
			w++;
		}
	}
}


package simple.alternDivWidening;

public class Main {

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

	}

}



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

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

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

public class AlternDivWidening {

	public static void loop(int i) {
		int w = 5;
		while (i != 0) {
			if (i < -w) {
				i--;
				i = i*(-1);
			} else {
				if (i > w) {
					i++;
					i = i*(-1);
				} else {
					i = 0;
				}
			}
			w++;
		}
	}
}


package simple.alternDivWidening;

public class Main {

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

	}

}



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

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

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





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

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

0:<simple.alternDivWidening.Main.main||0: load ADDR args||args: a34|| ->
	a34([java.lang.String...]): length 6 -->{java.lang.Object...}
YES:  (JL1)
1:<simple.alternDivWidening.Main.main||1: arraylength|| - ||a34>
	a34([java.lang.String...]): length 6 -->{java.lang.Object...}
YES:  (JL1)
2:<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop(I)V|| - ||6>
YES:  (JL1)
3:<simple.alternDivWidening.AlternDivWidening.loop||0: push 5||i: 6|| ->
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
YES:  (JL1)
4:<simple.alternDivWidening.AlternDivWidening.loop||1: store INT to w||i: 6||5>
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
YES:  (JL1)
5:<simple.alternDivWidening.AlternDivWidening.loop||2: load INT i||i: 6, w: 5|| ->
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
YES:  (JL1)
Start state of loop: 

<simple.alternDivWidening.AlternDivWidening.loop||2: load INT i||i: i202, w: i203|| ->
[a14(lv_0_0)]
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
	i202: #
	i203: [5,+inf)(l5)
	i170: [0,+inf)(l4)
	a14([java.lang.String...]): length i170 -->{java.lang.Object...}
YES:  (JL1)


In the loop head node, references [i202, i203] were interesting.

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

By SMT, we could prove

((5 <= initial_i203 and 0 <= initial_i170) and ((((path1_i202 = path1_i212 and path1_i213 = (-1 * path1_i203) and path1_i218 = (path1_i212 + -1) and path1_i223 = (path1_i218 * -1) and path1_i228 = (path1_i203 + 1) and path1_i223 = res_i202 and path1_i228 = res_i203 and path1_i202 = initial_i202 and path1_i203 = initial_i203) and (path1_i212 != 0 and path1_i212 < path1_i213 and path1_i212 < path1_i213)) or ((path3_i202 = path3_i212 and path3_i213 = (-1 * path3_i203) and path3_i224 = (path3_i212 + 1) and path3_i229 = (path3_i224 * -1) and path3_i234 = (path3_i203 + 1) and path3_i229 = res_i202 and path3_i234 = res_i203 and path3_i202 = initial_i202 and path3_i203 = initial_i203) and (path3_i212 != 0 and path3_i212 >= path3_i213 and path3_i212 >= path3_i213 and path3_i212 > path3_i203 and path3_i212 > path3_i203)) or ((path1_i202 = path1_i212 and path1_i213 = (-1 * path1_i203) and path1_i218 = (path1_i212 + -1) and path1_i223 = (path1_i218 * -1) and path1_i228 = (path1_i203 + 1) and path1_i223 = res_i202 and path1_i228 = res_i203 and path1_i202 = initial_i202 and path1_i203 = initial_i203) and (path1_i212 < path1_i213 and path1_i212 < path1_i213 and path1_i212 < 0)) or ((path1_i202 = path1_i212 and path1_i213 = (-1 * path1_i203) and path1_i218 = (path1_i212 + -1) and path1_i223 = (path1_i218 * -1) and path1_i228 = (path1_i203 + 1) and path1_i223 = res_i202 and path1_i228 = res_i203 and path1_i202 = initial_i202 and path1_i203 = initial_i203) and (path1_i212 < path1_i213 and path1_i212 < path1_i213 and path1_i212 > 0))) and (((res1_i202 = res1_i212 and res1_i213 = (-1 * res1_i203) and res1_i218 = (res1_i212 + -1) and res1_i223 = (res1_i218 * -1) and res1_i228 = (res1_i203 + 1) and res_i202 = res1_i202 and res_i203 = res1_i203) and !(res1_i212 != 0 and res1_i212 < res1_i213 and res1_i212 < res1_i213)) and ((res3_i202 = res3_i212 and res3_i213 = (-1 * res3_i203) and res3_i224 = (res3_i212 + 1) and res3_i229 = (res3_i224 * -1) and res3_i234 = (res3_i203 + 1) and res_i202 = res3_i202 and res_i203 = res3_i203) and !(res3_i212 != 0 and res3_i212 >= res3_i213 and res3_i212 >= res3_i213 and res3_i212 > res3_i203 and res3_i212 > res3_i203)) and ((res1_i202 = res1_i212 and res1_i213 = (-1 * res1_i203) and res1_i218 = (res1_i212 + -1) and res1_i223 = (res1_i218 * -1) and res1_i228 = (res1_i203 + 1) and res_i202 = res1_i202 and res_i203 = res1_i203) and !(res1_i212 < res1_i213 and res1_i212 < res1_i213 and res1_i212 < 0)) and ((res1_i202 = res1_i212 and res1_i213 = (-1 * res1_i203) and res1_i218 = (res1_i212 + -1) and res1_i223 = (res1_i218 * -1) and res1_i228 = (res1_i203 + 1) and res_i202 = res1_i202 and res_i203 = res1_i203) and !(res1_i212 < res1_i213 and res1_i212 < res1_i213 and res1_i212 > 0)))))

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

(6)
NO