5.28/2.18	YES
5.28/2.18	proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
5.28/2.18	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.28/2.18	
5.28/2.18	
5.28/2.18	termination of the given Bare JBC problem could be proven:
5.28/2.18	
5.28/2.18	(0) Bare JBC problem
5.28/2.18	(1) BareJBCToJBCProof [EQUIVALENT, 94 ms]
5.28/2.18	(2) JBC problem
5.28/2.18	(3) JBCToGraph [EQUIVALENT, 346 ms]
5.28/2.18	(4) JBCTerminationGraph
5.28/2.18	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
5.28/2.18	(6) TRUE
5.28/2.18	
5.28/2.18	
5.28/2.18	----------------------------------------
5.28/2.18	
5.28/2.18	(0)
5.28/2.18	Obligation:
5.28/2.18	need to prove termination of the following program:
5.28/2.18	public class Diff {
5.28/2.18	    // We assume that A and B have no repetitions.
5.28/2.18	 static void dif(int[] A, int[] B, int[] D){
5.28/2.18	    int k=0;
5.28/2.18	    int i=0;
5.28/2.18	    int l1=A.length;
5.28/2.18	    int l2=B.length;
5.28/2.18	    boolean found;
5.28/2.18	    while(i<l1){
5.28/2.18	        int j=0;
5.28/2.18	        found=false;
5.28/2.18		while((j<l2)&&(!found)){
5.28/2.18		  if(A[i]==B[j]) found=true;
5.28/2.18		  else j++;
5.28/2.18	         }
5.28/2.18	
5.28/2.18		if (!found) {
5.28/2.18	            D[k]=A[i];
5.28/2.18		    k++;
5.28/2.18		}
5.28/2.18	      i++;
5.28/2.18	    }
5.28/2.18	 }
5.28/2.18	
5.28/2.18	    public static void main(String[] args) {
5.28/2.18		dif(new int[20],new int[20],new int[20]);
5.28/2.18	    }
5.28/2.18	}
5.28/2.18	
5.28/2.18	
5.28/2.18	
5.28/2.18	----------------------------------------
5.28/2.18	
5.28/2.18	(1) BareJBCToJBCProof (EQUIVALENT)
5.28/2.18	initialized classpath
5.28/2.18	----------------------------------------
5.28/2.18	
5.28/2.18	(2)
5.28/2.18	Obligation:
5.28/2.18	need to prove termination of the following program:
5.28/2.18	public class Diff {
5.28/2.18	    // We assume that A and B have no repetitions.
5.28/2.18	 static void dif(int[] A, int[] B, int[] D){
5.28/2.18	    int k=0;
5.28/2.18	    int i=0;
5.28/2.18	    int l1=A.length;
5.28/2.18	    int l2=B.length;
5.28/2.18	    boolean found;
5.28/2.18	    while(i<l1){
5.28/2.18	        int j=0;
5.28/2.18	        found=false;
5.28/2.18		while((j<l2)&&(!found)){
5.28/2.18		  if(A[i]==B[j]) found=true;
5.28/2.18		  else j++;
5.28/2.18	         }
5.28/2.18	
5.28/2.18		if (!found) {
5.28/2.18	            D[k]=A[i];
5.28/2.18		    k++;
5.28/2.18		}
5.28/2.18	      i++;
5.28/2.18	    }
5.28/2.18	 }
5.28/2.18	
5.28/2.18	    public static void main(String[] args) {
5.28/2.18		dif(new int[20],new int[20],new int[20]);
5.28/2.18	    }
5.28/2.18	}
5.28/2.18	
5.28/2.18	
5.28/2.18	
5.28/2.18	----------------------------------------
5.28/2.18	
5.28/2.18	(3) JBCToGraph (EQUIVALENT)
5.28/2.18	Constructed TerminationGraph.
5.28/2.18	----------------------------------------
5.28/2.18	
5.28/2.18	(4)
5.28/2.18	Obligation:
5.28/2.18	Termination Graph based on JBC Program:
5.28/2.18	Diff.main([Ljava/lang/String;)V: Graph of 643 nodes with 0 SCCs.
5.28/2.18	
5.28/2.18	
5.28/2.18	
5.28/2.18	
5.28/2.18	
5.28/2.18	----------------------------------------
5.28/2.18	
5.28/2.18	(5) TerminationGraphToSCCProof (SOUND)
5.28/2.18	Proven termination by absence of SCCs
5.28/2.18	----------------------------------------
5.28/2.18	
5.28/2.18	(6)
5.28/2.18	TRUE
5.35/2.22	EOF