/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, 463 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Ex08 { public static void loop_aux(int i, boolean up) { if (i > 0) { if (i == 1) up = true; if (i == 10) up = false; if (up) i++; else i--; loop_aux(i, up); } } public static void loop(int i) { loop_aux(i, false); } public static void main(String[] args) { loop(10 * args.length); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class Ex08 { public static void loop_aux(int i, boolean up) { if (i > 0) { if (i == 1) up = true; if (i == 10) up = false; if (up) i++; else i--; loop_aux(i, up); } } public static void loop(int i) { loop_aux(i, false); } public static void main(String[] args) { loop(10 * args.length); } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0: a2([java.lang.String...]): length 2 -->{java.lang.Object...} YES: (JL1) 1: a2([java.lang.String...]): length 2 -->{java.lang.Object...} YES: (JL1) 2: a2([java.lang.String...]): length 2 -->{java.lang.Object...} YES: (JL1) 3: YES: (JL1) 4: YES: (JL1) 5: YES: (JL1) 6: YES: (JL1) 7: YES: (JL1) 8: YES: (JL1) Start state of loop: [i56(lv_0_0), i57(lv_0_1)] i56: [0,+inf)(l1) i57: [0,1](1,1) i58: [0,1](1,1) YES: (JL1) In the loop head node, references [i56, i58, i57] 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_i56 and 0 <= initial_i57 and initial_i57 <= 1 and 0 <= initial_i58 and initial_i58 <= 1) and ((((path1_i56 = path1_i60 and path1_i60 = path1_i62 and path1_i62 = path1_i63 and path1_i63 = path1_i65 and path1_i68 = (path1_i65 + -1) and path1_i68 = res_i56 and 0 = res_i57 and 0 = res_i58 and path1_i56 = initial_i56 and path1_i57 = initial_i57 and path1_i58 = initial_i58) and (path1_i60 > 0 and T and 1 = 1 and path1_i62 > 1 and T and 10 = 10 and path1_i63 < 10 and path1_i58 = 0 and T)) or ((path2_i56 = path2_i60 and path2_i60 = path2_i62 and path2_i62 = path2_i64 and path2_i64 = path2_i65 and path2_i68 = (path2_i65 + -1) and path2_i68 = res_i56 and 0 = res_i57 and 0 = res_i58 and path2_i56 = initial_i56 and path2_i57 = initial_i57 and path2_i58 = initial_i58) and (path2_i60 > 0 and T and 1 = 1 and path2_i62 > 1 and T and 10 = 10 and path2_i64 > 10 and path2_i58 = 0 and T)) or ((path3_i56 = path3_i60 and 2 = res_i56 and 1 = res_i57 and 1 = res_i58 and path3_i56 = initial_i56 and path3_i57 = initial_i57 and path3_i58 = initial_i58) and (path3_i60 > 0 and path3_i60 = 1 and path3_i60 = 1 and 1 = 1 and 1 > 0)) or ((path4_i56 = path4_i60 and path4_i60 = path4_i62 and 9 = res_i56 and 0 = res_i57 and 0 = res_i58 and path4_i56 = initial_i56 and path4_i57 = initial_i57 and path4_i58 = initial_i58) and (path4_i60 > 0 and T and 1 = 1 and path4_i62 > 1 and path4_i62 = 10 and path4_i62 = 10 and 10 = 10 and T)) or ((path5_i56 = path5_i60 and path5_i60 = path5_i62 and path5_i62 = path5_i63 and path5_i63 = path5_i65 and path5_i67 = (path5_i65 + 1) and path5_i67 = res_i56 and 1 = res_i57 and 1 = res_i58 and path5_i56 = initial_i56 and path5_i57 = initial_i57 and path5_i58 = initial_i58) and (path5_i60 > 0 and T and 1 = 1 and path5_i62 > 1 and T and 10 = 10 and path5_i63 < 10 and path5_i58 = 1 and 1 > 0)) or ((path6_i56 = path6_i60 and path6_i60 = path6_i62 and path6_i62 = path6_i64 and path6_i64 = path6_i65 and path6_i67 = (path6_i65 + 1) and path6_i67 = res_i56 and 1 = res_i57 and 1 = res_i58 and path6_i56 = initial_i56 and path6_i57 = initial_i57 and path6_i58 = initial_i58) and (path6_i60 > 0 and T and 1 = 1 and path6_i62 > 1 and T and 10 = 10 and path6_i64 > 10 and path6_i58 = 1 and 1 > 0))) and (((res1_i56 = res1_i60 and res1_i60 = res1_i62 and res1_i62 = res1_i63 and res1_i63 = res1_i65 and res1_i68 = (res1_i65 + -1) and res_i56 = res1_i56 and res_i57 = res1_i57 and res_i58 = res1_i58) and !(res1_i60 > 0 and T and 1 = 1 and res1_i62 > 1 and T and 10 = 10 and res1_i63 < 10 and res1_i58 = 0 and T)) and ((res2_i56 = res2_i60 and res2_i60 = res2_i62 and res2_i62 = res2_i64 and res2_i64 = res2_i65 and res2_i68 = (res2_i65 + -1) and res_i56 = res2_i56 and res_i57 = res2_i57 and res_i58 = res2_i58) and !(res2_i60 > 0 and T and 1 = 1 and res2_i62 > 1 and T and 10 = 10 and res2_i64 > 10 and res2_i58 = 0 and T)) and ((res3_i56 = res3_i60 and res_i56 = res3_i56 and res_i57 = res3_i57 and res_i58 = res3_i58) and !(res3_i60 > 0 and res3_i60 = 1 and res3_i60 = 1 and 1 = 1 and 1 > 0)) and ((res4_i56 = res4_i60 and res4_i60 = res4_i62 and res_i56 = res4_i56 and res_i57 = res4_i57 and res_i58 = res4_i58) and !(res4_i60 > 0 and T and 1 = 1 and res4_i62 > 1 and res4_i62 = 10 and res4_i62 = 10 and 10 = 10 and T)) and ((res5_i56 = res5_i60 and res5_i60 = res5_i62 and res5_i62 = res5_i63 and res5_i63 = res5_i65 and res5_i67 = (res5_i65 + 1) and res_i56 = res5_i56 and res_i57 = res5_i57 and res_i58 = res5_i58) and !(res5_i60 > 0 and T and 1 = 1 and res5_i62 > 1 and T and 10 = 10 and res5_i63 < 10 and res5_i58 = 1 and 1 > 0)) and ((res6_i56 = res6_i60 and res6_i60 = res6_i62 and res6_i62 = res6_i64 and res6_i64 = res6_i65 and res6_i67 = (res6_i65 + 1) and res_i56 = res6_i56 and res_i57 = res6_i57 and res_i58 = res6_i58) and !(res6_i60 > 0 and T and 1 = 1 and res6_i62 > 1 and T and 10 = 10 and res6_i64 > 10 and res6_i58 = 1 and 1 > 0))))) to be UNSAT. Consequently, the loop will not terminate. ---------------------------------------- (4) NO