Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919446
details
property
value
status
complete
benchmark
MirrorBinTreeRec.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
BOG_RTA_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.3043088913 seconds
cpu usage
19.982160545
max memory
2.032594944E9
stage attributes
key
value
output-size
232395
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, 1350 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 383 ms] (9) QDP (10) QDPOrderProof [EQUIVALENT, 11 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) JBCTerminationSCC (15) SCCToIRSProof [SOUND, 281 ms] (16) IRSwT (17) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (18) IRSwT (19) IRSwTTerminationDigraphProof [EQUIVALENT, 785 ms] (20) IRSwT (21) IntTRSCompressionProof [EQUIVALENT, 0 ms] (22) IRSwT (23) TempFilterProof [SOUND, 391 ms] (24) IntTRS (25) PolynomialOrderProcessor [EQUIVALENT, 54 ms] (26) AND (27) IntTRS (28) PolynomialOrderProcessor [EQUIVALENT, 28 ms] (29) IntTRS (30) RankingReductionPairProof [EQUIVALENT, 30 ms] (31) YES (32) IntTRS (33) PolynomialOrderProcessor [EQUIVALENT, 18 ms] (34) IntTRS (35) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (36) IntTRS (37) RankingReductionPairProof [EQUIVALENT, 0 ms] (38) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package MirrorBinTreeRec; /** * Mirror a binary tree * @author cotto */ public class MirrorBinTreeRec { public static void main(final String[] args) { Random.args = args; final Tree tree = Tree.createTree(); mirror(tree); } public static void mirror(final Tree tree) { if (tree == null) { return; } final Tree temp = tree.right; tree.right = tree.left; tree.left = temp; mirror(tree.left); mirror(tree.right); } } package MirrorBinTreeRec; 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; } return string.length();
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199