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


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


NO
proof of /export/starexec/sandbox/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) JBCNonTerm [COMPLETE, 301 ms]
(4) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class Middle {

    public static int middle(int i, int j) {
	if (i != j) {
	    i--;
	    j++;
	    return middle(i, j);
	}
	return i;
    }

    public static void main(String[] args) {
	middle(args.length, args.length + 5);
    }
}



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

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

(2)
Obligation:
need to prove termination of the following program:
public class Middle {

    public static int middle(int i, int j) {
	if (i != j) {
	    i--;
	    j++;
	    return middle(i, j);
	}
	return i;
    }

    public static void main(String[] args) {
	middle(args.length, args.length + 5);
    }
}



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

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

0:<Middle.main||0: load ADDR #0||#0: a2|| ->
	a2([java.lang.String...]): length 0 -->{java.lang.Object...}
YES:  (JL1)
1:<Middle.main||1: arraylength||#0: a2||a2>
	a2([java.lang.String...]): length 0 -->{java.lang.Object...}
YES:  (JL1)
2:<Middle.main||2: load ADDR #0||#0: a2||0>
	a2([java.lang.String...]): length 0 -->{java.lang.Object...}
YES:  (JL1)
3:<Middle.main||3: arraylength|| - ||0, a2>
	a2([java.lang.String...]): length 0 -->{java.lang.Object...}
YES:  (JL1)
4:<Middle.main||4: push 5|| - ||0, 0>
YES:  (JL1)
5:<Middle.main||5: ADD|| - ||0, 0, 5>
YES:  (JL1)
6:<Middle.main||6: Middle.middle(II)I|| - ||0, 5>
YES:  (JL1)
7:<Middle.middle||0: load INT #0||#0: 0, #1: 5|| ->
YES:  (JL1)
Start state of loop: 

[i29(lv_0_0), i30(lv_0_1)]
<Middle.middle||0: load INT #0||#0: i29, #1: i30|| ->
	i29: #
	i30: #
YES:  (JL1)


In the loop head node, references [i29, i30] were interesting.

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

By SMT, we could prove

(T and ((((path1_i35 = (path1_i29 + -1) and path1_i36 = (path1_i30 + 1) and path1_i35 = res_i29 and path1_i36 = res_i30 and path1_i29 = initial_i29 and path1_i30 = initial_i30) and (path1_i29 != path1_i30 and path1_i29 < path1_i30)) or ((path1_i35 = (path1_i29 + -1) and path1_i36 = (path1_i30 + 1) and path1_i35 = res_i29 and path1_i36 = res_i30 and path1_i29 = initial_i29 and path1_i30 = initial_i30) and (path1_i29 < path1_i30 and path1_i29 < path1_i30)) or ((path1_i35 = (path1_i29 + -1) and path1_i36 = (path1_i30 + 1) and path1_i35 = res_i29 and path1_i36 = res_i30 and path1_i29 = initial_i29 and path1_i30 = initial_i30) and (path1_i29 < path1_i30 and path1_i29 > path1_i30))) and (((res1_i35 = (res1_i29 + -1) and res1_i36 = (res1_i30 + 1) and res_i29 = res1_i29 and res_i30 = res1_i30) and !(res1_i29 != res1_i30 and res1_i29 < res1_i30)) and ((res1_i35 = (res1_i29 + -1) and res1_i36 = (res1_i30 + 1) and res_i29 = res1_i29 and res_i30 = res1_i30) and !(res1_i29 < res1_i30 and res1_i29 < res1_i30)) and ((res1_i35 = (res1_i29 + -1) and res1_i36 = (res1_i30 + 1) and res_i29 = res1_i29 and res_i30 = res1_i30) and !(res1_i29 < res1_i30 and res1_i29 > res1_i30)))))

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

(4)
NO