Java Bytec 64199 pair #381919223

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.45152306557 seconds
cpu usage	16.790623163
max memory	1.51343104E9

stage attributes

key	value
output-size	227142
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox/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, 1273 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 750 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) UsableRulesProof [EQUIVALENT, 0 ms]
        (13) QDP
        (14) QReductionProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) JBCTerminationSCC
        (19) SCCToIRSProof [SOUND, 269 ms]
        (20) IRSwT
        (21) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) IRSwTTerminationDigraphProof [EQUIVALENT, 176 ms]
        (24) IRSwT
        (25) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (26) IRSwT
        (27) TempFilterProof [SOUND, 113 ms]
        (28) IntTRS
        (29) PolynomialOrderProcessor [EQUIVALENT, 34 ms]
        (30) IntTRS
        (31) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (32) YES


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

(0)
Obligation:
need to prove termination of the following program:
package DupTreeRec;

public class DupTreeRec {
  public static void main(final String[] args) {
    Random.args = args;

    final Tree t = Tree.createTree(Random.random());
    dupTree(t);
  }

  public static void dupTree(final Tree t) {
      dupList(t.children);
  }

  public static void dupList(final TreeList l) {
      if (l == null) return;
      dupTree(l.value);
      l.next = new TreeList(l.value, l.next);
      dupList(l.next.next);
  }
}


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

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


package DupTreeRec;
public class Tree {
    TreeList children;

    public Tree() {
        this.children = null;
    }

    public void addChild(final Tree t) {
        this.children = new TreeList(t, this.children);
    }

popout

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

job log

popout

actions all output return to Java Bytec 64199