Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919271
details
property
value
status
complete
benchmark
Alternate.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
BOG_RTA_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.98203992844 seconds
cpu usage
21.814883585
max memory
2.399133696E9
stage attributes
key
value
output-size
341535
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, 1864 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 13 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 416 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToQDPProof [SOUND, 473 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE (17) JBCTerminationSCC (18) SCCToIRSProof [SOUND, 312 ms] (19) IRSwT (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (21) IRSwT (22) IRSwTTerminationDigraphProof [EQUIVALENT, 832 ms] (23) IRSwT (24) IntTRSCompressionProof [EQUIVALENT, 0 ms] (25) IRSwT (26) TempFilterProof [SOUND, 376 ms] (27) IntTRS (28) PolynomialOrderProcessor [EQUIVALENT, 61 ms] (29) AND (30) IntTRS (31) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (32) IntTRS (33) PolynomialOrderProcessor [EQUIVALENT, 15 ms] (34) IntTRS (35) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (36) IntTRS (37) RankingReductionPairProof [EQUIVALENT, 0 ms] (38) YES (39) IntTRS (40) RankingReductionPairProof [EQUIVALENT, 0 ms] (41) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package Alternate; public class Alternate { public static Tree alternate(final Tree t, final Tree s) { // from (Dershowitz & Jouannaud 90, p. 253) if (t == null) { return Tree.copy(s); } else { return new Tree(Tree.copy(t.left), alternate(s, t.right)); } } public static void main(final String[] args) { Random.args = args; final Tree t = Tree.createTree(); final Tree s = Tree.createTree(); alternate(t, s); } } package Alternate; public class Random { static String[] args; static int index = 0; public static int random() { if (args.length <= index) { return 0; } final String string = args[index]; index++; if (string == null) { return 0;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199