Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315788
details
property
value
status
complete
benchmark
DuplicateNodes.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n160.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.17346 seconds
cpu usage
12.2734
user time
11.7735
system time
0.499952
max virtual memory
1.854684E7
max residence set size
849972.0
stage attributes
key
value
starexec-result
YES
output
12.03/4.11 YES 12.03/4.13 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 12.03/4.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.03/4.13 12.03/4.13 12.03/4.13 termination of the given Bare JBC problem could be proven: 12.03/4.13 12.03/4.13 (0) Bare JBC problem 12.03/4.13 (1) BareJBCToJBCProof [EQUIVALENT, 100 ms] 12.03/4.13 (2) JBC problem 12.03/4.13 (3) JBCToGraph [EQUIVALENT, 1001 ms] 12.03/4.13 (4) JBCTerminationGraph 12.03/4.13 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 12.03/4.13 (6) AND 12.03/4.13 (7) JBCTerminationSCC 12.03/4.13 (8) SCCToQDPProof [SOUND, 372 ms] 12.03/4.13 (9) QDP 12.03/4.13 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.03/4.13 (11) YES 12.03/4.13 (12) JBCTerminationSCC 12.03/4.13 (13) SCCToIRSProof [SOUND, 307 ms] 12.03/4.13 (14) IRSwT 12.03/4.13 (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 12.03/4.13 (16) IRSwT 12.03/4.13 (17) IRSwTTerminationDigraphProof [EQUIVALENT, 112 ms] 12.03/4.13 (18) IRSwT 12.03/4.13 (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] 12.03/4.13 (20) IRSwT 12.03/4.13 (21) TempFilterProof [SOUND, 16 ms] 12.03/4.13 (22) IntTRS 12.03/4.13 (23) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 12.03/4.13 (24) YES 12.03/4.13 12.03/4.13 12.03/4.13 ---------------------------------------- 12.03/4.13 12.03/4.13 (0) 12.03/4.13 Obligation: 12.03/4.13 need to prove termination of the following program: 12.03/4.13 public class DuplicateNodes { 12.03/4.13 public static void main(String[] args) { 12.03/4.13 Random.args = args; 12.03/4.13 Tree tree = Tree.createTree(); 12.03/4.13 12.03/4.13 randomlyDuplicate(tree); 12.03/4.13 } 12.03/4.13 12.03/4.13 public static void randomlyDuplicate(Tree tree) { 12.03/4.13 Tree cur = tree; 12.03/4.13 12.03/4.13 while (cur != null) { 12.03/4.13 if (Random.random() > 42) { 12.03/4.13 cur.right = new Tree(cur.left, cur.right); 12.03/4.13 cur = cur.left; 12.03/4.13 } else { 12.03/4.13 cur.left = new Tree(cur.left, cur.right); 12.03/4.13 cur = cur.right; 12.03/4.13 } 12.03/4.13 } 12.03/4.13 } 12.03/4.13 } 12.03/4.13 12.03/4.13 12.03/4.13 public class List { 12.03/4.13 Tree value; 12.03/4.13 List next; 12.03/4.13 12.03/4.13 public List(Tree value, List next) { 12.03/4.13 this.value = value; 12.03/4.13 this.next = next; 12.03/4.13 } 12.03/4.13 } 12.03/4.13 12.03/4.13 12.03/4.13 public class Random { 12.03/4.13 static String[] args; 12.03/4.13 static int index = 0; 12.03/4.13 12.03/4.13 public static int random() { 12.03/4.13 String string = args[index]; 12.03/4.13 index++; 12.03/4.13 return string.length(); 12.03/4.13 } 12.03/4.13 } 12.03/4.13 12.03/4.13 12.03/4.13 public class Tree { 12.03/4.13 Tree left; 12.03/4.13 Tree right; 12.03/4.13 Object value; 12.03/4.13 12.03/4.13 public Tree(Tree l, Tree r) { 12.03/4.13 this.left = l; 12.03/4.13 this.right = r; 12.03/4.13 } 12.03/4.13 12.03/4.13 public Tree() { 12.03/4.13 } 12.03/4.13 12.03/4.13 public static Tree createNode() {
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