Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919366
details
property
value
status
complete
benchmark
LessLeavesRec.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
BOG_RTA_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.17536187172 seconds
cpu usage
29.490966731
max memory
2.794573824E9
stage attributes
key
value
output-size
422057
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, 3840 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 4 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 210 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToQDPProof [SOUND, 907 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE (17) JBCTerminationSCC (18) SCCToIRSProof [SOUND, 366 ms] (19) IRSwT (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (21) IRSwT (22) IRSwTTerminationDigraphProof [EQUIVALENT, 919 ms] (23) IRSwT (24) IntTRSCompressionProof [EQUIVALENT, 0 ms] (25) IRSwT (26) TempFilterProof [SOUND, 406 ms] (27) IntTRS (28) PolynomialOrderProcessor [EQUIVALENT, 36 ms] (29) AND (30) IntTRS (31) PolynomialOrderProcessor [EQUIVALENT, 16 ms] (32) IntTRS (33) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (34) IntTRS (35) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (36) IntTRS (37) RankingReductionPairProof [EQUIVALENT, 0 ms] (38) YES (39) IntTRS (40) PolynomialOrderProcessor [EQUIVALENT, 17 ms] (41) IntTRS (42) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (43) IntTRS (44) RankingReductionPairProof [EQUIVALENT, 0 ms] (45) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package LessLeavesRec; public class LessLeavesRec { public static Tree append(Tree x, Tree y) { // adds y to the right bottom of x if (x == null) return y; else return new Tree(x.l, append(x.r,y)); } // checks whether one tree has less leaves than the other public static boolean lessleaves(Tree x, Tree y){ if (y == null) { return false; } else { if (x == null) { return true; } else { return lessleaves(append(x.l,x.r), append(y.l,y.r)); } } } public static void main(String[] args) { Random.args = args; Tree x = Tree.createTree(); Tree y = Tree.createTree(); boolean b = lessleaves(x,y); } } package LessLeavesRec; public class Random { static String[] args;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199