Java_Bytecode 2019-04-01 06.50 pair #433315713

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.19054 seconds
cpu usage	12.2333
user time	11.5663
system time	0.666992
max virtual memory	4.1943304E7
max residence set size	1017588.0

stage attributes

key	value
starexec-result	YES

output

12.12/4.14	YES
12.12/4.15	proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
12.12/4.15	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
12.12/4.15	
12.12/4.15	
12.12/4.15	termination of the given Bare JBC problem could be proven:
12.12/4.15	
12.12/4.15	(0) Bare JBC problem
12.12/4.15	(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
12.12/4.15	(2) JBC problem
12.12/4.15	(3) JBCToGraph [EQUIVALENT, 541 ms]
12.12/4.15	(4) JBCTerminationGraph
12.12/4.15	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
12.12/4.15	(6) AND
12.12/4.15	    (7) JBCTerminationSCC
12.12/4.15	        (8) SCCToIRSProof [SOUND, 54 ms]
12.12/4.15	        (9) IRSwT
12.12/4.15	        (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
12.12/4.15	        (11) IRSwT
12.12/4.15	        (12) IRSwTTerminationDigraphProof [EQUIVALENT, 19 ms]
12.12/4.15	        (13) IRSwT
12.12/4.15	        (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
12.12/4.15	        (15) IRSwT
12.12/4.15	        (16) TempFilterProof [SOUND, 23 ms]
12.12/4.15	        (17) IntTRS
12.12/4.15	        (18) PolynomialOrderProcessor [EQUIVALENT, 13 ms]
12.12/4.15	        (19) YES
12.12/4.15	    (20) JBCTerminationSCC
12.12/4.15	        (21) SCCToIRSProof [SOUND, 16 ms]
12.12/4.15	        (22) IRSwT
12.12/4.15	        (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
12.12/4.15	        (24) IRSwT
12.12/4.15	        (25) IRSwTTerminationDigraphProof [EQUIVALENT, 359 ms]
12.12/4.15	        (26) IRSwT
12.12/4.15	        (27) IntTRSCompressionProof [EQUIVALENT, 0 ms]
12.12/4.15	        (28) IRSwT
12.12/4.15	        (29) FilterProof [EQUIVALENT, 0 ms]
12.12/4.15	        (30) IntTRS
12.12/4.15	        (31) IntTRSCompressionProof [EQUIVALENT, 0 ms]
12.12/4.15	        (32) IntTRS
12.12/4.15	        (33) RankingReductionPairProof [EQUIVALENT, 27 ms]
12.12/4.15	        (34) YES
12.12/4.15	
12.12/4.15	
12.12/4.15	----------------------------------------
12.12/4.15	
12.12/4.15	(0)
12.12/4.15	Obligation:
12.12/4.15	need to prove termination of the following program:
12.12/4.15	/**
12.12/4.15	 * Parts of the below code have been adapted from
12.12/4.15	 *
12.12/4.15	 * http://www0.cs.ucl.ac.uk/staff/p.ohearn/Talks/SAStalk.pdf
12.12/4.15	 *
12.12/4.15	 * Based on the motivating example of the paper
12.12/4.15	 *
12.12/4.15	 * Automatic termination proofs for programs with shape-shifting heaps
12.12/4.15	 * Josh Berdine, Byron Cook, Dino Distefano, and Peter W. O’Hearn
12.12/4.15	 * In Proc. CAV'06, LNCS 4144, pp. 386 - 400, 2006.
12.12/4.15	 */
12.12/4.15	public class Kernel95 {
12.12/4.15	    /**
12.12/4.15	     * A reference to the next list element.
12.12/4.15	     */
12.12/4.15	    private Kernel95 next;
12.12/4.15	    
12.12/4.15	    public static void main(String[] args) {
12.12/4.15	        int random1 = args[0].length();
12.12/4.15	        int random2 = args[1].length();
12.12/4.15	
12.12/4.15	        //slide68(random1, random2);
12.12/4.15	        //slide88(random1, random2);
12.12/4.15	        //slide93(random1, random2);
12.12/4.15	        slide95(random1, random2);
12.12/4.15	    }
12.12/4.15	    
12.12/4.15	    /**
12.12/4.15	     * Create a new list element.
12.12/4.15	     * @param n a reference to the next element.
12.12/4.15	     */
12.12/4.15	    public Kernel95(final Kernel95 n) {
12.12/4.15	        this.next = n;
12.12/4.15	    }
12.12/4.15	    
12.12/4.15	    /**
12.12/4.15	     * Create a new cyclical list of a length x.
12.12/4.15	     * @param x some length
12.12/4.15	     * @return cyclical list of length max(1, x)
12.12/4.15	     */
12.12/4.15	    public static Kernel95 create(int x) {
12.12/4.15	        Kernel95 last, current;
12.12/4.15	        last = current = new Kernel95(null);
12.12/4.15	        while (--x > 0)
12.12/4.15	            current = new Kernel95(current);
12.12/4.15	        return last.next = current;
12.12/4.15	    }
12.12/4.15	
12.12/4.15	    /**
12.12/4.15	     * Check if the last bit of x is &gt; 0.
12.12/4.15	     */

popout

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

job log

popout

actions all output return to Java_Bytecode 2019-04-01 06.50