Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919387
details
property
value
status
complete
benchmark
BTree.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
Costa_Julia_09-recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.13755989075 seconds
cpu usage
4.912660329
max memory
3.61271296E8
stage attributes
key
value
output-size
2905
starexec-result
YES
output
/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, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 330 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * A program that creates a binary tree of arbitrary height and then * computes that height with a recursive descent on the tree. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class BTree { private BTree left, right; public BTree(int height) { if (height > 1) { this.left = new BTree(height - 1); this.right = new BTree(height - 1); } } public int height() { if (left == null && right == null) return 1; else if (left == null) return 1 + right.height(); else return 1 + left.height(); } public static void main(String[] args) { BTree bt = new BTree(5); bt.height(); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: /** * A program that creates a binary tree of arbitrary height and then * computes that height with a recursive descent on the tree. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class BTree { private BTree left, right; public BTree(int height) { if (height > 1) { this.left = new BTree(height - 1); this.right = new BTree(height - 1); } } public int height() { if (left == null && right == null) return 1; else if (left == null) return 1 + right.height(); else return 1 + left.height(); } public static void main(String[] args) { BTree bt = new BTree(5);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199