details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.031 seconds
cpu usage	7.70924
user time	7.29744
system time	0.411795
max virtual memory	2.101142E7
max residence set size	591404.0

stage attributes

key	value
starexec-result	YES

output

7.37/2.94 YES 7.37/2.96 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 7.37/2.96 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 7.37/2.96 7.37/2.96 7.37/2.96 termination of the given Bare JBC problem could be proven: 7.37/2.96 7.37/2.96 (0) Bare JBC problem 7.37/2.96 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 7.37/2.96 (2) JBC problem 7.37/2.96 (3) JBCToGraph [EQUIVALENT, 322 ms] 7.37/2.96 (4) JBCTerminationGraph 7.37/2.96 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 7.37/2.96 (6) AND 7.37/2.96 (7) JBCTerminationSCC 7.37/2.96 (8) SCCToIRSProof [SOUND, 85 ms] 7.37/2.96 (9) IRSwT 7.37/2.96 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 7.37/2.96 (11) IRSwT 7.37/2.96 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 19 ms] 7.37/2.96 (13) IRSwT 7.37/2.96 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] 7.37/2.96 (15) IRSwT 7.37/2.96 (16) TempFilterProof [SOUND, 36 ms] 7.37/2.96 (17) IntTRS 7.37/2.96 (18) RankingReductionPairProof [EQUIVALENT, 19 ms] 7.37/2.96 (19) YES 7.37/2.96 (20) JBCTerminationSCC 7.37/2.96 (21) SCCToQDPProof [SOUND, 250 ms] 7.37/2.96 (22) QDP 7.37/2.96 (23) MRRProof [EQUIVALENT, 8 ms] 7.37/2.96 (24) QDP 7.37/2.96 (25) PisEmptyProof [EQUIVALENT, 0 ms] 7.37/2.96 (26) YES 7.37/2.96 7.37/2.96 7.37/2.96 ---------------------------------------- 7.37/2.96 7.37/2.96 (0) 7.37/2.96 Obligation: 7.37/2.96 need to prove termination of the following program: 7.37/2.96 package AlternatingGrowReduce2; 7.37/2.96 7.37/2.96 public class AlternatingGrowReduce2 { 7.37/2.96 AlternatingGrowReduce2 next; 7.37/2.96 7.37/2.96 public static void main(String[] argv) { 7.37/2.96 Random.args = argv; 7.37/2.96 AlternatingGrowReduce2 list = createList(Random.random()); 7.37/2.96 7.37/2.96 int mode = 0; 7.37/2.96 while (list != null) { 7.37/2.96 if (mode == 0) { 7.37/2.96 list = list.next; 7.37/2.96 } else if (mode == 1) { 7.37/2.96 list = new AlternatingGrowReduce2(list); 7.37/2.96 } else if (mode > 1) { 7.37/2.96 list = list.next; 7.37/2.96 } 7.37/2.96 7.37/2.96 mode++; 7.37/2.96 if (mode > 2) { 7.37/2.96 mode = 0; 7.37/2.96 } 7.37/2.96 } 7.37/2.96 } 7.37/2.96 7.37/2.96 public AlternatingGrowReduce2(AlternatingGrowReduce2 old) { 7.37/2.96 this.next = old; 7.37/2.96 } 7.37/2.96 7.37/2.96 public static AlternatingGrowReduce2 createList(int length) { 7.37/2.96 AlternatingGrowReduce2 res = new AlternatingGrowReduce2(null); 7.37/2.96 while (length > 0) { 7.37/2.96 res = new AlternatingGrowReduce2(res); 7.37/2.96 length--; 7.37/2.96 } 7.37/2.96 return res; 7.37/2.96 } 7.37/2.96 } 7.37/2.96 7.37/2.96 7.37/2.96 package AlternatingGrowReduce2; 7.37/2.96 7.37/2.96 public class Random { 7.37/2.96 static String[] args; 7.37/2.96 static int index = 0; 7.37/2.96 7.37/2.96 public static int random() { 7.37/2.96 String string = args[index]; 7.37/2.96 index++; 7.37/2.96 return string.length(); 7.37/2.96 } 7.37/2.96 } 7.37/2.96 7.37/2.96 7.37/2.96 7.37/2.96 ---------------------------------------- 7.37/2.96 7.37/2.96 (1) BareJBCToJBCProof (EQUIVALENT) 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