/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 122 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * A loop whose termination depends on a break statement. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * @author Fausto Spoto */ public class Break { public static void main(String[] args) { int i = 0; while (true) { if (i > 10) break; i++; } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: /** * A loop whose termination depends on a break statement. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * @author Fausto Spoto */ public class Break { public static void main(String[] args) { int i = 0; while (true) { if (i > 10) break; i++; } } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: Break.main([Ljava/lang/String;)V: Graph of 63 nodes with 0 SCCs. ---------------------------------------- (5) TerminationGraphToSCCProof (SOUND) Proven termination by absence of SCCs ---------------------------------------- (6) TRUE