Java_Bytecode 2019-04-01 06.50 pair #433315820

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.12823 seconds
cpu usage	12.1191
user time	11.5183
system time	0.600763
max virtual memory	2.1177272E7
max residence set size	901436.0

stage attributes

key	value
starexec-result	YES

output

11.88/4.04	YES
11.95/4.05	proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
11.95/4.05	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.95/4.05	
11.95/4.05	
11.95/4.05	termination of the given Bare JBC problem could be proven:
11.95/4.05	
11.95/4.05	(0) Bare JBC problem
11.95/4.05	(1) BareJBCToJBCProof [EQUIVALENT, 98 ms]
11.95/4.05	(2) JBC problem
11.95/4.05	(3) JBCToGraph [EQUIVALENT, 928 ms]
11.95/4.05	(4) JBCTerminationGraph
11.95/4.05	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
11.95/4.05	(6) AND
11.95/4.05	    (7) JBCTerminationSCC
11.95/4.05	        (8) SCCToIRSProof [SOUND, 287 ms]
11.95/4.05	        (9) IRSwT
11.95/4.05	        (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
11.95/4.05	        (11) IRSwT
11.95/4.05	        (12) IRSwTTerminationDigraphProof [EQUIVALENT, 305 ms]
11.95/4.05	        (13) IRSwT
11.95/4.05	        (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
11.95/4.05	        (15) IRSwT
11.95/4.05	        (16) TempFilterProof [SOUND, 26 ms]
11.95/4.05	        (17) IntTRS
11.95/4.05	        (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
11.95/4.05	        (19) YES
11.95/4.05	    (20) JBCTerminationSCC
11.95/4.05	        (21) SCCToQDPProof [SOUND, 219 ms]
11.95/4.05	        (22) QDP
11.95/4.05	        (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.95/4.05	        (24) YES
11.95/4.05	
11.95/4.05	
11.95/4.05	----------------------------------------
11.95/4.05	
11.95/4.05	(0)
11.95/4.05	Obligation:
11.95/4.05	need to prove termination of the following program:
11.95/4.05	package TreeLeftmostDepth;
11.95/4.05	
11.95/4.05	public class Random {
11.95/4.05	  static String[] args;
11.95/4.05	  static int index = 0;
11.95/4.05	
11.95/4.05	  public static int random() {
11.95/4.05	    String string = args[index];
11.95/4.05	    index++;
11.95/4.05	    return string.length();
11.95/4.05	  }
11.95/4.05	}
11.95/4.05	
11.95/4.05	
11.95/4.05	package TreeLeftmostDepth;
11.95/4.05	
11.95/4.05	public class Tree {
11.95/4.05	  Tree left;
11.95/4.05	  Tree right;
11.95/4.05	  Object value;
11.95/4.05	
11.95/4.05	  public Tree(Tree l, Tree r) {
11.95/4.05	    this.left = l;
11.95/4.05	    this.right = r;
11.95/4.05	  }
11.95/4.05	
11.95/4.05	  public Tree() {
11.95/4.05	  }
11.95/4.05	
11.95/4.05	  public static Tree createNode() {
11.95/4.05	    Tree result = new Tree();
11.95/4.05	    result.value = new Object();
11.95/4.05	    return result;
11.95/4.05	  }
11.95/4.05	
11.95/4.05	  public static Tree createTree() {
11.95/4.05	    int counter = Random.random();
11.95/4.05	    if (counter == 0) {
11.95/4.05	      return null;
11.95/4.05	    }
11.95/4.05	    Tree result = createNode();
11.95/4.05	    Tree t = result;
11.95/4.05	
11.95/4.05	    while (counter > 0) {
11.95/4.05	      int branch = Random.random();
11.95/4.05	      if (branch > 0) {
11.95/4.05	        if (t.left == null) {
11.95/4.05	          t.left = createNode();
11.95/4.05	          t = result;
11.95/4.05	        } else {
11.95/4.05	          t = t.left;
11.95/4.05	        }
11.95/4.05	      } else {
11.95/4.05	        if (t.right == null) {
11.95/4.05	          t.right = createNode();
11.95/4.05	          t = result;
11.95/4.05	        } else {
11.95/4.05	          t = t.right;
11.95/4.05	        }
11.95/4.05	      }
11.95/4.05	      counter--;

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