Java_Bytecode 2019-04-01 06.50 pair #433315801

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.81966 seconds
cpu usage	6.74596
user time	6.39737
system time	0.348584
max virtual memory	2.0811716E7
max residence set size	489552.0

stage attributes

key	value
starexec-result	YES

output

6.47/2.62	YES
6.47/2.64	proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
6.47/2.64	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.47/2.64	
6.47/2.64	
6.47/2.64	termination of the given Bare JBC problem could be proven:
6.47/2.64	
6.47/2.64	(0) Bare JBC problem
6.47/2.64	(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
6.47/2.64	(2) JBC problem
6.47/2.64	(3) JBCToGraph [EQUIVALENT, 280 ms]
6.47/2.64	(4) JBCTerminationGraph
6.47/2.64	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
6.47/2.64	(6) JBCTerminationSCC
6.47/2.64	(7) SCCToIRSProof [SOUND, 54 ms]
6.47/2.64	(8) IRSwT
6.47/2.64	(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
6.47/2.64	(10) IRSwT
6.47/2.64	(11) IRSwTTerminationDigraphProof [EQUIVALENT, 41 ms]
6.47/2.64	(12) IRSwT
6.47/2.64	(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
6.47/2.64	(14) IRSwT
6.47/2.64	(15) TempFilterProof [SOUND, 56 ms]
6.47/2.64	(16) IntTRS
6.47/2.64	(17) RankingReductionPairProof [EQUIVALENT, 0 ms]
6.47/2.64	(18) IntTRS
6.47/2.64	(19) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
6.47/2.64	(20) YES
6.47/2.64	
6.47/2.64	
6.47/2.64	----------------------------------------
6.47/2.64	
6.47/2.64	(0)
6.47/2.64	Obligation:
6.47/2.64	need to prove termination of the following program:
6.47/2.64	/**
6.47/2.64	 * Example taken from "A Term Rewriting Approach to the Automated Termination
6.47/2.64	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
6.47/2.64	 * and converted to Java.
6.47/2.64	 */
6.47/2.64	
6.47/2.64	public class PastaA1 {
6.47/2.64	    public static void main(String[] args) {
6.47/2.64	        Random.args = args;
6.47/2.64	        int x = Random.random();
6.47/2.64	        while (x > 0) {
6.47/2.64	            int y = 0;
6.47/2.64	            while (y < x) {
6.47/2.64	                y++;
6.47/2.64	            }
6.47/2.64	            x--;
6.47/2.64	        }
6.47/2.64	    }
6.47/2.64	}
6.47/2.64	
6.47/2.64	
6.47/2.64	public class Random {
6.47/2.64	  static String[] args;
6.47/2.64	  static int index = 0;
6.47/2.64	
6.47/2.64	  public static int random() {
6.47/2.64	    String string = args[index];
6.47/2.64	    index++;
6.47/2.64	    return string.length();
6.47/2.64	  }
6.47/2.64	}
6.47/2.64	
6.47/2.64	
6.47/2.64	
6.47/2.64	----------------------------------------
6.47/2.64	
6.47/2.64	(1) BareJBCToJBCProof (EQUIVALENT)
6.47/2.64	initialized classpath
6.47/2.64	----------------------------------------
6.47/2.64	
6.47/2.64	(2)
6.47/2.64	Obligation:
6.47/2.64	need to prove termination of the following program:
6.47/2.64	/**
6.47/2.64	 * Example taken from "A Term Rewriting Approach to the Automated Termination
6.47/2.64	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
6.47/2.64	 * and converted to Java.
6.47/2.64	 */
6.47/2.64	
6.47/2.64	public class PastaA1 {
6.47/2.64	    public static void main(String[] args) {
6.47/2.64	        Random.args = args;
6.47/2.64	        int x = Random.random();
6.47/2.64	        while (x > 0) {
6.47/2.64	            int y = 0;
6.47/2.64	            while (y < x) {
6.47/2.64	                y++;
6.47/2.64	            }
6.47/2.64	            x--;
6.47/2.64	        }
6.47/2.64	    }
6.47/2.64	}
6.47/2.64	
6.47/2.64	
6.47/2.64	public class Random {

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