details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.71425 seconds
cpu usage	15.64
user time	14.7581
system time	0.881901
max virtual memory	1.8949528E7
max residence set size	1333216.0

stage attributes

key	value
starexec-result	YES

output

15.31/5.59 YES 15.48/5.60 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 15.48/5.60 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 15.48/5.60 15.48/5.60 15.48/5.60 termination of the given Bare JBC problem could be proven: 15.48/5.60 15.48/5.60 (0) Bare JBC problem 15.48/5.60 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 15.48/5.60 (2) JBC problem 15.48/5.60 (3) JBCToGraph [EQUIVALENT, 705 ms] 15.48/5.60 (4) JBCTerminationGraph 15.48/5.60 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 15.48/5.60 (6) AND 15.48/5.60 (7) JBCTerminationSCC 15.48/5.60 (8) SCCToQDPProof [SOUND, 125 ms] 15.48/5.60 (9) QDP 15.48/5.60 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.48/5.60 (11) YES 15.48/5.60 (12) JBCTerminationSCC 15.48/5.60 (13) SCCToQDPProof [SOUND, 73 ms] 15.48/5.60 (14) QDP 15.48/5.60 (15) QDPSizeChangeProof [EQUIVALENT, 4 ms] 15.48/5.60 (16) YES 15.48/5.60 (17) JBCTerminationSCC 15.48/5.60 (18) SCCToIRSProof [SOUND, 20 ms] 15.48/5.60 (19) IRSwT 15.48/5.60 (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 15.48/5.60 (21) IRSwT 15.48/5.60 (22) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] 15.48/5.60 (23) IRSwT 15.48/5.60 (24) IntTRSCompressionProof [EQUIVALENT, 0 ms] 15.48/5.60 (25) IRSwT 15.48/5.60 (26) TempFilterProof [SOUND, 14 ms] 15.48/5.60 (27) IntTRS 15.48/5.60 (28) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 15.48/5.60 (29) YES 15.48/5.60 (30) JBCTerminationSCC 15.48/5.60 (31) SCCToIRSProof [SOUND, 240 ms] 15.48/5.60 (32) IRSwT 15.48/5.60 (33) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 15.48/5.60 (34) IRSwT 15.48/5.60 (35) IRSwTTerminationDigraphProof [EQUIVALENT, 121 ms] 15.48/5.60 (36) IRSwT 15.48/5.60 (37) IntTRSCompressionProof [EQUIVALENT, 0 ms] 15.48/5.60 (38) IRSwT 15.48/5.60 (39) TempFilterProof [SOUND, 9 ms] 15.48/5.60 (40) IRSwT 15.48/5.60 (41) IRSwTToQDPProof [SOUND, 0 ms] 15.48/5.60 (42) QDP 15.48/5.60 (43) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.48/5.60 (44) YES 15.48/5.60 15.48/5.60 15.48/5.60 ---------------------------------------- 15.48/5.60 15.48/5.60 (0) 15.48/5.60 Obligation: 15.48/5.60 need to prove termination of the following program: 15.48/5.60 public class Test5 { 15.48/5.60 public static void main(String[] args) { 15.48/5.60 List l1 = List.mk(args.length); 15.48/5.60 List l2 = List.mk(args.length + 3); 15.48/5.60 List l3 = List.mk(args.length + 5); 15.48/5.60 List temp; 15.48/5.60 15.48/5.60 while (length(l1) > 0) { 15.48/5.60 temp = l1; 15.48/5.60 l1 = l2; 15.48/5.60 l2 = l3; 15.48/5.60 l3 = temp; 15.48/5.60 15.48/5.60 if (length(l2) % 3 == 0) 15.48/5.60 temp = temp.getTail(); 15.48/5.60 15.48/5.60 if (length(l3) % 5 == 0) 15.48/5.60 l3 = l3.getTail(); 15.48/5.60 15.48/5.60 if (length(l1) > length(l2)) 15.48/5.60 l1 = l1.getTail(); 15.48/5.60 else if (length(l1) == length(l2)) 15.48/5.60 l2 = l2.getTail(); 15.48/5.60 else 15.48/5.60 l3 = l3.getTail(); 15.48/5.60 15.48/5.60 test(l1, l2, l3); 15.48/5.60 } 15.48/5.60 } 15.48/5.60 15.48/5.60 private static int length(List list) { 15.48/5.60 int len = 0; 15.48/5.60 15.48/5.60 while (list != null) { 15.48/5.60 list = list.getTail(); 15.48/5.60 len++; 15.48/5.60 } 15.48/5.60 15.48/5.60 return len; 15.48/5.60 } 15.48/5.60 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