Java_Bytecode 2019-04-01 06.50 pair #433315811

details

property	value
status	complete
benchmark	AProVE12-cyclic-Length.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	BMOG_CAV_12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.83906 seconds
cpu usage	7.30986
user time	6.93244
system time	0.377421
max virtual memory	2.0477424E7
max residence set size	540252.0

stage attributes

key	value
starexec-result	YES

output

6.93/2.76	YES
6.93/2.79	proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
6.93/2.79	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.93/2.79	
6.93/2.79	
6.93/2.79	termination of the given Bare JBC problem could be proven:
6.93/2.79	
6.93/2.79	(0) Bare JBC problem
6.93/2.79	(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
6.93/2.79	(2) JBC problem
6.93/2.79	(3) JBCToGraph [EQUIVALENT, 349 ms]
6.93/2.79	(4) JBCTerminationGraph
6.93/2.79	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
6.93/2.79	(6) AND
6.93/2.79	    (7) JBCTerminationSCC
6.93/2.79	        (8) SCCToQDPProof [SOUND, 127 ms]
6.93/2.79	        (9) QDP
6.93/2.79	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.93/2.79	        (11) YES
6.93/2.79	    (12) JBCTerminationSCC
6.93/2.79	        (13) SCCToIRSProof [SOUND, 96 ms]
6.93/2.79	        (14) IRSwT
6.93/2.79	        (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
6.93/2.79	        (16) IRSwT
6.93/2.79	        (17) IRSwTTerminationDigraphProof [EQUIVALENT, 29 ms]
6.93/2.79	        (18) IRSwT
6.93/2.79	        (19) IntTRSCompressionProof [EQUIVALENT, 0 ms]
6.93/2.79	        (20) IRSwT
6.93/2.79	        (21) TempFilterProof [SOUND, 18 ms]
6.93/2.79	        (22) IntTRS
6.93/2.79	        (23) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
6.93/2.79	        (24) YES
6.93/2.79	
6.93/2.79	
6.93/2.79	----------------------------------------
6.93/2.79	
6.93/2.79	(0)
6.93/2.79	Obligation:
6.93/2.79	need to prove termination of the following program:
6.93/2.79	public class List1 {
6.93/2.79		List1 pred, next;
6.93/2.79	
6.93/2.79		List1(List1 pred) {
6.93/2.79			if (pred != null) {
6.93/2.79				pred.next = this;
6.93/2.79			}
6.93/2.79			this.pred = pred;
6.93/2.79		}
6.93/2.79	
6.93/2.79		static int length(List1 l) {
6.93/2.79			int r = 1;
6.93/2.79			while (null != (l = l.next))
6.93/2.79				r++;
6.93/2.79			return r;
6.93/2.79		}
6.93/2.79	
6.93/2.79		public static void main(String[] args) {
6.93/2.79			//Create doubly-linked list:
6.93/2.79			int length = args.length;
6.93/2.79			List1 cur = new List1(null);
6.93/2.79			List1 first = cur;
6.93/2.79			while (length-- > 0) {
6.93/2.79				cur = new List1(cur);
6.93/2.79			}
6.93/2.79	
6.93/2.79			length(first);		
6.93/2.79		}
6.93/2.79	}
6.93/2.79	
6.93/2.79	
6.93/2.79	
6.93/2.79	
6.93/2.79	----------------------------------------
6.93/2.79	
6.93/2.79	(1) BareJBCToJBCProof (EQUIVALENT)
6.93/2.79	initialized classpath
6.93/2.79	----------------------------------------
6.93/2.79	
6.93/2.79	(2)
6.93/2.79	Obligation:
6.93/2.79	need to prove termination of the following program:
6.93/2.79	public class List1 {
6.93/2.79		List1 pred, next;
6.93/2.79	
6.93/2.79		List1(List1 pred) {
6.93/2.79			if (pred != null) {
6.93/2.79				pred.next = this;
6.93/2.79			}
6.93/2.79			this.pred = pred;
6.93/2.79		}
6.93/2.79	
6.93/2.79		static int length(List1 l) {
6.93/2.79			int r = 1;
6.93/2.79			while (null != (l = l.next))
6.93/2.79				r++;
6.93/2.79			return r;
6.93/2.79		}
6.93/2.79	
6.93/2.79		public static void main(String[] args) {
6.93/2.79			//Create doubly-linked list:

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