/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, 96 ms]
(2) JBC problem
(3) JBCNonTerm [COMPLETE, 195 ms]
(4) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class TrueDiv {
	
    public static void loop(int i) {
	if (i <= 0) i--;
	else i++;
	loop(i);
    }
	
    public static void main(String[] args) {
	loop(args.length);
    }
}



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

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

(2)
Obligation:
need to prove termination of the following program:
public class TrueDiv {
	
    public static void loop(int i) {
	if (i <= 0) i--;
	else i++;
	loop(i);
    }
	
    public static void main(String[] args) {
	loop(args.length);
    }
}



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

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

0:<TrueDiv.main||0: load ADDR #0||#0: a2|| ->
	a2([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
1:<TrueDiv.main||1: arraylength|| - ||a2>
	a2([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
2:<TrueDiv.main||2: TrueDiv.loop(I)V|| - ||1>
YES:  (JL1)
3:<TrueDiv.loop||0: load INT #0||#0: 1|| ->
YES:  (JL1)
Start state of loop: 

[i90(lv_0_0)]
<TrueDiv.loop||0: load INT #0||#0: i90|| ->
	i90: #
YES:  (JL1)


In the loop head node, references [i90] 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_i90 = path1_i106 and path1_i109 = (path1_i106 + 1) and path1_i109 = res_i90 and path1_i90 = initial_i90) and path1_i106 > 0) or ((path2_i90 = path2_i105 and path2_i108 = (path2_i105 + -1) and path2_i108 = res_i90 and path2_i90 = initial_i90) and path2_i105 <= 0)) and (((res1_i90 = res1_i106 and res1_i109 = (res1_i106 + 1) and res_i90 = res1_i90) and !res1_i106 > 0) and ((res2_i90 = res2_i105 and res2_i108 = (res2_i105 + -1) and res_i90 = res2_i90) and !res2_i105 <= 0))))

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

(4)
NO