Java_Bytecode pair #487571545

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.2978549004 seconds
cpu usage	15.359463713
max memory	1.203826688E9

stage attributes

key	value
output-size	107225
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 1140 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 9 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 212 ms]
        (9) QDP
        (10) UsableRulesReductionPairsProof [EQUIVALENT, 11 ms]
        (11) QDP
        (12) PisEmptyProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) JBCTerminationSCC
        (15) SCCToQDPProof [SOUND, 85 ms]
        (16) QDP
        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (18) YES
    (19) JBCTerminationSCC
        (20) SCCToIRSProof [SOUND, 272 ms]
        (21) IRSwT
        (22) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (23) IRSwT
        (24) IRSwTTerminationDigraphProof [EQUIVALENT, 203 ms]
        (25) IRSwT
        (26) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (27) IRSwT
        (28) TempFilterProof [SOUND, 20 ms]
        (29) IntTRS
        (30) PolynomialOrderProcessor [EQUIVALENT, 8 ms]
        (31) YES
    (32) JBCTerminationSCC
        (33) SCCToIRSProof [SOUND, 125 ms]
        (34) IRSwT
        (35) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (36) IRSwT
        (37) IRSwTTerminationDigraphProof [EQUIVALENT, 23 ms]
        (38) IRSwT
        (39) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (40) IRSwT
        (41) TempFilterProof [SOUND, 37 ms]
        (42) IntTRS
        (43) PolynomialOrderProcessor [EQUIVALENT, 13 ms]
        (44) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class FlattenRTA {
  public static IntList flatten(TreeList list) {
    TreeList cur = list;
    IntList result = null;
    while (cur != null) {
      Tree tree = cur.value;
      if (tree != null) {
        IntList oldIntList = result;
        result = new IntList();
        result.value = tree.value;
        result.next = oldIntList;
        TreeList oldCur = cur;
        cur = new TreeList();
        cur.value = tree.left;
        cur.next = oldCur;
        oldCur.value = tree.right;
      } else cur = cur.next;
    }
    if (cur != list) {}
    return result;
  }

  public static void main(String[] args) {
    Random.args = args;
    int listLength = Random.random();
    TreeList list = null;
    for (int i = listLength; i > 0; i--) {
      Tree tree = Tree.createTree();
      list = new TreeList(tree, list);
    }

    flatten(list);
  }
}

popout

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

job log

popout

actions all output return to Java_Bytecode