/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, 252 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.marbie1; public class Main { /** * @param args */ public static void main(String[] args) { Marbie1.loop(args.length); } } package simple.marbie1; /* source: http://marble.sru.edu/~mxm4333/loop/page_03.html */ public class Marbie1 { public static void loop(int i) { /* * for(i=4; i>2; i++) * alert("This is an infinite loop."); */ while (i > 2) { i++; } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.marbie1; public class Main { /** * @param args */ public static void main(String[] args) { Marbie1.loop(args.length); } } package simple.marbie1; /* source: http://marble.sru.edu/~mxm4333/loop/page_03.html */ public class Marbie1 { public static void loop(int i) { /* * for(i=4; i>2; i++) * alert("This is an infinite loop."); */ while (i > 2) { i++; } } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0: a10([java.lang.String...]): length 3 -->{java.lang.Object...} YES: (JL1) 1: a10([java.lang.String...]): length 3 -->{java.lang.Object...} YES: (JL1) 2: YES: (JL1) 3: YES: (JL1) Start state of loop: [a4(lv_0_0)] i14: [0,+inf)(l1) i15: [0,+inf)(l1) a4([java.lang.String...]): length i15 -->{java.lang.Object...} YES: (JL1) In the loop head node, references [i14] 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_i14 and 0 <= initial_i15) and (((path1_i14 = path1_i24 and path1_i27 = (path1_i24 + 1) and path1_i27 = res_i14 and path1_i14 = initial_i14) and (T and 2 = 2 and path1_i24 > 2)) and ((res1_i14 = res1_i24 and res1_i27 = (res1_i24 + 1) and res_i14 = res1_i14) and !(T and 2 = 2 and res1_i24 > 2)))) to be UNSAT. Consequently, the loop will not terminate. ---------------------------------------- (4) NO