Java Bytec 64199 pair #381919501

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	n078.star.cs.uiowa.edu
space	BOG_RTA_11

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.45220685005 seconds
cpu usage	13.160932702
max memory	1.263239168E9

stage attributes

key	value
output-size	149257
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, 98 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 1153 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 200 ms]
        (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) JBCTerminationSCC
        (13) SCCToQDPProof [SOUND, 468 ms]
        (14) QDP
        (15) DependencyGraphProof [EQUIVALENT, 0 ms]
        (16) TRUE
    (17) JBCTerminationSCC
        (18) SCCToIRSProof [SOUND, 98 ms]
        (19) IRSwT
        (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (21) IRSwT
        (22) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (23) IRSwT
        (24) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (25) IRSwT
        (26) TempFilterProof [SOUND, 28 ms]
        (27) IntTRS
        (28) RankingReductionPairProof [EQUIVALENT, 0 ms]
        (29) YES


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

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

public class List {

  int value;
  List next;

  public List() {}

  public List(int value, List next) {
    this.value = value;
    this.next = next;
  }

  public static List copy(List x) {
    if (x == null) return null;
    else return new List(x.value,copy(x.next));
  }
}


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

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


package Shuffle; 
public class Shuffle {

	// from Walther (1994)
	public static List reverse(final List l) {
		if (l == null || l.next==null) return l;
		final List nextItem = l.next;
		final List reverseRest = reverse(nextItem);
		l.next = null;
		nextItem.next = l;
		return reverseRest;
	}

	public static List shuffle(List xs) {
		if (xs == null) {
			return null;

popout

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

job log

popout

actions all output return to Java Bytec 64199