Java_Bytecode pair #487571575

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.23517584801 seconds
cpu usage	7.942466719
max memory	4.34880512E8

stage attributes

key	value
output-size	5548
starexec-result	NO

output

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


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


NO
proof of /export/starexec/sandbox2/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) JBCNonTerm [COMPLETE, 249 ms]
(4) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class NO_04 {
    public static void main(String args[]) {
        for (int i = 0; i < 100; i++) {
	    int a = i+2;
            for (int j = 0; j < a; j++)
		for (int k = i+j+3; k >= 0; k--) {
		    int b = i+j+k+4;
		    for (int l = 0; l < b; l++)
			for (int m = i+j+k+l+1000; m >= 0; m -= 0);
		}
	}
    }
}



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

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

(2)
Obligation:
need to prove termination of the following program:
public class NO_04 {
    public static void main(String args[]) {
        for (int i = 0; i < 100; i++) {
	    int a = i+2;
            for (int j = 0; j < a; j++)
		for (int k = i+j+3; k >= 0; k--) {
		    int b = i+j+k+4;
		    for (int l = 0; l < b; l++)
			for (int m = i+j+k+l+1000; m >= 0; m -= 0);
		}
	}
    }
}



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

(3) JBCNonTerm (COMPLETE)
Constructed a run with a repetition. States 45 and 49 are repetitions (when considering only the interesting positions []).

0:<NO_04.main||0: push 0|| - || ->
YES:  (JL1)
1:<NO_04.main||1: store INT to #1|| - ||0>
YES:  (JL1)
2:<NO_04.main||2: load INT #1||#1: 0|| ->
YES:  (JL1)
3:<NO_04.main||3: push 100||#1: 0||0>
YES:  (JL1)
4:<NO_04.main||5: GE||#1: 0||0, 100>
YES:  (JL1)
5:<NO_04.main||8: load INT #1||#1: 0|| ->
YES:  (JL1)
6:<NO_04.main||9: push 2||#1: 0||0>
YES:  (JL1)
7:<NO_04.main||10: ADD||#1: 0||0, 2>
YES:  (JL1)
8:<NO_04.main||11: store INT to #2||#1: 0||2>
YES:  (JL1)
9:<NO_04.main||12: push 0||#1: 0, #2: 2|| ->
YES:  (JL1)
10:<NO_04.main||13: store INT to #3||#1: 0, #2: 2||0>
YES:  (JL1)
11:<NO_04.main||14: load INT #3||#1: 0, #2: 2, #3: 0|| ->
YES:  (JL1)
12:<NO_04.main||15: load INT #2||#1: 0, #2: 2, #3: 0||0>
YES:  (JL1)
13:<NO_04.main||16: GE||#1: 0, #2: 2, #3: 0||0, 2>
YES:  (JL1)
14:<NO_04.main||19: load INT #1||#1: 0, #2: 2, #3: 0|| ->

popout

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

job log

popout

actions all output return to Java_Bytecode