Java_Bytecode pair #487571579

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	n140.star.cs.uiowa.edu
space	Fuhs_13

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.0568740368 seconds
cpu usage	25.505793942
max memory	3.259850752E9

stage attributes

key	value
output-size	52801
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


termination of the given Bare JBC problem could not be shown:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 955 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToIRSProof [SOUND, 132 ms]
        (9) IRSwT
        (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (11) IRSwT
        (12) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (13) IRSwT
        (14) TempFilterProof [SOUND, 1781 ms]
        (15) IRSwT
        (16) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (17) IRSwT
    (18) JBCTerminationSCC
        (19) SCCToIRSProof [SOUND, 19 ms]
        (20) IRSwT
        (21) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) IRSwTTerminationDigraphProof [EQUIVALENT, 74 ms]
        (24) IRSwT
        (25) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (26) IRSwT
        (27) FilterProof [EQUIVALENT, 0 ms]
        (28) IntTRS
        (29) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (30) IntTRS
        (31) IntTRSPeriodicNontermProof [COMPLETE, 11 ms]
        (32) NO
    (33) JBCTerminationSCC
        (34) SCCToIRSProof [SOUND, 13 ms]
        (35) IRSwT
        (36) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (37) IRSwT
        (38) IRSwTTerminationDigraphProof [EQUIVALENT, 8 ms]
        (39) IRSwT
        (40) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (41) IRSwT
        (42) TempFilterProof [SOUND, 39 ms]
        (43) IntTRS
        (44) PolynomialOrderProcessor [EQUIVALENT, 5 ms]
        (45) YES


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
/**
 * Rather inefficient random number generator that can generate infinitely
 * many positive integers from a single positive integer (the
 * "random source") by taking the exponents of its prime factorization.
 */
public class RandomHard {

  // a single natural number, to give rise to infinitely many natural numbers
  // from its prime factorization (if the datatype int had infinite precision)
  final private int source;

  // use the exponent of the nextPrimeIndex-th prime in the unique
  // prime factorization of source as the next "randomly generated"
  // natural number
  private int nextPrimeIndex;
  
  public RandomHard(int source) {
    this.source = source;
    this.nextPrimeIndex = 1;
  }

  public static void main(String[] args) {
    int source = args[0].length();

    if (source < 1) {
      return;
    }
    RandomHard random = new RandomHard(source);
    int limit = args[1].length();
    for (int i = 0; i < limit; ++i) {
      random.getNext();
    }
  }

popout

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

job log

popout

actions all output return to Java_Bytecode