Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571552
details
property
value
status
complete
benchmark
DuplicateTreePath.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n107.star.cs.uiowa.edu
space
AProVE_10_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.65078186989 seconds
cpu usage
15.743568406
max memory
1.166385152E9
stage attributes
key
value
output-size
137465
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: 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, 1189 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 560 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToIRSProof [SOUND, 390 ms] (14) IRSwT (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 145 ms] (18) IRSwT (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IRSwT (21) TempFilterProof [SOUND, 25 ms] (22) IntTRS (23) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (24) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class DuplicateTreePath { public static void main(String[] args) { Random.args = args; Tree t = Tree.createTree(); duplicateRandomPath(t); } public static void duplicateRandomPath(Tree tree) { Tree cur = tree; while (cur != null) { if (Random.random() < 42 && cur.left != null) { //go left Tree t = new Tree(cur.left, cur.right); t.value = cur.value; cur.right = null; cur.left = t; cur = cur.left.left; } else if (cur.right != null) { //go right Tree t = new Tree(cur.left, cur.right); t.value = cur.value; cur.left = null; cur.right = t; cur = cur.right.right; } else { break; } } } } public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } public class Tree { Tree left; Tree right; Object value; public Tree(Tree l, Tree r) { this.left = l; this.right = r; } public Tree() { }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode