Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919456
details
property
value
status
complete
benchmark
Count.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
BOG_RTA_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.65369510651 seconds
cpu usage
22.721824462
max memory
1.548099584E9
stage attributes
key
value
output-size
332526
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 2094 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 519 ms] (9) QDP (10) UsableRulesReductionPairsProof [EQUIVALENT, 55 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) JBCTerminationSCC (15) SCCToQDPProof [SOUND, 531 ms] (16) QDP (17) DependencyGraphProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) JBCTerminationSCC (22) SCCToIRSProof [SOUND, 346 ms] (23) IRSwT (24) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (25) IRSwT (26) IRSwTTerminationDigraphProof [EQUIVALENT, 1056 ms] (27) IRSwT (28) IntTRSCompressionProof [EQUIVALENT, 0 ms] (29) IRSwT (30) TempFilterProof [SOUND, 322 ms] (31) IntTRS (32) PolynomialOrderProcessor [EQUIVALENT, 25 ms] (33) AND (34) IntTRS (35) PolynomialOrderProcessor [EQUIVALENT, 16 ms] (36) IntTRS (37) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (38) IntTRS (39) RankingReductionPairProof [EQUIVALENT, 0 ms] (40) YES (41) IntTRS (42) RankingReductionPairProof [EQUIVALENT, 31 ms] (43) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Count { public static int count(Tree x) { // counts the number of inner nodes in the tree x if (x == null) return 0; if (x.l == null) return 1 + count(x.r); else return count(Flatten.flatten(x)); } public static void main(String[] args) { Random.args = args; Tree x = Tree.createTree(); Tree y = Flatten.flatten(x); count(x); } } public class Flatten { public static Tree flatten(Tree x) { if (x == null) return null; if (x.l == null) return new Tree(null, flatten(x.r)); else return flatten(new Tree(x.l.l, new Tree(x.l.r, x.r))); } public static void main(String[] args) { Random.args = args; Tree x = Tree.createTree(); Tree y = flatten(x); } }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199