Java Bytec 64199 pair #381919522

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.38249206543 seconds
cpu usage	8.976144255
max memory	4.44960768E8

stage attributes

key	value
output-size	7041
starexec-result	NO

output

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


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


NO
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 disproven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 418 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 62 ms]
(6) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class NarrowKonv {

    public static void loop(int i, int range) {
	if (0 <= i && i <= range) {
	    if (!(0 == i && i == range)) {
		if (i == range) {
		    i = 0;
		    range--;
		} else i++;
	    }
	    loop(i, range);
	}
    }

    public static void main(String[] args) {
	loop(args.length, 20);
    }
}



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

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
public class NarrowKonv {

    public static void loop(int i, int range) {
	if (0 <= i && i <= range) {
	    if (!(0 == i && i == range)) {
		if (i == range) {
		    i = 0;
		    range--;
		} else i++;
	    }
	    loop(i, range);
	}
    }

    public static void main(String[] args) {
	loop(args.length, 20);
    }
}



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

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
NarrowKonv.main([Ljava/lang/String;)V: Graph of 13 nodes with 0 SCCs.



NarrowKonv.loop(II)V: Graph of 69 nodes with 0 SCCs.





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

(5) JBCNonTerm (COMPLETE)

popout

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

job log

popout

actions all output return to Java Bytec 64199