details

property	value
status	complete
benchmark	CyclicList.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	AProVE_10_iterative

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.83953 seconds
cpu usage	7.15066
user time	6.74915
system time	0.401507
max virtual memory	2.0410288E7
max residence set size	547564.0

stage attributes

key	value
starexec-result	YES

output

6.86/2.76 YES 6.86/2.78 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 6.86/2.78 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.86/2.78 6.86/2.78 6.86/2.78 termination of the given Bare JBC problem could be proven: 6.86/2.78 6.86/2.78 (0) Bare JBC problem 6.86/2.78 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 6.86/2.78 (2) JBC problem 6.86/2.78 (3) JBCToGraph [EQUIVALENT, 273 ms] 6.86/2.78 (4) JBCTerminationGraph 6.86/2.78 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 6.86/2.78 (6) AND 6.86/2.78 (7) JBCTerminationSCC 6.86/2.78 (8) SCCToIRSProof [SOUND, 32 ms] 6.86/2.78 (9) IRSwT 6.86/2.78 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 6.86/2.78 (11) IRSwT 6.86/2.78 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 44 ms] 6.86/2.78 (13) AND 6.86/2.78 (14) IRSwT 6.86/2.78 (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] 6.86/2.78 (16) IRSwT 6.86/2.78 (17) TempFilterProof [SOUND, 8 ms] 6.86/2.78 (18) IntTRS 6.86/2.78 (19) RankingReductionPairProof [EQUIVALENT, 0 ms] 6.86/2.78 (20) YES 6.86/2.78 (21) IRSwT 6.86/2.78 (22) IntTRSCompressionProof [EQUIVALENT, 0 ms] 6.86/2.78 (23) IRSwT 6.86/2.78 (24) TempFilterProof [SOUND, 13 ms] 6.86/2.78 (25) IntTRS 6.86/2.78 (26) RankingReductionPairProof [EQUIVALENT, 7 ms] 6.86/2.78 (27) YES 6.86/2.78 (28) JBCTerminationSCC 6.86/2.78 (29) SCCToIRSProof [SOUND, 63 ms] 6.86/2.78 (30) IRSwT 6.86/2.78 (31) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 6.86/2.78 (32) IRSwT 6.86/2.78 (33) IRSwTTerminationDigraphProof [EQUIVALENT, 19 ms] 6.86/2.78 (34) IRSwT 6.86/2.78 (35) IntTRSCompressionProof [EQUIVALENT, 0 ms] 6.86/2.78 (36) IRSwT 6.86/2.78 (37) TempFilterProof [SOUND, 37 ms] 6.86/2.78 (38) IntTRS 6.86/2.78 (39) PolynomialOrderProcessor [EQUIVALENT, 13 ms] 6.86/2.78 (40) YES 6.86/2.78 6.86/2.78 6.86/2.78 ---------------------------------------- 6.86/2.78 6.86/2.78 (0) 6.86/2.78 Obligation: 6.86/2.78 need to prove termination of the following program: 6.86/2.78 /** 6.86/2.78 * This class represents a list. The function get(n) can be used to access 6.86/2.78 * the n-th element. 6.86/2.78 * @author Marc Brockschmidt 6.86/2.78 */ 6.86/2.78 public class CyclicList { 6.86/2.78 /** 6.86/2.78 * A reference to the next list element. 6.86/2.78 */ 6.86/2.78 private CyclicList next; 6.86/2.78 6.86/2.78 public static void main(String[] args) { 6.86/2.78 CyclicList list = CyclicList.create(args.length); 6.86/2.78 list.get(args[0].length()); 6.86/2.78 } 6.86/2.78 6.86/2.78 /** 6.86/2.78 * Create a new list element. 6.86/2.78 * @param n a reference to the next element. 6.86/2.78 */ 6.86/2.78 public CyclicList(final CyclicList n) { 6.86/2.78 this.next = n; 6.86/2.78 } 6.86/2.78 6.86/2.78 /** 6.86/2.78 * Create a new cyclical list of a length l. 6.86/2.78 * @param l some length 6.86/2.78 * @return cyclical list of length max(1, l) 6.86/2.78 */ 6.86/2.78 public static CyclicList create(int x) { 6.86/2.78 CyclicList last, current; 6.86/2.78 last = current = new CyclicList(null); 6.86/2.78 while (--x > 0) 6.86/2.78 current = new CyclicList(current); 6.86/2.78 return last.next = current; 6.86/2.78 } 6.86/2.78 6.86/2.78 public CyclicList get(int n) { 6.86/2.78 CyclicList cur = this; 6.86/2.78 while (--n > 0) { 6.86/2.78 cur = cur.next; 6.86/2.78 } 6.86/2.78 return cur; 6.86/2.78 } 6.86/2.78 } 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