Java_Bytecode pair #487571304

details

property	value
status	complete
benchmark	Velroyen08-upAndDownIneq.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	BSOG_FoVeOOS_11

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.85977888107 seconds
cpu usage	6.88067792
max memory	5.42810112E8

stage attributes

key	value
output-size	6165
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


termination of the given Bare JBC problem could be disproven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 342 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 294 ms]
(6) NO


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

(0)
Obligation:
need to prove termination of the following program:
package simple.upAndDownIneq;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		UpAndDownIneq.upAndDown(args.length);

	}

}


package simple.upAndDownIneq;

public class UpAndDownIneq {
	
	public static void upAndDown(int i) {
		int up = 0;
		while (0 <= i && i <= 10) {
			if (i >= 10) {
				up = 0;
			}
			if (i <= 0) {
				up = 1;
			}
			if (up >= 1) {
				i++;
			} else {
				i--;
			}
		}
	}
	
}



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

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

(2)
Obligation:
need to prove termination of the following program:
package simple.upAndDownIneq;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		UpAndDownIneq.upAndDown(args.length);

	}

}


package simple.upAndDownIneq;

public class UpAndDownIneq {
	
	public static void upAndDown(int i) {
		int up = 0;
		while (0 <= i && i <= 10) {
			if (i >= 10) {
				up = 0;

popout

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

job log

popout

actions all output return to Java_Bytecode