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


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


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


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 314 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 97 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 15 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(18) YES


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

(0)
Obligation:
need to prove termination of the following program:
/**
 * Example taken from "A Term Rewriting Approach to the Automated Termination
 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
 * and converted to Java.
 */

public class PastaA5 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

        while (x >= y + 1) {
            y++;
        }
    }
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}



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

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
/**
 * Example taken from "A Term Rewriting Approach to the Automated Termination
 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
 * and converted to Java.
 */

public class PastaA5 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

        while (x >= y + 1) {
            y++;
        }
    }
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}



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

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
PastaA5.main([Ljava/lang/String;)V: Graph of 177 nodes with 1 SCC.





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

(5) TerminationGraphToSCCProof (SOUND)
Splitted TerminationGraph to 1 SCCs.
----------------------------------------

(6)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: PastaA5.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:

*Marker field analysis yielded the following relations that could be markers:

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

(7) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 9 IRulesP rules:
f345_0_main_Load(EOS(STATIC_345), i49, i50, i49) -> f348_0_main_ConstantStackPush(EOS(STATIC_348), i49, i50, i49, i50) :|: TRUE
f348_0_main_ConstantStackPush(EOS(STATIC_348), i49, i50, i49, i50) -> f351_0_main_IntArithmetic(EOS(STATIC_351), i49, i50, i49, i50, 1) :|: TRUE
f351_0_main_IntArithmetic(EOS(STATIC_351), i49, i50, i49, i50, matching1) -> f355_0_main_LT(EOS(STATIC_355), i49, i50, i49, i50 + 1) :|: i50 >= 0 && matching1 = 1
f355_0_main_LT(EOS(STATIC_355), i49, i50, i49, i53) -> f359_0_main_LT(EOS(STATIC_359), i49, i50, i49, i53) :|: i49 >= i53
f359_0_main_LT(EOS(STATIC_359), i49, i50, i49, i53) -> f372_0_main_Inc(EOS(STATIC_372), i49, i50) :|: i49 >= i53
f372_0_main_Inc(EOS(STATIC_372), i49, i50) -> f376_0_main_JMP(EOS(STATIC_376), i49, i50 + 1) :|: TRUE
f376_0_main_JMP(EOS(STATIC_376), i49, i56) -> f381_0_main_Load(EOS(STATIC_381), i49, i56) :|: TRUE
f381_0_main_Load(EOS(STATIC_381), i49, i56) -> f341_0_main_Load(EOS(STATIC_341), i49, i56) :|: TRUE
f341_0_main_Load(EOS(STATIC_341), i49, i50) -> f345_0_main_Load(EOS(STATIC_345), i49, i50, i49) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f345_0_main_Load(EOS(STATIC_345), i49:0, i50:0, i49:0) -> f345_0_main_Load(EOS(STATIC_345), i49:0, i50:0 + 1, i49:0) :|: i50:0 > -1 && i50:0 + 1 <= i49:0
Filtered constant ground arguments:
   f345_0_main_Load(x1, x2, x3, x4) -> f345_0_main_Load(x2, x3, x4)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f345_0_main_Load(x1, x2, x3) -> f345_0_main_Load(x2, x3)
Finished conversion. Obtained 1 rules.P rules:
f345_0_main_Load(i50:0, i49:0) -> f345_0_main_Load(i50:0 + 1, i49:0) :|: i50:0 > -1 && i50:0 + 1 <= i49:0

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

(8)
Obligation:
Rules:
f345_0_main_Load(i50:0, i49:0) -> f345_0_main_Load(i50:0 + 1, i49:0) :|: i50:0 > -1 && i50:0 + 1 <= i49:0

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

(9) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(10)
Obligation:
Rules:
f345_0_main_Load(i50:0, i49:0) -> f345_0_main_Load(arith, i49:0) :|: i50:0 > -1 && i50:0 + 1 <= i49:0 && arith = i50:0 + 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f345_0_main_Load(i50:0, i49:0) -> f345_0_main_Load(arith, i49:0) :|: i50:0 > -1 && i50:0 + 1 <= i49:0 && arith = i50:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!
----------------------------------------

(12)
Obligation:

Termination digraph:
Nodes:
(1) f345_0_main_Load(i50:0, i49:0) -> f345_0_main_Load(arith, i49:0) :|: i50:0 > -1 && i50:0 + 1 <= i49:0 && arith = i50:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

(13) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(14)
Obligation:
Rules:
f345_0_main_Load(i50:0:0, i49:0:0) -> f345_0_main_Load(i50:0:0 + 1, i49:0:0) :|: i50:0:0 > -1 && i50:0:0 + 1 <= i49:0:0

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

(15) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f345_0_main_Load(INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(16)
Obligation:
Rules:
f345_0_main_Load(i50:0:0, i49:0:0) -> f345_0_main_Load(c, i49:0:0) :|: c = i50:0:0 + 1 && (i50:0:0 > -1 && i50:0:0 + 1 <= i49:0:0)

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

(17) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f345_0_main_Load(x, x1)] = -x + x1

The following rules are decreasing:
f345_0_main_Load(i50:0:0, i49:0:0) -> f345_0_main_Load(c, i49:0:0) :|: c = i50:0:0 + 1 && (i50:0:0 > -1 && i50:0:0 + 1 <= i49:0:0)
The following rules are bounded:
f345_0_main_Load(i50:0:0, i49:0:0) -> f345_0_main_Load(c, i49:0:0) :|: c = i50:0:0 + 1 && (i50:0:0 > -1 && i50:0:0 + 1 <= i49:0:0)

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

(18)
YES