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


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


YES
proof of /export/starexec/sandbox/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, 287 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 71 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 20 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 43 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 16 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 PastaC7 {
    public static void main(String[] args) {
        Random.args = args;
        int i = Random.random();
        int j = Random.random();
        int k = Random.random();

        while (i <= 100 && j <= k) {
            int t = i;
            i = j;
            j = i + 1;
            k--;
        }
    }
}


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 PastaC7 {
    public static void main(String[] args) {
        Random.args = args;
        int i = Random.random();
        int j = Random.random();
        int k = Random.random();

        while (i <= 100 && j <= k) {
            int t = i;
            i = j;
            j = i + 1;
            k--;
        }
    }
}


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:
PastaC7.main([Ljava/lang/String;)V: Graph of 256 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: PastaC7.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 19 IRulesP rules:
f542_0_main_ConstantStackPush(EOS(STATIC_542), i84, i85, i86, i84) -> f543_0_main_GT(EOS(STATIC_543), i84, i85, i86, i84, 100) :|: TRUE
f543_0_main_GT(EOS(STATIC_543), i95, i85, i86, i95, matching1) -> f544_0_main_GT(EOS(STATIC_544), i95, i85, i86, i95, 100) :|: TRUE && matching1 = 100
f544_0_main_GT(EOS(STATIC_544), i95, i85, i86, i95, matching1) -> f549_0_main_Load(EOS(STATIC_549), i95, i85, i86) :|: i95 <= 100 && matching1 = 100
f549_0_main_Load(EOS(STATIC_549), i95, i85, i86) -> f553_0_main_Load(EOS(STATIC_553), i95, i85, i86, i85) :|: TRUE
f553_0_main_Load(EOS(STATIC_553), i95, i85, i86, i85) -> f555_0_main_GT(EOS(STATIC_555), i95, i85, i86, i85, i86) :|: TRUE
f555_0_main_GT(EOS(STATIC_555), i95, i85, i86, i85, i86) -> f557_0_main_GT(EOS(STATIC_557), i95, i85, i86, i85, i86) :|: i85 <= i86
f557_0_main_GT(EOS(STATIC_557), i95, i85, i86, i85, i86) -> f562_0_main_Load(EOS(STATIC_562), i95, i85, i86) :|: i85 <= i86
f562_0_main_Load(EOS(STATIC_562), i95, i85, i86) -> f563_0_main_Store(EOS(STATIC_563), i85, i86, i95) :|: TRUE
f563_0_main_Store(EOS(STATIC_563), i85, i86, i95) -> f565_0_main_Load(EOS(STATIC_565), i85, i86) :|: TRUE
f565_0_main_Load(EOS(STATIC_565), i85, i86) -> f568_0_main_Store(EOS(STATIC_568), i86, i85) :|: TRUE
f568_0_main_Store(EOS(STATIC_568), i86, i85) -> f570_0_main_Load(EOS(STATIC_570), i85, i86) :|: TRUE
f570_0_main_Load(EOS(STATIC_570), i85, i86) -> f573_0_main_ConstantStackPush(EOS(STATIC_573), i85, i86, i85) :|: TRUE
f573_0_main_ConstantStackPush(EOS(STATIC_573), i85, i86, i85) -> f575_0_main_IntArithmetic(EOS(STATIC_575), i85, i86, i85, 1) :|: TRUE
f575_0_main_IntArithmetic(EOS(STATIC_575), i85, i86, i85, matching1) -> f577_0_main_Store(EOS(STATIC_577), i85, i86, i85 + 1) :|: i85 >= 0 && matching1 = 1
f577_0_main_Store(EOS(STATIC_577), i85, i86, i97) -> f580_0_main_Inc(EOS(STATIC_580), i85, i97, i86) :|: TRUE
f580_0_main_Inc(EOS(STATIC_580), i85, i97, i86) -> f582_0_main_JMP(EOS(STATIC_582), i85, i97, i86 + -1) :|: TRUE
f582_0_main_JMP(EOS(STATIC_582), i85, i97, i100) -> f593_0_main_Load(EOS(STATIC_593), i85, i97, i100) :|: TRUE
f593_0_main_Load(EOS(STATIC_593), i85, i97, i100) -> f541_0_main_Load(EOS(STATIC_541), i85, i97, i100) :|: TRUE
f541_0_main_Load(EOS(STATIC_541), i84, i85, i86) -> f542_0_main_ConstantStackPush(EOS(STATIC_542), i84, i85, i86, i84) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f542_0_main_ConstantStackPush(EOS(STATIC_542), i84:0, i85:0, i86:0, i84:0) -> f542_0_main_ConstantStackPush(EOS(STATIC_542), i85:0, i85:0 + 1, i86:0 - 1, i85:0) :|: i84:0 < 101 && i86:0 >= i85:0 && i85:0 > -1
Filtered constant ground arguments:
   f542_0_main_ConstantStackPush(x1, x2, x3, x4, x5) -> f542_0_main_ConstantStackPush(x2, x3, x4, x5)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f542_0_main_ConstantStackPush(x1, x2, x3, x4) -> f542_0_main_ConstantStackPush(x2, x3, x4)
Finished conversion. Obtained 1 rules.P rules:
f542_0_main_ConstantStackPush(i85:0, i86:0, i84:0) -> f542_0_main_ConstantStackPush(i85:0 + 1, i86:0 - 1, i85:0) :|: i86:0 >= i85:0 && i85:0 > -1 && i84:0 < 101

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

(8)
Obligation:
Rules:
f542_0_main_ConstantStackPush(i85:0, i86:0, i84:0) -> f542_0_main_ConstantStackPush(i85:0 + 1, i86:0 - 1, i85:0) :|: i86:0 >= i85:0 && i85:0 > -1 && i84:0 < 101

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

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

(10)
Obligation:
Rules:
f542_0_main_ConstantStackPush(i85:0, i86:0, i84:0) -> f542_0_main_ConstantStackPush(arith, arith1, i85:0) :|: i86:0 >= i85:0 && i85:0 > -1 && i84:0 < 101 && arith = i85:0 + 1 && arith1 = i86:0 - 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f542_0_main_ConstantStackPush(i85:0, i86:0, i84:0) -> f542_0_main_ConstantStackPush(arith, arith1, i85:0) :|: i86:0 >= i85:0 && i85:0 > -1 && i84:0 < 101 && arith = i85:0 + 1 && arith1 = i86:0 - 1

Arcs:
(1) -> (1)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f542_0_main_ConstantStackPush(i85:0, i86:0, i84:0) -> f542_0_main_ConstantStackPush(arith, arith1, i85:0) :|: i86:0 >= i85:0 && i85:0 > -1 && i84:0 < 101 && arith = i85:0 + 1 && arith1 = i86:0 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f542_0_main_ConstantStackPush(i85:0:0, i86:0:0, i84:0:0) -> f542_0_main_ConstantStackPush(i85:0:0 + 1, i86:0:0 - 1, i85:0:0) :|: i86:0:0 >= i85:0:0 && i85:0:0 > -1 && i84:0:0 < 101

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

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

(16)
Obligation:
Rules:
f542_0_main_ConstantStackPush(i85:0:0, i86:0:0, i84:0:0) -> f542_0_main_ConstantStackPush(c, c1, i85:0:0) :|: c1 = i86:0:0 - 1 && c = i85:0:0 + 1 && (i86:0:0 >= i85:0:0 && i85:0:0 > -1 && i84:0:0 < 101)

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

(17) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f542_0_main_ConstantStackPush(x, x1, x2)] = x1

The following rules are decreasing:
f542_0_main_ConstantStackPush(i85:0:0, i86:0:0, i84:0:0) -> f542_0_main_ConstantStackPush(c, c1, i85:0:0) :|: c1 = i86:0:0 - 1 && c = i85:0:0 + 1 && (i86:0:0 >= i85:0:0 && i85:0:0 > -1 && i84:0:0 < 101)
The following rules are bounded:
f542_0_main_ConstantStackPush(i85:0:0, i86:0:0, i84:0:0) -> f542_0_main_ConstantStackPush(c, c1, i85:0:0) :|: c1 = i86:0:0 - 1 && c = i85:0:0 + 1 && (i86:0:0 >= i85:0:0 && i85:0:0 > -1 && i84:0:0 < 101)

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

(18)
YES