Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919336
details
property
value
status
complete
benchmark
ListInt.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
Costa_Julia_09-recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.90204310417 seconds
cpu usage
4.199389285
max memory
2.16551424E8
stage attributes
key
value
output-size
4841
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.jar # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 161 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * A set of functions over lists of integers. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * Note that cyclicity is introduced by the statement * <tt>l1.tail.tail = l1</tt>. However, this is not enough to induce * non-termination in the program. If you instead uncomment the line * <tt>l0.tail.tail = l0</tt>, most of the calls cannot be proved to terminate * anymore. * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class ListInt { private int head; private ListInt tail; public static void main(String[] args) { ListInt l0 = new ListInt(5,new ListInt(6,null)); ListInt l1 = new ListInt(1,new ListInt(3,null)); l0.merge(l1); l1.tail.tail = l1; //l0.tail.tail = l0; l0.append(l1); l0.iter(); l0.reverseAcc(null); l0.reverse(); } public ListInt(int head, ListInt tail) { this.head = head; this.tail = tail; } private void iter() { if (tail != null) tail.iter(); } private ListInt append(ListInt other) { if (tail == null) return new ListInt(head,other); else return new ListInt(head,tail.append(other)); } private ListInt reverseAcc(ListInt acc) { if (tail == null) return new ListInt(head,acc); else return tail.reverseAcc(new ListInt(head,acc)); } private ListInt reverse() { if (tail == null) return this; else return tail.reverse().append(new ListInt(head,null)); } private ListInt merge(ListInt other) { if (other == null) return this; else if (head <= other.head) if (tail != null) return new ListInt(head,tail.merge(other)); else return new ListInt(head,other); else return new ListInt(other.head,merge(other.tail)); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199