5.64/2.38	YES
5.64/2.39	proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
5.64/2.39	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.64/2.39	
5.64/2.39	
5.64/2.39	termination of the given Bare JBC problem could be proven:
5.64/2.39	
5.64/2.39	(0) Bare JBC problem
5.64/2.39	(1) BareJBCToJBCProof [EQUIVALENT, 95 ms]
5.64/2.39	(2) JBC problem
5.64/2.39	(3) JBCToGraph [EQUIVALENT, 264 ms]
5.64/2.39	(4) JBCTerminationGraph
5.64/2.39	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
5.64/2.39	(6) JBCTerminationSCC
5.64/2.39	(7) SCCToIRSProof [SOUND, 59 ms]
5.64/2.39	(8) IRSwT
5.64/2.39	(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
5.64/2.39	(10) IRSwT
5.64/2.39	(11) IRSwTTerminationDigraphProof [EQUIVALENT, 31 ms]
5.64/2.39	(12) IRSwT
5.64/2.39	(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
5.64/2.39	(14) IRSwT
5.64/2.39	(15) TempFilterProof [SOUND, 40 ms]
5.64/2.39	(16) IntTRS
5.64/2.39	(17) PolynomialOrderProcessor [EQUIVALENT, 15 ms]
5.64/2.39	(18) YES
5.64/2.39	
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(0)
5.64/2.39	Obligation:
5.64/2.39	need to prove termination of the following program:
5.64/2.39	/**
5.64/2.39	 * Example taken from "A Term Rewriting Approach to the Automated Termination
5.64/2.39	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
5.64/2.39	 * and converted to Java.
5.64/2.39	 */
5.64/2.39	
5.64/2.39	public class PastaB2 {
5.64/2.39	    public static void main(String[] args) {
5.64/2.39	        Random.args = args;
5.64/2.39	        int x = Random.random();
5.64/2.39	        int y = Random.random();
5.64/2.39	
5.64/2.39	        while (x > y) {
5.64/2.39	            x--;
5.64/2.39	            y++;
5.64/2.39	        }
5.64/2.39	    }
5.64/2.39	}
5.64/2.39	
5.64/2.39	
5.64/2.39	public class Random {
5.64/2.39	  static String[] args;
5.64/2.39	  static int index = 0;
5.64/2.39	
5.64/2.39	  public static int random() {
5.64/2.39	    String string = args[index];
5.64/2.39	    index++;
5.64/2.39	    return string.length();
5.64/2.39	  }
5.64/2.39	}
5.64/2.39	
5.64/2.39	
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(1) BareJBCToJBCProof (EQUIVALENT)
5.64/2.39	initialized classpath
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(2)
5.64/2.39	Obligation:
5.64/2.39	need to prove termination of the following program:
5.64/2.39	/**
5.64/2.39	 * Example taken from "A Term Rewriting Approach to the Automated Termination
5.64/2.39	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
5.64/2.39	 * and converted to Java.
5.64/2.39	 */
5.64/2.39	
5.64/2.39	public class PastaB2 {
5.64/2.39	    public static void main(String[] args) {
5.64/2.39	        Random.args = args;
5.64/2.39	        int x = Random.random();
5.64/2.39	        int y = Random.random();
5.64/2.39	
5.64/2.39	        while (x > y) {
5.64/2.39	            x--;
5.64/2.39	            y++;
5.64/2.39	        }
5.64/2.39	    }
5.64/2.39	}
5.64/2.39	
5.64/2.39	
5.64/2.39	public class Random {
5.64/2.39	  static String[] args;
5.64/2.39	  static int index = 0;
5.64/2.39	
5.64/2.39	  public static int random() {
5.64/2.39	    String string = args[index];
5.64/2.39	    index++;
5.64/2.39	    return string.length();
5.64/2.39	  }
5.64/2.39	}
5.64/2.39	
5.64/2.39	
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(3) JBCToGraph (EQUIVALENT)
5.64/2.39	Constructed TerminationGraph.
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(4)
5.64/2.39	Obligation:
5.64/2.39	Termination Graph based on JBC Program:
5.64/2.39	PastaB2.main([Ljava/lang/String;)V: Graph of 175 nodes with 1 SCC.
5.64/2.39	
5.64/2.39	
5.64/2.39	
5.64/2.39	
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(5) TerminationGraphToSCCProof (SOUND)
5.64/2.39	Splitted TerminationGraph to 1 SCCs.
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(6)
5.64/2.39	Obligation:
5.64/2.39	SCC of termination graph based on JBC Program.
5.64/2.39	SCC contains nodes from the following methods: PastaB2.main([Ljava/lang/String;)V
5.64/2.39	SCC calls the following helper methods: 
5.64/2.39	Performed SCC analyses:
5.64/2.39	*Used field analysis yielded the following read fields:
5.64/2.39	
5.64/2.39	*Marker field analysis yielded the following relations that could be markers:
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(7) SCCToIRSProof (SOUND)
5.64/2.39	Transformed FIGraph SCCs to intTRSs. Log: 
5.64/2.39	Generated rules. Obtained 8 IRulesP rules:
5.64/2.39	f282_0_main_Load(EOS(STATIC_282), i17, i42, i17) -> f285_0_main_LE(EOS(STATIC_285), i17, i42, i17, i42) :|: TRUE
5.64/2.39	f285_0_main_LE(EOS(STATIC_285), i17, i42, i17, i42) -> f289_0_main_LE(EOS(STATIC_289), i17, i42, i17, i42) :|: i17 > i42
5.64/2.39	f289_0_main_LE(EOS(STATIC_289), i17, i42, i17, i42) -> f298_0_main_Inc(EOS(STATIC_298), i17, i42) :|: i17 > i42
5.64/2.39	f298_0_main_Inc(EOS(STATIC_298), i17, i42) -> f312_0_main_Inc(EOS(STATIC_312), i17 + -1, i42) :|: TRUE
5.64/2.39	f312_0_main_Inc(EOS(STATIC_312), i46, i42) -> f321_0_main_JMP(EOS(STATIC_321), i46, i42 + 1) :|: TRUE
5.64/2.39	f321_0_main_JMP(EOS(STATIC_321), i46, i47) -> f346_0_main_Load(EOS(STATIC_346), i46, i47) :|: TRUE
5.64/2.39	f346_0_main_Load(EOS(STATIC_346), i46, i47) -> f279_0_main_Load(EOS(STATIC_279), i46, i47) :|: TRUE
5.64/2.39	f279_0_main_Load(EOS(STATIC_279), i17, i42) -> f282_0_main_Load(EOS(STATIC_282), i17, i42, i17) :|: TRUE
5.64/2.39	Combined rules. Obtained 1 IRulesP rules:
5.64/2.39	f282_0_main_Load(EOS(STATIC_282), i17:0, i42:0, i17:0) -> f282_0_main_Load(EOS(STATIC_282), i17:0 - 1, i42:0 + 1, i17:0 - 1) :|: i42:0 < i17:0
5.64/2.39	Filtered constant ground arguments:
5.64/2.39	   f282_0_main_Load(x1, x2, x3, x4) -> f282_0_main_Load(x2, x3, x4)
5.64/2.39	   EOS(x1) -> EOS
5.64/2.39	Filtered duplicate arguments:
5.64/2.39	   f282_0_main_Load(x1, x2, x3) -> f282_0_main_Load(x2, x3)
5.64/2.39	Finished conversion. Obtained 1 rules.P rules:
5.64/2.39	f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(i42:0 + 1, i17:0 - 1) :|: i42:0 < i17:0
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(8)
5.64/2.39	Obligation:
5.64/2.39	Rules:
5.64/2.39	f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(i42:0 + 1, i17:0 - 1) :|: i42:0 < i17:0
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(9) IRSFormatTransformerProof (EQUIVALENT)
5.64/2.39	Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(10)
5.64/2.39	Obligation:
5.64/2.39	Rules:
5.64/2.39	f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(arith, arith1) :|: i42:0 < i17:0 && arith = i42:0 + 1 && arith1 = i17:0 - 1
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(11) IRSwTTerminationDigraphProof (EQUIVALENT)
5.64/2.39	Constructed termination digraph!
5.64/2.39	Nodes:
5.64/2.39	(1) f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(arith, arith1) :|: i42:0 < i17:0 && arith = i42:0 + 1 && arith1 = i17:0 - 1
5.64/2.39	
5.64/2.39	Arcs:
5.64/2.39	(1) -> (1)
5.64/2.39	
5.64/2.39	This digraph is fully evaluated!
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(12)
5.64/2.39	Obligation:
5.64/2.39	
5.64/2.39	Termination digraph:
5.64/2.39	Nodes:
5.64/2.39	(1) f282_0_main_Load(i42:0, i17:0) -> f282_0_main_Load(arith, arith1) :|: i42:0 < i17:0 && arith = i42:0 + 1 && arith1 = i17:0 - 1
5.64/2.39	
5.64/2.39	Arcs:
5.64/2.39	(1) -> (1)
5.64/2.39	
5.64/2.39	This digraph is fully evaluated!
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(13) IntTRSCompressionProof (EQUIVALENT)
5.64/2.39	Compressed rules.
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(14)
5.64/2.39	Obligation:
5.64/2.39	Rules:
5.64/2.39	f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(i42:0:0 + 1, i17:0:0 - 1) :|: i42:0:0 < i17:0:0
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(15) TempFilterProof (SOUND)
5.64/2.39	Used the following sort dictionary for filtering: 
5.64/2.39	f282_0_main_Load(INTEGER, INTEGER)
5.64/2.39	Replaced non-predefined constructor symbols by 0.
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(16)
5.64/2.39	Obligation:
5.64/2.39	Rules:
5.64/2.39	f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(c, c1) :|: c1 = i17:0:0 - 1 && c = i42:0:0 + 1 && i42:0:0 < i17:0:0
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(17) PolynomialOrderProcessor (EQUIVALENT)
5.64/2.39	Found the following polynomial interpretation:
5.64/2.39	[f282_0_main_Load(x, x1)] = -1 - x + x1
5.64/2.39	
5.64/2.39	The following rules are decreasing:
5.64/2.39	f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(c, c1) :|: c1 = i17:0:0 - 1 && c = i42:0:0 + 1 && i42:0:0 < i17:0:0
5.64/2.39	The following rules are bounded:
5.64/2.39	f282_0_main_Load(i42:0:0, i17:0:0) -> f282_0_main_Load(c, c1) :|: c1 = i17:0:0 - 1 && c = i42:0:0 + 1 && i42:0:0 < i17:0:0
5.64/2.39	
5.64/2.39	----------------------------------------
5.64/2.39	
5.64/2.39	(18)
5.64/2.39	YES
5.92/2.43	EOF