Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919255
details
property
value
status
complete
benchmark
SharingAnalysis.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
AProVE_11_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.90688490868 seconds
cpu usage
7.562004429
max memory
3.75566336E8
stage attributes
key
value
output-size
21058
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, 379 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 134 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToIRSProof [SOUND, 84 ms] (14) IRSwT (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 19 ms] (18) IRSwT (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IRSwT (21) TempFilterProof [SOUND, 22 ms] (22) IntTRS (23) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (24) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package SharingAnalysis; public class Random { static String[] args; static int index = 0; public static int random() { final String string = args[index]; index++; return string.length(); } } package SharingAnalysis; public class SharingAnalysis { int val; SharingAnalysis field; public static void main(String[] args) { Random.args = args; SharingAnalysis t1 = new SharingAnalysis(); SharingAnalysis t2 = t1.appendNewList(1); SharingAnalysis t3 = t2.appendNewList(Random.random()); t2.field = null; copy(t1, t3); } public static void copy(SharingAnalysis source, SharingAnalysis target) { while (source != null) { SharingAnalysis newEle = new SharingAnalysis(); newEle.val = source.val; target.field = newEle; source = source.field; target = target.field; } } /** * @param i number of elements to append * @return the last list element appended */ private SharingAnalysis appendNewList(int i) { this.field = new SharingAnalysis(); SharingAnalysis cur = this.field; while (i > 1) { i--; cur = cur.field = new SharingAnalysis(); } return cur; } }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199