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


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

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

public class Main {

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

	}

}


package simple.upAndDown;

public class UpAndDown {

	public static void upAndDown(int i) {
		boolean up = false;
		while (0 <= i && i <= 10) {
			if (i == 10) {
				up = false;
			}
			if (i == 0) {
				up = true;
			}
			if (up) {
				i++;
			} else {
				i--;
			}
		}
	}
}



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

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

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

public class Main {

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

	}

}


package simple.upAndDown;

public class UpAndDown {

	public static void upAndDown(int i) {
		boolean up = false;
		while (0 <= i && i <= 10) {
			if (i == 10) {
				up = false;
			}
			if (i == 0) {
				up = true;
			}
			if (up) {
				i++;
			} else {
				i--;
			}
		}
	}
}



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

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

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





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

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

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

<simple.upAndDown.UpAndDown.upAndDown||2: push 0||i: i55, up: i56|| ->
[a14(lv_0_0)]
<simple.upAndDown.Main.main||2: simple.upAndDown.UpAndDown.upAndDown|| - || ->
	i55: [0,+inf)(l2)
	i56: [0,1](1,1)
	i16: [0,+inf)(l1)
	a14([java.lang.String...]): length i16 -->{java.lang.Object...}
YES:  (JL1)


In the loop head node, references [i55, i56] 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_i55 and 0 <= initial_i56 and initial_i56 <= 1 and 0 <= initial_i16) and ((((path1_i55 = path1_i61 and path1_i61 = path1_i64 and path1_i64 = path1_i65 and path1_i66 = (path1_i65 + 1) and path1_i66 = res_i55 and 1 = res_i56 and path1_i55 = initial_i55 and path1_i56 = initial_i56) and (0 <= path1_i55 and T and 10 = 10 and path1_i61 <= 10 and T and 10 = 10 and path1_i64 < 10 and path1_i65 > 0 and path1_i56 = 1 and 1 > 0)) or ((path2_i55 = path2_i61 and path2_i61 = path2_i64 and path2_i64 = path2_i65 and path2_i67 = (path2_i65 + -1) and path2_i67 = res_i55 and 0 = res_i56 and path2_i55 = initial_i55 and path2_i56 = initial_i56) and (0 <= path2_i55 and T and 10 = 10 and path2_i61 <= 10 and T and 10 = 10 and path2_i64 < 10 and path2_i65 > 0 and path2_i56 = 0 and T)) or ((path3_i55 = path3_i61 and 9 = res_i55 and 0 = res_i56 and path3_i55 = initial_i55 and path3_i56 = initial_i56) and (0 <= path3_i55 and T and 10 = 10 and path3_i61 <= 10 and path3_i61 = 10 and path3_i61 = 10 and 10 = 10 and 10 > 0 and T)) or ((path4_i55 = path4_i61 and path4_i61 = path4_i64 and 1 = res_i55 and 1 = res_i56 and path4_i55 = initial_i55 and path4_i56 = initial_i56) and (0 <= path4_i55 and T and 10 = 10 and path4_i61 <= 10 and T and 10 = 10 and path4_i64 < 10 and path4_i64 = 0 and T and 1 > 0))) and (((res1_i55 = res1_i61 and res1_i61 = res1_i64 and res1_i64 = res1_i65 and res1_i66 = (res1_i65 + 1) and res_i55 = res1_i55 and res_i56 = res1_i56) and !(0 <= res1_i55 and T and 10 = 10 and res1_i61 <= 10 and T and 10 = 10 and res1_i64 < 10 and res1_i65 > 0 and res1_i56 = 1 and 1 > 0)) and ((res2_i55 = res2_i61 and res2_i61 = res2_i64 and res2_i64 = res2_i65 and res2_i67 = (res2_i65 + -1) and res_i55 = res2_i55 and res_i56 = res2_i56) and !(0 <= res2_i55 and T and 10 = 10 and res2_i61 <= 10 and T and 10 = 10 and res2_i64 < 10 and res2_i65 > 0 and res2_i56 = 0 and T)) and ((res3_i55 = res3_i61 and res_i55 = res3_i55 and res_i56 = res3_i56) and !(0 <= res3_i55 and T and 10 = 10 and res3_i61 <= 10 and res3_i61 = 10 and res3_i61 = 10 and 10 = 10 and 10 > 0 and T)) and ((res4_i55 = res4_i61 and res4_i61 = res4_i64 and res_i55 = res4_i55 and res_i56 = res4_i56) and !(0 <= res4_i55 and T and 10 = 10 and res4_i61 <= 10 and T and 10 = 10 and res4_i64 < 10 and res4_i64 = 0 and T and 1 > 0)))))

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

(6)
NO