details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.17953 seconds
cpu usage	10.5328
user time	9.69147
system time	0.841311
max virtual memory	1.8583192E7
max residence set size	932048.0

stage attributes

key	value
starexec-result	YES

output

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