Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571433
details
property
value
status
complete
benchmark
LessLeaves.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n113.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.26403689384 seconds
cpu usage
15.640699154
max memory
1.379155968E9
stage attributes
key
value
output-size
101236
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, 1637 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 7 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 94 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToQDPProof [SOUND, 215 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE (17) JBCTerminationSCC (18) SCCToIRSProof [SOUND, 186 ms] (19) IRSwT (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (21) IRSwT (22) IRSwTTerminationDigraphProof [EQUIVALENT, 172 ms] (23) IRSwT (24) IntTRSCompressionProof [EQUIVALENT, 0 ms] (25) IRSwT (26) TempFilterProof [SOUND, 52 ms] (27) IntTRS (28) PolynomialOrderProcessor [EQUIVALENT, 19 ms] (29) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class LessLeaves { // Checks if a binary tree // has less leaves than another one public static void main(String[] args) { Random.args = args; Tree tree1 = Tree.createTree(); Tree tree2 = Tree.createTree(); boolean b = less_leaves(tree1,tree2); } public static Tree append(Tree t1, Tree t2) { Tree t; if (t1 == null) return t2; else { t = t1; while (t.right != null) { t = t.right; } t.right = t2; return t1; } } public static boolean less_leaves(Tree t1, Tree t2) { while ((t1 != null) && (t2 != null)) { t1 = append(t1.left,t1.right); t2 = append(t2.left,t2.right); } if (t2 == null) return false; else return true; } } public class Random { static String[] args; static int index = 0; public static int random() {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode