Java_Bytecode 2019-04-01 06.50 pair #433315794

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.47885 seconds
cpu usage	9.92009
user time	9.42504
system time	0.495054
max virtual memory	2.107984E7
max residence set size	682628.0

stage attributes

key	value
starexec-result	YES

output

9.48/3.40	YES
9.82/3.42	proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
9.82/3.42	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.82/3.42	
9.82/3.42	
9.82/3.42	termination of the given Bare JBC problem could be proven:
9.82/3.42	
9.82/3.42	(0) Bare JBC problem
9.82/3.42	(1) BareJBCToJBCProof [EQUIVALENT, 95 ms]
9.82/3.42	(2) JBC problem
9.82/3.42	(3) JBCToGraph [EQUIVALENT, 675 ms]
9.82/3.42	(4) JBCTerminationGraph
9.82/3.42	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
9.82/3.42	(6) AND
9.82/3.42	    (7) JBCTerminationSCC
9.82/3.42	        (8) SCCToQDPProof [SOUND, 127 ms]
9.82/3.42	        (9) QDP
9.82/3.42	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.82/3.42	        (11) YES
9.82/3.42	    (12) JBCTerminationSCC
9.82/3.42	        (13) SCCToIRSProof [SOUND, 33 ms]
9.82/3.42	        (14) IRSwT
9.82/3.42	        (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
9.82/3.42	        (16) IRSwT
9.82/3.42	        (17) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
9.82/3.42	        (18) IRSwT
9.82/3.42	        (19) IntTRSCompressionProof [EQUIVALENT, 0 ms]
9.82/3.42	        (20) IRSwT
9.82/3.42	        (21) TempFilterProof [SOUND, 14 ms]
9.82/3.42	        (22) IntTRS
9.82/3.42	        (23) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
9.82/3.42	        (24) YES
9.82/3.42	    (25) JBCTerminationSCC
9.82/3.42	        (26) SCCToQDPProof [SOUND, 264 ms]
9.82/3.42	        (27) QDP
9.82/3.42	        (28) DependencyGraphProof [EQUIVALENT, 0 ms]
9.82/3.42	        (29) TRUE
9.82/3.42	
9.82/3.42	
9.82/3.42	----------------------------------------
9.82/3.42	
9.82/3.42	(0)
9.82/3.42	Obligation:
9.82/3.42	need to prove termination of the following program:
9.82/3.42	public class Random {
9.82/3.42	  static String[] args;
9.82/3.42	  static int index = 0;
9.82/3.42	
9.82/3.42	  public static int random() {
9.82/3.42	    String string = args[index];
9.82/3.42	    index++;
9.82/3.42	    return string.length();
9.82/3.42	  }
9.82/3.42	}
9.82/3.42	
9.82/3.42	
9.82/3.42	public class Shuffle{
9.82/3.42	
9.82/3.42	  // adapted from [Walther, 94]
9.82/3.42	  public static void main(String[] args) {
9.82/3.42	    Random.args = args;
9.82/3.42	    IntList l = IntList.createIntList();
9.82/3.42	    IntList res = null;
9.82/3.42	
9.82/3.42	    while (l != null) {
9.82/3.42	
9.82/3.42	      res = new IntList(l.value, res);
9.82/3.42	      l = l.next;
9.82/3.42	      if (l != null) l = l.reverse();
9.82/3.42	
9.82/3.42	    }
9.82/3.42	
9.82/3.42	  }
9.82/3.42	}
9.82/3.42	
9.82/3.42	
9.82/3.42	class IntList {
9.82/3.42	  int value;
9.82/3.42	  IntList next;
9.82/3.42	
9.82/3.42	  public IntList(int value, IntList next) {
9.82/3.42	    this.value = value;
9.82/3.42	    this.next = next;
9.82/3.42	  }
9.82/3.42	
9.82/3.42	
9.82/3.42	  public static IntList createIntList() {
9.82/3.42	
9.82/3.42	    int i = Random.random();
9.82/3.42	    int j;
9.82/3.42	
9.82/3.42	    IntList l = null;
9.82/3.42	
9.82/3.42	    while (i > 0) {
9.82/3.42	      j = Random.random();
9.82/3.42	      l = new IntList(j, l);
9.82/3.42	      i--;
9.82/3.42	    }
9.82/3.42	
9.82/3.42	    return l;

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