Java Bytec 64199 pair #381919359

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.40014004707 seconds
cpu usage	13.943463717
max memory	1.484783616E9

stage attributes

key	value
output-size	83821
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: 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, 304 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 3487 ms]
(6) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class NO_05 {
    public static void main(String args[]) {
	for (int i = 0; i < 100; i++) {
	    if (i < 10) for (int j = 0; j < 15; j++);
	    else if (i < 50) continue;
	    else for (int j = 0; j < 15; j += 0);
	}
    }
}


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

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

(2)
Obligation:
need to prove termination of the following program:
public class NO_05 {
    public static void main(String args[]) {
	for (int i = 0; i < 100; i++) {
	    if (i < 10) for (int j = 0; j < 15; j++);
	    else if (i < 50) continue;
	    else for (int j = 0; j < 15; j += 0);
	}
    }
}


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

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

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





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

(5) JBCNonTerm (COMPLETE)
Reached a loop using the following run: 

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

popout

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

job log

popout

actions all output return to Java Bytec 64199