Java Bytec 64199 pair #381919442

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.34634399414 seconds
cpu usage	23.42681873
max memory	2.035499008E9

stage attributes

key	value
output-size	170976
starexec-result	MAYBE

output

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


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


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


termination of the given Bare JBC problem could not be shown:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 2105 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToIRSProof [SOUND, 113 ms]
        (9) IRSwT
        (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (11) IRSwT
        (12) IRSwTTerminationDigraphProof [EQUIVALENT, 33 ms]
        (13) IRSwT
        (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (15) IRSwT
        (16) TempFilterProof [SOUND, 122 ms]
        (17) IRSwT
        (18) IRSwTTerminationDigraphProof [EQUIVALENT, 6 ms]
        (19) IRSwT
    (20) JBCTerminationSCC
        (21) SCCToIRSProof [SOUND, 156 ms]
        (22) IRSwT
        (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (24) IRSwT
        (25) IRSwTTerminationDigraphProof [EQUIVALENT, 51 ms]
        (26) IRSwT
        (27) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (28) IRSwT
        (29) TempFilterProof [SOUND, 366 ms]
        (30) IRSwT
        (31) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (32) IRSwT
        (33) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (34) IRSwT
    (35) JBCTerminationSCC
        (36) SCCToIRSProof [SOUND, 454 ms]
        (37) IRSwT
        (38) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (39) IRSwT
        (40) IRSwTTerminationDigraphProof [EQUIVALENT, 275 ms]
        (41) IRSwT
        (42) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (43) IRSwT
        (44) TempFilterProof [SOUND, 91 ms]
        (45) IntTRS
        (46) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (47) IntTRS
        (48) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (49) IntTRS
        (50) RankingReductionPairProof [EQUIVALENT, 0 ms]
        (51) YES
    (52) JBCTerminationSCC
        (53) SCCToIRSProof [SOUND, 206 ms]
        (54) IRSwT
        (55) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (56) IRSwT
        (57) IRSwTTerminationDigraphProof [EQUIVALENT, 12 ms]
        (58) IRSwT
        (59) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (60) IRSwT
        (61) TempFilterProof [SOUND, 34 ms]
        (62) IntTRS
        (63) PolynomialOrderProcessor [EQUIVALENT, 15 ms]
        (64) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class MarkingGraphVisitor {
	private int mark;
	private Object val;
	private List children;

	private static void visit(MarkingGraphVisitor node, int expectedMark) {
		if (node.mark == expectedMark) {
			node.mark = expectedMark + 1;
			List curChild = node.children;
			while (curChild != null) {
				MarkingGraphVisitor child = curChild.val;
				curChild = curChild.next;
				if (child != null) {
					visit(child, expectedMark);
				}

popout

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

job log

popout

actions all output return to Java Bytec 64199