/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, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 137 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) TRUE


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

(0)
Obligation:
need to prove termination of the following program:
public class CyclicPair2 {
	CyclicPair2 next;

    public static void main(String[] args) {
        Random.args = args;
        CyclicPair2 one = new CyclicPair2();
        CyclicPair2 two = new CyclicPair2();
		int rand = Random.random();
        if (rand != 0) {
            one.next = two;
            two.next = one;
        } else {
            one.next = two;
        }

        if (rand == 0) {
            one.run();
        }
    }

    public void run() {
       CyclicPair2 current = this;
       while (current != null)
           current = current.next;
    }
}


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 CyclicPair2 {
	CyclicPair2 next;

    public static void main(String[] args) {
        Random.args = args;
        CyclicPair2 one = new CyclicPair2();
        CyclicPair2 two = new CyclicPair2();
		int rand = Random.random();
        if (rand != 0) {
            one.next = two;
            two.next = one;
        } else {
            one.next = two;
        }

        if (rand == 0) {
            one.run();
        }
    }

    public void run() {
       CyclicPair2 current = this;
       while (current != null)
           current = current.next;
    }
}


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:
CyclicPair2.main([Ljava/lang/String;)V: Graph of 152 nodes with 0 SCCs.





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

(5) TerminationGraphToSCCProof (SOUND)
Proven termination by absence of SCCs
----------------------------------------

(6)
TRUE