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	n036.star.cs.uiowa.edu
space	AProVE_10_iterative

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.46633 seconds
cpu usage	13.6527
user time	13.0312
system time	0.621465
max virtual memory	1.8614652E7
max residence set size	1025804.0

stage attributes

key	value
starexec-result	YES

output

13.49/4.40 YES 13.49/4.42 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 13.49/4.42 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.49/4.42 13.49/4.42 13.49/4.42 termination of the given Bare JBC problem could be proven: 13.49/4.42 13.49/4.42 (0) Bare JBC problem 13.49/4.42 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 13.49/4.42 (2) JBC problem 13.49/4.42 (3) JBCToGraph [EQUIVALENT, 1160 ms] 13.49/4.42 (4) JBCTerminationGraph 13.49/4.42 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 13.49/4.42 (6) AND 13.49/4.42 (7) JBCTerminationSCC 13.49/4.42 (8) SCCToQDPProof [SOUND, 470 ms] 13.49/4.42 (9) QDP 13.49/4.42 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.49/4.42 (11) YES 13.49/4.42 (12) JBCTerminationSCC 13.49/4.42 (13) SCCToIRSProof [SOUND, 347 ms] 13.49/4.42 (14) IRSwT 13.49/4.42 (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 13.49/4.42 (16) IRSwT 13.49/4.42 (17) IRSwTTerminationDigraphProof [EQUIVALENT, 174 ms] 13.49/4.42 (18) IRSwT 13.49/4.42 (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] 13.49/4.42 (20) IRSwT 13.49/4.42 (21) TempFilterProof [SOUND, 17 ms] 13.49/4.42 (22) IntTRS 13.49/4.42 (23) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 13.49/4.42 (24) YES 13.49/4.42 13.49/4.42 13.49/4.42 ---------------------------------------- 13.49/4.42 13.49/4.42 (0) 13.49/4.42 Obligation: 13.49/4.42 need to prove termination of the following program: 13.49/4.42 public class DuplicateTreePath { 13.49/4.42 public static void main(String[] args) { 13.49/4.42 Random.args = args; 13.49/4.42 Tree t = Tree.createTree(); 13.49/4.42 duplicateRandomPath(t); 13.49/4.42 } 13.49/4.42 13.49/4.42 public static void duplicateRandomPath(Tree tree) { 13.49/4.42 Tree cur = tree; 13.49/4.42 while (cur != null) { 13.49/4.42 if (Random.random() < 42 && cur.left != null) { //go left 13.49/4.42 Tree t = new Tree(cur.left, cur.right); 13.49/4.42 t.value = cur.value; 13.49/4.42 cur.right = null; 13.49/4.42 cur.left = t; 13.49/4.42 cur = cur.left.left; 13.49/4.42 } else if (cur.right != null) { //go right 13.49/4.42 Tree t = new Tree(cur.left, cur.right); 13.49/4.42 t.value = cur.value; 13.49/4.42 cur.left = null; 13.49/4.42 cur.right = t; 13.49/4.42 cur = cur.right.right; 13.49/4.42 } else { 13.49/4.42 break; 13.49/4.42 } 13.49/4.42 } 13.49/4.42 } 13.49/4.42 } 13.49/4.42 13.49/4.42 13.49/4.42 public class Random { 13.49/4.42 static String[] args; 13.49/4.42 static int index = 0; 13.49/4.42 13.49/4.42 public static int random() { 13.49/4.42 String string = args[index]; 13.49/4.42 index++; 13.49/4.42 return string.length(); 13.49/4.42 } 13.49/4.42 } 13.49/4.42 13.49/4.42 13.49/4.42 public class Tree { 13.49/4.42 Tree left; 13.49/4.42 Tree right; 13.49/4.42 Object value; 13.49/4.42 13.49/4.42 public Tree(Tree l, Tree r) { 13.49/4.42 this.left = l; 13.49/4.42 this.right = r; 13.49/4.42 } 13.49/4.42 13.49/4.42 public Tree() { 13.49/4.42 } 13.49/4.42 13.49/4.42 public static Tree createNode() { 13.49/4.42 Tree result = new Tree(); 13.49/4.42 result.value = new Object(); 13.49/4.42 return result; 13.49/4.42 } 13.49/4.42 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Java_Bytecode 2019-04-01 06.50