/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 76 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: package ArrayObjects; public class ArrayObjects { public static void main(String[] argv) { Object obj0 = new Object(); Object obj1 = new Object(); Object obj2 = new Object(); Object[] data = {obj0, obj1, obj2}; while (data[0] != obj0); while (data[1] != obj1); while (data[2] != obj2); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package ArrayObjects; public class ArrayObjects { public static void main(String[] argv) { Object obj0 = new Object(); Object obj1 = new Object(); Object obj2 = new Object(); Object[] data = {obj0, obj1, obj2}; while (data[0] != obj0); while (data[1] != obj1); while (data[2] != obj2); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: ArrayObjects.ArrayObjects.main([Ljava/lang/String;)V: Graph of 44 nodes with 0 SCCs. ---------------------------------------- (5) TerminationGraphToSCCProof (SOUND) Proven termination by absence of SCCs ---------------------------------------- (6) TRUE