Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315755
details
property
value
status
complete
benchmark
PastaC1.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.90972 seconds
cpu usage
7.60826
user time
7.19845
system time
0.409807
max virtual memory
2.0008848E7
max residence set size
579676.0
stage attributes
key
value
starexec-result
YES
output
7.32/2.81 YES 7.32/2.86 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 7.32/2.86 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 7.32/2.86 7.32/2.86 7.32/2.86 termination of the given Bare JBC problem could be proven: 7.32/2.86 7.32/2.86 (0) Bare JBC problem 7.32/2.86 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 7.32/2.86 (2) JBC problem 7.32/2.86 (3) JBCToGraph [EQUIVALENT, 367 ms] 7.32/2.86 (4) JBCTerminationGraph 7.32/2.86 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 7.32/2.86 (6) JBCTerminationSCC 7.32/2.86 (7) SCCToIRSProof [SOUND, 109 ms] 7.32/2.86 (8) IRSwT 7.32/2.86 (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 7.32/2.86 (10) IRSwT 7.32/2.86 (11) IRSwTTerminationDigraphProof [EQUIVALENT, 54 ms] 7.32/2.86 (12) IRSwT 7.32/2.86 (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] 7.32/2.86 (14) IRSwT 7.32/2.86 (15) TempFilterProof [SOUND, 49 ms] 7.32/2.86 (16) IntTRS 7.32/2.86 (17) PolynomialOrderProcessor [EQUIVALENT, 1 ms] 7.32/2.86 (18) IntTRS 7.32/2.86 (19) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 7.32/2.86 (20) YES 7.32/2.86 7.32/2.86 7.32/2.86 ---------------------------------------- 7.32/2.86 7.32/2.86 (0) 7.32/2.86 Obligation: 7.32/2.86 need to prove termination of the following program: 7.32/2.86 /** 7.32/2.86 * Example taken from "A Term Rewriting Approach to the Automated Termination 7.32/2.86 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf) 7.32/2.86 * and converted to Java. 7.32/2.86 */ 7.32/2.86 7.32/2.86 public class PastaC1 { 7.32/2.86 public static void main(String[] args) { 7.32/2.86 Random.args = args; 7.32/2.86 int x = Random.random(); 7.32/2.86 7.32/2.86 while (x >= 0) { 7.32/2.86 int y = 1; 7.32/2.86 while (x > y) { 7.32/2.86 y = 2*y; 7.32/2.86 } 7.32/2.86 x--; 7.32/2.86 } 7.32/2.86 } 7.32/2.86 } 7.32/2.86 7.32/2.86 7.32/2.86 public class Random { 7.32/2.86 static String[] args; 7.32/2.86 static int index = 0; 7.32/2.86 7.32/2.86 public static int random() { 7.32/2.86 String string = args[index]; 7.32/2.86 index++; 7.32/2.86 return string.length(); 7.32/2.86 } 7.32/2.86 } 7.32/2.86 7.32/2.86 7.32/2.86 7.32/2.86 ---------------------------------------- 7.32/2.86 7.32/2.86 (1) BareJBCToJBCProof (EQUIVALENT) 7.32/2.86 initialized classpath 7.32/2.86 ---------------------------------------- 7.32/2.86 7.32/2.86 (2) 7.32/2.86 Obligation: 7.32/2.86 need to prove termination of the following program: 7.32/2.86 /** 7.32/2.86 * Example taken from "A Term Rewriting Approach to the Automated Termination 7.32/2.86 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf) 7.32/2.86 * and converted to Java. 7.32/2.86 */ 7.32/2.86 7.32/2.86 public class PastaC1 { 7.32/2.86 public static void main(String[] args) { 7.32/2.86 Random.args = args; 7.32/2.86 int x = Random.random(); 7.32/2.86 7.32/2.86 while (x >= 0) { 7.32/2.86 int y = 1; 7.32/2.86 while (x > y) { 7.32/2.86 y = 2*y; 7.32/2.86 } 7.32/2.86 x--; 7.32/2.86 } 7.32/2.86 } 7.32/2.86 } 7.32/2.86
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