Java Bytec 64199 pair #381919309

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.28164815903 seconds
cpu usage	8.942917059
max memory	6.4569344E8

stage attributes

key	value
output-size	43918
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, 451 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToIRSProof [SOUND, 64 ms]
        (9) IRSwT
        (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (11) IRSwT
        (12) IRSwTTerminationDigraphProof [EQUIVALENT, 18 ms]
        (13) IRSwT
        (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (15) IRSwT
        (16) TempFilterProof [SOUND, 34 ms]
        (17) IntTRS
        (18) PolynomialOrderProcessor [EQUIVALENT, 13 ms]
        (19) YES
    (20) JBCTerminationSCC
        (21) SCCToQDPProof [SOUND, 396 ms]
        (22) QDP
        (23) MRRProof [EQUIVALENT, 0 ms]
        (24) QDP
        (25) PisEmptyProof [EQUIVALENT, 0 ms]
        (26) YES


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

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

public class AlternatingGrowReduce {
	AlternatingGrowReduce next;

	public static void main(String[] argv) {
		Random.args = argv;
		AlternatingGrowReduce list = createList(Random.random());

		int mode = 0;
		while (list != null) {
			if (mode == 0) {
				list = list.next.next.next.next;
			} else if (mode == 1) {
				list = new AlternatingGrowReduce(list);
			} else if (mode > 1) {
				list = new AlternatingGrowReduce(new AlternatingGrowReduce(list));
			}

			mode++;
			if (mode > 2) {
				mode = 0;
			}
		}
	}

	public AlternatingGrowReduce(AlternatingGrowReduce old) {
		this.next = old;
	}

	public static AlternatingGrowReduce createList(int length) {
		AlternatingGrowReduce res = new AlternatingGrowReduce(null);
		while (length > 0) {
			res = new AlternatingGrowReduce(res);
			length--;
		}
		return res;
	}
}


package AlternatingGrowReduce;

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

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

popout

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

job log

popout

actions all output return to Java Bytec 64199