Java_Bytecode 2019-04-01 06.50 pair #433315574

details

property	value
status	complete
benchmark	costa09-example_3.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n017.star.cs.uiowa.edu
space	Costa_Julia_09

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.97096 seconds
cpu usage	4.1878
user time	4.00302
system time	0.184777
max virtual memory	1.8279332E7
max residence set size	318192.0

stage attributes

key	value
starexec-result	YES

output

3.82/1.85	YES
3.99/1.93	proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
3.99/1.93	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.99/1.93	
3.99/1.93	
3.99/1.93	termination of the given Bare JBC problem could be proven:
3.99/1.93	
3.99/1.93	(0) Bare JBC problem
3.99/1.93	(1) BareJBCToJBCProof [EQUIVALENT, 95 ms]
3.99/1.93	(2) JBC problem
3.99/1.93	(3) JBCToGraph [EQUIVALENT, 187 ms]
3.99/1.93	(4) JBCTerminationGraph
3.99/1.93	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
3.99/1.93	(6) TRUE
3.99/1.93	
3.99/1.93	
3.99/1.93	----------------------------------------
3.99/1.93	
3.99/1.93	(0)
3.99/1.93	Obligation:
3.99/1.93	need to prove termination of the following program:
3.99/1.93	package example_3;
3.99/1.93	
3.99/1.93	public class Test {
3.99/1.93		int i;
3.99/1.93		
3.99/1.93		/**
3.99/1.93		 * Same simple arithmetic loop, but the loop counter
3.99/1.93		 * is a numeric field.
3.99/1.93		 */
3.99/1.93		public void m(int n) {
3.99/1.93			while (i < n) {
3.99/1.93				i++;
3.99/1.93			}
3.99/1.93		}
3.99/1.93		
3.99/1.93		public static void main(String[] args) {
3.99/1.93			Test o = new Test();
3.99/1.93			o.m(10);
3.99/1.93		}
3.99/1.93	
3.99/1.93	}
3.99/1.93	
3.99/1.93	
3.99/1.93	
3.99/1.93	----------------------------------------
3.99/1.93	
3.99/1.93	(1) BareJBCToJBCProof (EQUIVALENT)
3.99/1.93	initialized classpath
3.99/1.93	----------------------------------------
3.99/1.93	
3.99/1.93	(2)
3.99/1.93	Obligation:
3.99/1.93	need to prove termination of the following program:
3.99/1.93	package example_3;
3.99/1.93	
3.99/1.93	public class Test {
3.99/1.93		int i;
3.99/1.93		
3.99/1.93		/**
3.99/1.93		 * Same simple arithmetic loop, but the loop counter
3.99/1.93		 * is a numeric field.
3.99/1.93		 */
3.99/1.93		public void m(int n) {
3.99/1.93			while (i < n) {
3.99/1.93				i++;
3.99/1.93			}
3.99/1.93		}
3.99/1.93		
3.99/1.93		public static void main(String[] args) {
3.99/1.93			Test o = new Test();
3.99/1.93			o.m(10);
3.99/1.93		}
3.99/1.93	
3.99/1.93	}
3.99/1.93	
3.99/1.93	
3.99/1.93	
3.99/1.93	----------------------------------------
3.99/1.93	
3.99/1.93	(3) JBCToGraph (EQUIVALENT)
3.99/1.93	Constructed TerminationGraph.
3.99/1.93	----------------------------------------
3.99/1.93	
3.99/1.93	(4)
3.99/1.93	Obligation:
3.99/1.93	Termination Graph based on JBC Program:
3.99/1.93	example_3.Test.main([Ljava/lang/String;)V: Graph of 127 nodes with 0 SCCs.
3.99/1.93	
3.99/1.93	
3.99/1.93	
3.99/1.93	
3.99/1.93	
3.99/1.93	----------------------------------------
3.99/1.93	
3.99/1.93	(5) TerminationGraphToSCCProof (SOUND)
3.99/1.93	Proven termination by absence of SCCs
3.99/1.93	----------------------------------------
3.99/1.93	
3.99/1.93	(6)

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