/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: 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, 313 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 108 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, 74 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(18) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class PlusSwap{
  public static void main(String[] args) {
    Random.args = args;
    int x = Random.random();
    int y = Random.random();
    int z;
    int res = 0;

    while (y > 0) {

      z = x;
      x = y-1;
      y = z;
      res++;

    }

    res = res + x;
  }
}


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:
public class PlusSwap{
  public static void main(String[] args) {
    Random.args = args;
    int x = Random.random();
    int y = Random.random();
    int z;
    int res = 0;

    while (y > 0) {

      z = x;
      x = y-1;
      y = z;
      res++;

    }

    res = res + x;
  }
}


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:
PlusSwap.main([Ljava/lang/String;)V: Graph of 190 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: PlusSwap.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 14 IRulesP rules:
f1535_0_main_LE(EOS(STATIC_1535), i237, i254, i254) -> f1539_0_main_LE(EOS(STATIC_1539), i237, i254, i254) :|: TRUE
f1539_0_main_LE(EOS(STATIC_1539), i237, i254, i254) -> f1543_0_main_Load(EOS(STATIC_1543), i237, i254) :|: i254 > 0
f1543_0_main_Load(EOS(STATIC_1543), i237, i254) -> f1549_0_main_Store(EOS(STATIC_1549), i254, i237) :|: TRUE
f1549_0_main_Store(EOS(STATIC_1549), i254, i237) -> f1555_0_main_Load(EOS(STATIC_1555), i254, i237) :|: TRUE
f1555_0_main_Load(EOS(STATIC_1555), i254, i237) -> f1560_0_main_ConstantStackPush(EOS(STATIC_1560), i237, i254) :|: TRUE
f1560_0_main_ConstantStackPush(EOS(STATIC_1560), i237, i254) -> f1564_0_main_IntArithmetic(EOS(STATIC_1564), i237, i254, 1) :|: TRUE
f1564_0_main_IntArithmetic(EOS(STATIC_1564), i237, i254, matching1) -> f1570_0_main_Store(EOS(STATIC_1570), i237, i254 - 1) :|: i254 > 0 && matching1 = 1
f1570_0_main_Store(EOS(STATIC_1570), i237, i259) -> f1572_0_main_Load(EOS(STATIC_1572), i259, i237) :|: TRUE
f1572_0_main_Load(EOS(STATIC_1572), i259, i237) -> f1575_0_main_Store(EOS(STATIC_1575), i259, i237) :|: TRUE
f1575_0_main_Store(EOS(STATIC_1575), i259, i237) -> f1576_0_main_Inc(EOS(STATIC_1576), i259, i237) :|: TRUE
f1576_0_main_Inc(EOS(STATIC_1576), i259, i237) -> f1580_0_main_JMP(EOS(STATIC_1580), i259, i237) :|: TRUE
f1580_0_main_JMP(EOS(STATIC_1580), i259, i237) -> f1649_0_main_Load(EOS(STATIC_1649), i259, i237) :|: TRUE
f1649_0_main_Load(EOS(STATIC_1649), i259, i237) -> f1530_0_main_Load(EOS(STATIC_1530), i259, i237) :|: TRUE
f1530_0_main_Load(EOS(STATIC_1530), i237, i238) -> f1535_0_main_LE(EOS(STATIC_1535), i237, i238, i238) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f1535_0_main_LE(EOS(STATIC_1535), i237:0, i254:0, i254:0) -> f1535_0_main_LE(EOS(STATIC_1535), i254:0 - 1, i237:0, i237:0) :|: i254:0 > 0
Filtered constant ground arguments:
   f1535_0_main_LE(x1, x2, x3, x4) -> f1535_0_main_LE(x2, x3, x4)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f1535_0_main_LE(x1, x2, x3) -> f1535_0_main_LE(x1, x3)
Finished conversion. Obtained 1 rules.P rules:
f1535_0_main_LE(i237:0, i254:0) -> f1535_0_main_LE(i254:0 - 1, i237:0) :|: i254:0 > 0

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

(8)
Obligation:
Rules:
f1535_0_main_LE(i237:0, i254:0) -> f1535_0_main_LE(i254:0 - 1, i237:0) :|: i254:0 > 0

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

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

(10)
Obligation:
Rules:
f1535_0_main_LE(i237:0, i254:0) -> f1535_0_main_LE(arith, i237:0) :|: i254:0 > 0 && arith = i254:0 - 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1535_0_main_LE(i237:0, i254:0) -> f1535_0_main_LE(arith, i237:0) :|: i254:0 > 0 && arith = i254:0 - 1

Arcs:
(1) -> (1)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f1535_0_main_LE(i237:0, i254:0) -> f1535_0_main_LE(arith, i237:0) :|: i254:0 > 0 && arith = i254:0 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f1535_0_main_LE(i237:0:0, i254:0:0) -> f1535_0_main_LE(i254:0:0 - 1, i237:0:0) :|: i254:0:0 > 0

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

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

(16)
Obligation:
Rules:
f1535_0_main_LE(i237:0:0, i254:0:0) -> f1535_0_main_LE(c, i237:0:0) :|: c = i254:0:0 - 1 && i254:0:0 > 0

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

(17) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1535_0_main_LE(x, x1)] = x^2 + x1^2

The following rules are decreasing:
f1535_0_main_LE(i237:0:0, i254:0:0) -> f1535_0_main_LE(c, i237:0:0) :|: c = i254:0:0 - 1 && i254:0:0 > 0
The following rules are bounded:
f1535_0_main_LE(i237:0:0, i254:0:0) -> f1535_0_main_LE(c, i237:0:0) :|: c = i254:0:0 - 1 && i254:0:0 > 0

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

(18)
YES