Java Bytec 64199 pair #381919256

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.98183298111 seconds
cpu usage	15.756307968
max memory	1.359187968E9

stage attributes

key	value
output-size	188805
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 1567 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 1 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 671 ms]
        (9) QDP
        (10) UsableRulesReductionPairsProof [EQUIVALENT, 55 ms]
        (11) QDP
        (12) PisEmptyProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) JBCTerminationSCC
        (15) SCCToIRSProof [SOUND, 255 ms]
        (16) IRSwT
        (17) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (18) IRSwT
        (19) IRSwTTerminationDigraphProof [EQUIVALENT, 160 ms]
        (20) IRSwT
        (21) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) TempFilterProof [SOUND, 47 ms]
        (24) IntTRS
        (25) RankingReductionPairProof [EQUIVALENT, 14 ms]
        (26) YES


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
public class FlattenTreeRec {
	public static void main(String[] args) {
		Random.args = args;
		Tree tree = Tree.createTree();
		flatten(tree);
	}

	public static Tree flatten(Tree start) {
		if (start != null) {
			if (start.left == null) {
				return new Tree(start.value, null, flatten(start.right));
			} else {
				Tree s = start.left.left;
				Tree t = start.left.right;
				Tree u = start.right;
				return flatten(new Tree(start.value, s, new Tree(start.left.value,t,u)));
			}
		} else {
			return null;
		}
	}
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}


public class Tree {
  Tree left;
  Tree right;
  Object value;

  public Tree(Object v, Tree l, Tree r) {
	this.value = v;
    this.left = l;
    this.right = r;
  }

  public Tree() {
  }

  public static Tree createNode() {
    Tree result = new Tree();
    result.value = new Object();

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Java Bytec 64199