Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315800
details
property
value
status
complete
benchmark
RunningPointers.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n044.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.77122 seconds
cpu usage
7.2645
user time
6.94437
system time
0.320133
max virtual memory
3.8449024E7
max residence set size
516556.0
stage attributes
key
value
starexec-result
YES
output
6.92/2.70 YES 6.92/2.71 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 6.92/2.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.92/2.71 6.92/2.71 6.92/2.71 termination of the given Bare JBC problem could be proven: 6.92/2.71 6.92/2.71 (0) Bare JBC problem 6.92/2.71 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 6.92/2.71 (2) JBC problem 6.92/2.71 (3) JBCToGraph [EQUIVALENT, 386 ms] 6.92/2.71 (4) JBCTerminationGraph 6.92/2.71 (5) TerminationGraphToSCCProof [SOUND, 8 ms] 6.92/2.71 (6) AND 6.92/2.71 (7) JBCTerminationSCC 6.92/2.71 (8) SCCToIRSProof [SOUND, 78 ms] 6.92/2.71 (9) IRSwT 6.92/2.71 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 6.92/2.71 (11) IRSwT 6.92/2.71 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] 6.92/2.71 (13) IRSwT 6.92/2.71 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] 6.92/2.71 (15) IRSwT 6.92/2.71 (16) TempFilterProof [SOUND, 15 ms] 6.92/2.71 (17) IntTRS 6.92/2.71 (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 6.92/2.71 (19) YES 6.92/2.71 (20) JBCTerminationSCC 6.92/2.71 (21) SCCToQDPProof [SOUND, 177 ms] 6.92/2.71 (22) QDP 6.92/2.71 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 6.92/2.71 (24) YES 6.92/2.71 6.92/2.71 6.92/2.71 ---------------------------------------- 6.92/2.71 6.92/2.71 (0) 6.92/2.71 Obligation: 6.92/2.71 need to prove termination of the following program: 6.92/2.71 public class ObjectList { 6.92/2.71 Object value; 6.92/2.71 ObjectList next; 6.92/2.71 6.92/2.71 public ObjectList(Object value, ObjectList next) { 6.92/2.71 this.value = value; 6.92/2.71 this.next = next; 6.92/2.71 } 6.92/2.71 6.92/2.71 public static ObjectList createList() { 6.92/2.71 ObjectList result = null; 6.92/2.71 int length = Random.random(); 6.92/2.71 while (length > 0) { 6.92/2.71 result = new ObjectList(new Object(), result); 6.92/2.71 length--; 6.92/2.71 } 6.92/2.71 return result; 6.92/2.71 } 6.92/2.71 } 6.92/2.71 6.92/2.71 6.92/2.71 public class Random { 6.92/2.71 static String[] args; 6.92/2.71 static int index = 0; 6.92/2.71 6.92/2.71 public static int random() { 6.92/2.71 String string = args[index]; 6.92/2.71 index++; 6.92/2.71 return string.length(); 6.92/2.71 } 6.92/2.71 } 6.92/2.71 6.92/2.71 6.92/2.71 /** 6.92/2.71 * Allegedly based on an interview question at Microsoft. 6.92/2.71 */ 6.92/2.71 public class RunningPointers { 6.92/2.71 6.92/2.71 public static boolean isCyclic(ObjectList l) { 6.92/2.71 if (l == null) { 6.92/2.71 return false; 6.92/2.71 } 6.92/2.71 ObjectList l1, l2; 6.92/2.71 l1 = l; 6.92/2.71 l2 = l.next; 6.92/2.71 while (l2 != null && l1 != l2) { 6.92/2.71 l2 = l2.next; 6.92/2.71 if (l2 == null) { 6.92/2.71 return false; 6.92/2.71 } 6.92/2.71 else if (l2 == l1) { 6.92/2.71 return true; 6.92/2.71 } 6.92/2.71 else { 6.92/2.71 l2 = l2.next; 6.92/2.71 } 6.92/2.71 l1 = l1.next; 6.92/2.71 } 6.92/2.71 return l2 != null; 6.92/2.71 } 6.92/2.71
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