/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, 96 ms] (2) JBC problem (3) JBCNonTerm [COMPLETE, 244 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.complInterv3; public class ComplInterv3 { public static void loop(int i) { while (i != 0) { if (i > 5) { i++; } else { if (i < -5) { i--; } else { i = 0; } } } } } package simple.complInterv3; public class Main { /** * @param args */ public static void main(String[] args) { ComplInterv3.loop(args.length); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.complInterv3; public class ComplInterv3 { public static void loop(int i) { while (i != 0) { if (i > 5) { i++; } else { if (i < -5) { i--; } else { i = 0; } } } } } package simple.complInterv3; public class Main { /** * @param args */ public static void main(String[] args) { ComplInterv3.loop(args.length); } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0: a10([java.lang.String...]): length 6 -->{java.lang.Object...} YES: (JL1) 1: a10([java.lang.String...]): length 6 -->{java.lang.Object...} YES: (JL1) 2: YES: (JL1) 3: YES: (JL1) Start state of loop: [a4(lv_0_0)] i15: [0,+inf)(l1) i16: [0,+inf)(l1) a4([java.lang.String...]): length i16 -->{java.lang.Object...} YES: (JL1) In the loop head node, references [i15] 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_i15 and 0 <= initial_i16) and (((path1_i15 = path1_i23 and path1_i23 = path1_i28 and path1_i31 = (path1_i28 + 1) and path1_i31 = res_i15 and path1_i15 = initial_i15) and (path1_i23 > 0 and T and 5 = 5 and path1_i28 > 5)) and ((res1_i15 = res1_i23 and res1_i23 = res1_i28 and res1_i31 = (res1_i28 + 1) and res_i15 = res1_i15) and !(res1_i23 > 0 and T and 5 = 5 and res1_i28 > 5)))) to be UNSAT. Consequently, the loop will not terminate. ---------------------------------------- (4) NO