/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 278 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 96 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, 26 ms]
(16) IntTRS
(17) RankingReductionPairProof [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 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:
f541_0_main_ConstantStackPush(EOS(STATIC_541), i88, i89, i90, i88) -> f542_0_main_GT(EOS(STATIC_542), i88, i89, i90, i88, 100) :|: TRUE
f542_0_main_GT(EOS(STATIC_542), i99, i89, i90, i99, matching1) -> f543_0_main_GT(EOS(STATIC_543), i99, i89, i90, i99, 100) :|: TRUE && matching1 = 100
f543_0_main_GT(EOS(STATIC_543), i99, i89, i90, i99, matching1) -> f550_0_main_Load(EOS(STATIC_550), i99, i89, i90) :|: i99 <= 100 && matching1 = 100
f550_0_main_Load(EOS(STATIC_550), i99, i89, i90) -> f552_0_main_Load(EOS(STATIC_552), i99, i89, i90, i89) :|: TRUE
f552_0_main_Load(EOS(STATIC_552), i99, i89, i90, i89) -> f554_0_main_GT(EOS(STATIC_554), i99, i89, i90, i89, i90) :|: TRUE
f554_0_main_GT(EOS(STATIC_554), i99, i89, i90, i89, i90) -> f559_0_main_GT(EOS(STATIC_559), i99, i89, i90, i89, i90) :|: i89 <= i90
f559_0_main_GT(EOS(STATIC_559), i99, i89, i90, i89, i90) -> f561_0_main_Load(EOS(STATIC_561), i99, i89, i90) :|: i89 <= i90
f561_0_main_Load(EOS(STATIC_561), i99, i89, i90) -> f562_0_main_Store(EOS(STATIC_562), i89, i90, i99) :|: TRUE
f562_0_main_Store(EOS(STATIC_562), i89, i90, i99) -> f563_0_main_Load(EOS(STATIC_563), i89, i90) :|: TRUE
f563_0_main_Load(EOS(STATIC_563), i89, i90) -> f564_0_main_Store(EOS(STATIC_564), i90, i89) :|: TRUE
f564_0_main_Store(EOS(STATIC_564), i90, i89) -> f565_0_main_Load(EOS(STATIC_565), i89, i90) :|: TRUE
f565_0_main_Load(EOS(STATIC_565), i89, i90) -> f566_0_main_ConstantStackPush(EOS(STATIC_566), i89, i90, i89) :|: TRUE
f566_0_main_ConstantStackPush(EOS(STATIC_566), i89, i90, i89) -> f567_0_main_IntArithmetic(EOS(STATIC_567), i89, i90, i89, 1) :|: TRUE
f567_0_main_IntArithmetic(EOS(STATIC_567), i89, i90, i89, matching1) -> f568_0_main_Store(EOS(STATIC_568), i89, i90, i89 + 1) :|: i89 >= 0 && matching1 = 1
f568_0_main_Store(EOS(STATIC_568), i89, i90, i101) -> f569_0_main_Inc(EOS(STATIC_569), i89, i101, i90) :|: TRUE
f569_0_main_Inc(EOS(STATIC_569), i89, i101, i90) -> f570_0_main_JMP(EOS(STATIC_570), i89, i101, i90 + -1) :|: TRUE
f570_0_main_JMP(EOS(STATIC_570), i89, i101, i102) -> f587_0_main_Load(EOS(STATIC_587), i89, i101, i102) :|: TRUE
f587_0_main_Load(EOS(STATIC_587), i89, i101, i102) -> f540_0_main_Load(EOS(STATIC_540), i89, i101, i102) :|: TRUE
f540_0_main_Load(EOS(STATIC_540), i88, i89, i90) -> f541_0_main_ConstantStackPush(EOS(STATIC_541), i88, i89, i90, i88) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f541_0_main_ConstantStackPush(EOS(STATIC_541), i88:0, i89:0, i90:0, i88:0) -> f541_0_main_ConstantStackPush(EOS(STATIC_541), i89:0, i89:0 + 1, i90:0 - 1, i89:0) :|: i88:0 < 101 && i90:0 >= i89:0 && i89:0 > -1
Filtered constant ground arguments:
   f541_0_main_ConstantStackPush(x1, x2, x3, x4, x5) -> f541_0_main_ConstantStackPush(x2, x3, x4, x5)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f541_0_main_ConstantStackPush(x1, x2, x3, x4) -> f541_0_main_ConstantStackPush(x2, x3, x4)
Finished conversion. Obtained 1 rules.P rules:
f541_0_main_ConstantStackPush(i89:0, i90:0, i88:0) -> f541_0_main_ConstantStackPush(i89:0 + 1, i90:0 - 1, i89:0) :|: i90:0 >= i89:0 && i89:0 > -1 && i88:0 < 101

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

(8)
Obligation:
Rules:
f541_0_main_ConstantStackPush(i89:0, i90:0, i88:0) -> f541_0_main_ConstantStackPush(i89:0 + 1, i90:0 - 1, i89:0) :|: i90:0 >= i89:0 && i89:0 > -1 && i88:0 < 101

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

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

(10)
Obligation:
Rules:
f541_0_main_ConstantStackPush(i89:0, i90:0, i88:0) -> f541_0_main_ConstantStackPush(arith, arith1, i89:0) :|: i90:0 >= i89:0 && i89:0 > -1 && i88:0 < 101 && arith = i89:0 + 1 && arith1 = i90:0 - 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f541_0_main_ConstantStackPush(i89:0, i90:0, i88:0) -> f541_0_main_ConstantStackPush(arith, arith1, i89:0) :|: i90:0 >= i89:0 && i89:0 > -1 && i88:0 < 101 && arith = i89:0 + 1 && arith1 = i90:0 - 1

Arcs:
(1) -> (1)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f541_0_main_ConstantStackPush(i89:0, i90:0, i88:0) -> f541_0_main_ConstantStackPush(arith, arith1, i89:0) :|: i90:0 >= i89:0 && i89:0 > -1 && i88:0 < 101 && arith = i89:0 + 1 && arith1 = i90:0 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f541_0_main_ConstantStackPush(i89:0:0, i90:0:0, i88:0:0) -> f541_0_main_ConstantStackPush(i89:0:0 + 1, i90:0:0 - 1, i89:0:0) :|: i90:0:0 >= i89:0:0 && i89:0:0 > -1 && i88:0:0 < 101

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

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

(16)
Obligation:
Rules:
f541_0_main_ConstantStackPush(i89:0:0, i90:0:0, i88:0:0) -> f541_0_main_ConstantStackPush(c, c1, i89:0:0) :|: c1 = i90:0:0 - 1 && c = i89:0:0 + 1 && (i90:0:0 >= i89:0:0 && i89:0:0 > -1 && i88:0:0 < 101)

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

(17) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f541_0_main_ConstantStackPush ] = f541_0_main_ConstantStackPush_2

The following rules are decreasing:
f541_0_main_ConstantStackPush(i89:0:0, i90:0:0, i88:0:0) -> f541_0_main_ConstantStackPush(c, c1, i89:0:0) :|: c1 = i90:0:0 - 1 && c = i89:0:0 + 1 && (i90:0:0 >= i89:0:0 && i89:0:0 > -1 && i88:0:0 < 101)

The following rules are bounded:
f541_0_main_ConstantStackPush(i89:0:0, i90:0:0, i88:0:0) -> f541_0_main_ConstantStackPush(c, c1, i89:0:0) :|: c1 = i90:0:0 - 1 && c = i89:0:0 + 1 && (i90:0:0 >= i89:0:0 && i89:0:0 > -1 && i88:0:0 < 101)


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

(18)
YES