Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315712
details
property
value
status
complete
benchmark
RandomHard.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n093.star.cs.uiowa.edu
space
Fuhs_13
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
13.8881 seconds
cpu usage
25.7533
user time
24.5514
system time
1.20186
max virtual memory
1.9391724E7
max residence set size
3139960.0
stage attributes
key
value
starexec-result
MAYBE
output
25.67/13.83 MAYBE 25.67/13.84 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 25.67/13.84 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 25.67/13.84 25.67/13.84 25.67/13.84 termination of the given Bare JBC problem could not be shown: 25.67/13.84 25.67/13.84 (0) Bare JBC problem 25.67/13.84 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 25.67/13.84 (2) JBC problem 25.67/13.84 (3) JBCToGraph [EQUIVALENT, 892 ms] 25.67/13.84 (4) JBCTerminationGraph 25.67/13.84 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 25.67/13.84 (6) AND 25.67/13.84 (7) JBCTerminationSCC 25.67/13.84 (8) SCCToIRSProof [SOUND, 120 ms] 25.67/13.84 (9) IRSwT 25.67/13.84 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 25.67/13.84 (11) IRSwT 25.67/13.84 (12) IntTRSCompressionProof [EQUIVALENT, 0 ms] 25.67/13.84 (13) IRSwT 25.67/13.84 (14) TempFilterProof [SOUND, 1579 ms] 25.67/13.84 (15) IRSwT 25.67/13.84 (16) IntTRSCompressionProof [EQUIVALENT, 0 ms] 25.67/13.84 (17) IRSwT 25.67/13.84 (18) JBCTerminationSCC 25.67/13.84 (19) SCCToIRSProof [SOUND, 27 ms] 25.67/13.84 (20) IRSwT 25.67/13.84 (21) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 25.67/13.84 (22) IRSwT 25.67/13.84 (23) IRSwTTerminationDigraphProof [EQUIVALENT, 107 ms] 25.67/13.84 (24) IRSwT 25.67/13.84 (25) IntTRSCompressionProof [EQUIVALENT, 0 ms] 25.67/13.84 (26) IRSwT 25.67/13.84 (27) FilterProof [EQUIVALENT, 0 ms] 25.67/13.84 (28) IntTRS 25.67/13.84 (29) IntTRSCompressionProof [EQUIVALENT, 0 ms] 25.67/13.84 (30) IntTRS 25.67/13.84 (31) IntTRSPeriodicNontermProof [COMPLETE, 10 ms] 25.67/13.84 (32) NO 25.67/13.84 (33) JBCTerminationSCC 25.67/13.84 (34) SCCToIRSProof [SOUND, 22 ms] 25.67/13.84 (35) IRSwT 25.67/13.84 (36) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 25.67/13.84 (37) IRSwT 25.67/13.84 (38) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] 25.67/13.84 (39) IRSwT 25.67/13.84 (40) IntTRSCompressionProof [EQUIVALENT, 0 ms] 25.67/13.84 (41) IRSwT 25.67/13.84 (42) TempFilterProof [SOUND, 37 ms] 25.67/13.84 (43) IntTRS 25.67/13.84 (44) PolynomialOrderProcessor [EQUIVALENT, 15 ms] 25.67/13.84 (45) YES 25.67/13.84 25.67/13.84 25.67/13.84 ---------------------------------------- 25.67/13.84 25.67/13.84 (0) 25.67/13.84 Obligation: 25.67/13.84 need to prove termination of the following program: 25.67/13.84 /** 25.67/13.84 * Rather inefficient random number generator that can generate infinitely 25.67/13.84 * many positive integers from a single positive integer (the 25.67/13.84 * "random source") by taking the exponents of its prime factorization. 25.67/13.84 */ 25.67/13.84 public class RandomHard { 25.67/13.84 25.67/13.84 // a single natural number, to give rise to infinitely many natural numbers 25.67/13.84 // from its prime factorization (if the datatype int had infinite precision) 25.67/13.84 final private int source; 25.67/13.84 25.67/13.84 // use the exponent of the nextPrimeIndex-th prime in the unique 25.67/13.84 // prime factorization of source as the next "randomly generated" 25.67/13.84 // natural number 25.67/13.84 private int nextPrimeIndex; 25.67/13.84 25.67/13.84 public RandomHard(int source) { 25.67/13.84 this.source = source; 25.67/13.84 this.nextPrimeIndex = 1; 25.67/13.84 } 25.67/13.84 25.67/13.84 public static void main(String[] args) { 25.67/13.84 int source = args[0].length(); 25.67/13.84 25.67/13.84 if (source < 1) { 25.67/13.84 return; 25.67/13.84 } 25.67/13.84 RandomHard random = new RandomHard(source); 25.67/13.84 int limit = args[1].length(); 25.67/13.84 for (int i = 0; i < limit; ++i) { 25.67/13.84 random.getNext(); 25.67/13.84 } 25.67/13.84 } 25.67/13.84 25.67/13.84 /** @return the next (random!) natural number */ 25.67/13.84 public int getNext() { 25.67/13.84 int prime = findKthPrime(this.nextPrimeIndex); 25.67/13.84 ++this.nextPrimeIndex; 25.67/13.84 int res = getPowerOfKInSource(prime); 25.67/13.84 return res;
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