Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315818
details
property
value
status
complete
benchmark
TreeLeftmostPath.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n105.star.cs.uiowa.edu
space
AProVE_11_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.25351 seconds
cpu usage
12.9346
user time
12.3339
system time
0.600735
max virtual memory
1.8615684E7
max residence set size
1022248.0
stage attributes
key
value
starexec-result
YES
output
12.50/4.16 YES 12.50/4.18 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 12.50/4.18 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.50/4.18 12.50/4.18 12.50/4.18 termination of the given Bare JBC problem could be proven: 12.50/4.18 12.50/4.18 (0) Bare JBC problem 12.50/4.18 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 12.50/4.18 (2) JBC problem 12.50/4.18 (3) JBCToGraph [EQUIVALENT, 966 ms] 12.50/4.18 (4) JBCTerminationGraph 12.50/4.18 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 12.50/4.18 (6) AND 12.50/4.18 (7) JBCTerminationSCC 12.50/4.18 (8) SCCToIRSProof [SOUND, 257 ms] 12.50/4.18 (9) IRSwT 12.50/4.18 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 12.50/4.18 (11) IRSwT 12.50/4.18 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 354 ms] 12.50/4.18 (13) IRSwT 12.50/4.18 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] 12.50/4.18 (15) IRSwT 12.50/4.18 (16) TempFilterProof [SOUND, 19 ms] 12.50/4.18 (17) IntTRS 12.50/4.18 (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 12.50/4.18 (19) YES 12.50/4.18 (20) JBCTerminationSCC 12.50/4.18 (21) SCCToQDPProof [SOUND, 386 ms] 12.50/4.18 (22) QDP 12.50/4.18 (23) MRRProof [EQUIVALENT, 12 ms] 12.50/4.18 (24) QDP 12.50/4.18 (25) PisEmptyProof [EQUIVALENT, 0 ms] 12.50/4.18 (26) YES 12.50/4.18 12.50/4.18 12.50/4.18 ---------------------------------------- 12.50/4.18 12.50/4.18 (0) 12.50/4.18 Obligation: 12.50/4.18 need to prove termination of the following program: 12.50/4.18 package TreeLeftmostPath; 12.50/4.18 12.50/4.18 public class ObjectList { 12.50/4.18 Object value; 12.50/4.18 ObjectList next; 12.50/4.18 12.50/4.18 public ObjectList(Object value, ObjectList next) { 12.50/4.18 this.value = value; 12.50/4.18 this.next = next; 12.50/4.18 } 12.50/4.18 12.50/4.18 public static ObjectList createList() { 12.50/4.18 ObjectList result = null; 12.50/4.18 int length = Random.random(); 12.50/4.18 while (length > 0) { 12.50/4.18 result = new ObjectList(new Object(), result); 12.50/4.18 length--; 12.50/4.18 } 12.50/4.18 return result; 12.50/4.18 } 12.50/4.18 } 12.50/4.18 12.50/4.18 12.50/4.18 12.50/4.18 package TreeLeftmostPath; 12.50/4.18 12.50/4.18 public class Random { 12.50/4.18 static String[] args; 12.50/4.18 static int index = 0; 12.50/4.18 12.50/4.18 public static int random() { 12.50/4.18 String string = args[index]; 12.50/4.18 index++; 12.50/4.18 return string.length(); 12.50/4.18 } 12.50/4.18 } 12.50/4.18 12.50/4.18 12.50/4.18 package TreeLeftmostPath; 12.50/4.18 12.50/4.18 public class Tree { 12.50/4.18 Tree left; 12.50/4.18 Tree right; 12.50/4.18 Object value; 12.50/4.18 12.50/4.18 public Tree(Tree l, Tree r) { 12.50/4.18 this.left = l; 12.50/4.18 this.right = r; 12.50/4.18 } 12.50/4.18 12.50/4.18 public Tree() { 12.50/4.18 } 12.50/4.18 12.50/4.18 public static Tree createNode() { 12.50/4.18 Tree result = new Tree(); 12.50/4.18 result.value = new Object(); 12.50/4.18 return result; 12.50/4.18 } 12.50/4.18
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