Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571456
details
property
value
status
complete
benchmark
Exc.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
Costa_Julia_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.12282919884 seconds
cpu usage
4.254694957
max memory
3.0752768E8
stage attributes
key
value
output-size
3301
starexec-result
YES
output
/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 186 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * A loop that might potentially throw a <tt>NullPointerException</tt> * because of the instance field access <tt>exc.f</tt>. If that happened, * the loop would diverge since the exception handler does not include any * progress statement. However, Julia can prove that <tt>exc</tt> is not * <tt>null</tt> at the point where <tt>exc.f</tt> is accessed, so that * no exception can be thrown there. Hence the loop is proved to terminate. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate. * * Note: without a preliminary nullness analysis, termination could not * be proved. * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Exc { private int f; public static void main(String[] args) { Exc exc = new Exc(); int i = 0; while (i < 20) { try { if (i > 10) exc.f = 5; i += 2; } catch (NullPointerException e) { } } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: /** * A loop that might potentially throw a <tt>NullPointerException</tt> * because of the instance field access <tt>exc.f</tt>. If that happened, * the loop would diverge since the exception handler does not include any * progress statement. However, Julia can prove that <tt>exc</tt> is not * <tt>null</tt> at the point where <tt>exc.f</tt> is accessed, so that * no exception can be thrown there. Hence the loop is proved to terminate. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate. * * Note: without a preliminary nullness analysis, termination could not * be proved. * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Exc { private int f; public static void main(String[] args) { Exc exc = new Exc(); int i = 0; while (i < 20) { try {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode