/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 248 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.complInterv; public class ComplInterv { public static void loop(int i) { while (i*i > 9) { if (i < 0) { i = i-1; } else { i = i+1; } } } } package simple.complInterv; public class Main { /** * @param args */ public static void main(String[] args) { ComplInterv.loop(args.length); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.complInterv; public class ComplInterv { public static void loop(int i) { while (i*i > 9) { if (i < 0) { i = i-1; } else { i = i+1; } } } } package simple.complInterv; public class Main { /** * @param args */ public static void main(String[] args) { ComplInterv.loop(args.length); } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0: a10([java.lang.String...]): length 4 -->{java.lang.Object...} YES: (JL1) 1: a10([java.lang.String...]): length 4 -->{java.lang.Object...} YES: (JL1) 2: YES: (JL1) 3: YES: (JL1) Start state of loop: [a4(lv_0_0)] i17: [0,+inf)(l1) i2: [0,+inf) a4([java.lang.String...]): length i2 -->{java.lang.Object...} YES: (JL1) In the loop head node, references [i17] 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_i17 and 0 <= initial_i2) and (((path1_i22 = (path1_i17 * path1_i17) and path1_i22 = path1_i24 and path1_i28 = (path1_i17 + 1) and path1_i28 = res_i17 and path1_i17 = initial_i17) and (T and 9 = 9 and path1_i24 > 9 and path1_i17 >= 0)) and ((res1_i22 = (res1_i17 * res1_i17) and res1_i22 = res1_i24 and res1_i28 = (res1_i17 + 1) and res_i17 = res1_i17) and !(T and 9 = 9 and res1_i24 > 9 and res1_i17 >= 0)))) to be UNSAT. Consequently, the loop will not terminate. ---------------------------------------- (4) NO