Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919451
details
property
value
status
complete
benchmark
IntListSumRec.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
BOG_RTA_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.32659721375 seconds
cpu usage
9.533416349
max memory
7.0316032E8
stage attributes
key
value
output-size
42507
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 518 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 213 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToIRSProof [SOUND, 103 ms] (14) IRSwT (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 9 ms] (18) IRSwT (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IRSwT (21) TempFilterProof [SOUND, 31 ms] (22) IntTRS (23) PolynomialOrderProcessor [EQUIVALENT, 16 ms] (24) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package IntListSumRec; public class IntListSumRec { public static void main(String[] args) { Random.args = args; List l = List.createList(Random.random()); int sum = l.sumList(); } } class List { int value; List next; public List(int v, List n) { this.value = v; this.next = n; } public int sumList() { if (this.next == null) { return this.value; } else { int firstTwo = this.value + this.next.value; List nextNext = this.next.next; List shorter = new List(firstTwo, nextNext); return shorter.sumList(); } } public static List createList(int l) { if (l < 0) { return null; } else { return new List(Random.random(), createList(l - 1)); } } } class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199