5.58/2.34	YES
5.69/2.35	proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
5.69/2.35	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.69/2.35	
5.69/2.35	
5.69/2.35	termination of the given Bare JBC problem could be proven:
5.69/2.35	
5.69/2.35	(0) Bare JBC problem
5.69/2.35	(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
5.69/2.35	(2) JBC problem
5.69/2.35	(3) JBCToGraph [EQUIVALENT, 308 ms]
5.69/2.35	(4) JBCTerminationGraph
5.69/2.35	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
5.69/2.35	(6) JBCTerminationSCC
5.69/2.35	(7) SCCToIRSProof [SOUND, 59 ms]
5.69/2.35	(8) IRSwT
5.69/2.35	(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
5.69/2.35	(10) IRSwT
5.69/2.35	(11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
5.69/2.35	(12) IRSwT
5.69/2.35	(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
5.69/2.35	(14) IRSwT
5.69/2.35	(15) TempFilterProof [SOUND, 15 ms]
5.69/2.35	(16) IntTRS
5.69/2.35	(17) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
5.69/2.35	(18) YES
5.69/2.35	
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(0)
5.69/2.35	Obligation:
5.69/2.35	need to prove termination of the following program:
5.69/2.35	public class MinusBuiltIn{
5.69/2.35	
5.69/2.35	  public static void main(String[] args) {
5.69/2.35	    Random.args = args;
5.69/2.35	    int x = Random.random();
5.69/2.35	    int y = Random.random();
5.69/2.35	    int res = 0;
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	    while (x > y) {
5.69/2.35	
5.69/2.35	      y++;
5.69/2.35	      res++;
5.69/2.35	
5.69/2.35	    }
5.69/2.35	  }
5.69/2.35	
5.69/2.35	}
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	public class Random {
5.69/2.35	  static String[] args;
5.69/2.35	  static int index = 0;
5.69/2.35	
5.69/2.35	  public static int random() {
5.69/2.35	    String string = args[index];
5.69/2.35	    index++;
5.69/2.35	    return string.length();
5.69/2.35	  }
5.69/2.35	}
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(1) BareJBCToJBCProof (EQUIVALENT)
5.69/2.35	initialized classpath
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(2)
5.69/2.35	Obligation:
5.69/2.35	need to prove termination of the following program:
5.69/2.35	public class MinusBuiltIn{
5.69/2.35	
5.69/2.35	  public static void main(String[] args) {
5.69/2.35	    Random.args = args;
5.69/2.35	    int x = Random.random();
5.69/2.35	    int y = Random.random();
5.69/2.35	    int res = 0;
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	    while (x > y) {
5.69/2.35	
5.69/2.35	      y++;
5.69/2.35	      res++;
5.69/2.35	
5.69/2.35	    }
5.69/2.35	  }
5.69/2.35	
5.69/2.35	}
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	public class Random {
5.69/2.35	  static String[] args;
5.69/2.35	  static int index = 0;
5.69/2.35	
5.69/2.35	  public static int random() {
5.69/2.35	    String string = args[index];
5.69/2.35	    index++;
5.69/2.35	    return string.length();
5.69/2.35	  }
5.69/2.35	}
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(3) JBCToGraph (EQUIVALENT)
5.69/2.35	Constructed TerminationGraph.
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(4)
5.69/2.35	Obligation:
5.69/2.35	Termination Graph based on JBC Program:
5.69/2.35	MinusBuiltIn.main([Ljava/lang/String;)V: Graph of 180 nodes with 1 SCC.
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(5) TerminationGraphToSCCProof (SOUND)
5.69/2.35	Splitted TerminationGraph to 1 SCCs.
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(6)
5.69/2.35	Obligation:
5.69/2.35	SCC of termination graph based on JBC Program.
5.69/2.35	SCC contains nodes from the following methods: MinusBuiltIn.main([Ljava/lang/String;)V
5.69/2.35	SCC calls the following helper methods: 
5.69/2.35	Performed SCC analyses:
5.69/2.35	*Used field analysis yielded the following read fields:
5.69/2.35	
5.69/2.35	*Marker field analysis yielded the following relations that could be markers:
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(7) SCCToIRSProof (SOUND)
5.69/2.35	Transformed FIGraph SCCs to intTRSs. Log: 
5.69/2.35	Generated rules. Obtained 8 IRulesP rules:
5.69/2.35	f516_0_main_Load(EOS(STATIC_516), i83, i84, i83) -> f518_0_main_LE(EOS(STATIC_518), i83, i84, i83, i84) :|: TRUE
5.69/2.35	f518_0_main_LE(EOS(STATIC_518), i83, i84, i83, i84) -> f525_0_main_LE(EOS(STATIC_525), i83, i84, i83, i84) :|: i83 > i84
5.69/2.35	f525_0_main_LE(EOS(STATIC_525), i83, i84, i83, i84) -> f535_0_main_Inc(EOS(STATIC_535), i83, i84) :|: i83 > i84
5.69/2.35	f535_0_main_Inc(EOS(STATIC_535), i83, i84) -> f537_0_main_Inc(EOS(STATIC_537), i83, i84 + 1) :|: TRUE
5.69/2.35	f537_0_main_Inc(EOS(STATIC_537), i83, i95) -> f538_0_main_JMP(EOS(STATIC_538), i83, i95) :|: TRUE
5.69/2.35	f538_0_main_JMP(EOS(STATIC_538), i83, i95) -> f559_0_main_Load(EOS(STATIC_559), i83, i95) :|: TRUE
5.69/2.35	f559_0_main_Load(EOS(STATIC_559), i83, i95) -> f513_0_main_Load(EOS(STATIC_513), i83, i95) :|: TRUE
5.69/2.35	f513_0_main_Load(EOS(STATIC_513), i83, i84) -> f516_0_main_Load(EOS(STATIC_516), i83, i84, i83) :|: TRUE
5.69/2.35	Combined rules. Obtained 1 IRulesP rules:
5.69/2.35	f516_0_main_Load(EOS(STATIC_516), i83:0, i84:0, i83:0) -> f516_0_main_Load(EOS(STATIC_516), i83:0, i84:0 + 1, i83:0) :|: i84:0 < i83:0
5.69/2.35	Filtered constant ground arguments:
5.69/2.35	   f516_0_main_Load(x1, x2, x3, x4) -> f516_0_main_Load(x2, x3, x4)
5.69/2.35	   EOS(x1) -> EOS
5.69/2.35	Filtered duplicate arguments:
5.69/2.35	   f516_0_main_Load(x1, x2, x3) -> f516_0_main_Load(x2, x3)
5.69/2.35	Finished conversion. Obtained 1 rules.P rules:
5.69/2.35	f516_0_main_Load(i84:0, i83:0) -> f516_0_main_Load(i84:0 + 1, i83:0) :|: i84:0 < i83:0
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(8)
5.69/2.35	Obligation:
5.69/2.35	Rules:
5.69/2.35	f516_0_main_Load(i84:0, i83:0) -> f516_0_main_Load(i84:0 + 1, i83:0) :|: i84:0 < i83:0
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(9) IRSFormatTransformerProof (EQUIVALENT)
5.69/2.35	Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(10)
5.69/2.35	Obligation:
5.69/2.35	Rules:
5.69/2.35	f516_0_main_Load(i84:0, i83:0) -> f516_0_main_Load(arith, i83:0) :|: i84:0 < i83:0 && arith = i84:0 + 1
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(11) IRSwTTerminationDigraphProof (EQUIVALENT)
5.69/2.35	Constructed termination digraph!
5.69/2.35	Nodes:
5.69/2.35	(1) f516_0_main_Load(i84:0, i83:0) -> f516_0_main_Load(arith, i83:0) :|: i84:0 < i83:0 && arith = i84:0 + 1
5.69/2.35	
5.69/2.35	Arcs:
5.69/2.35	(1) -> (1)
5.69/2.35	
5.69/2.35	This digraph is fully evaluated!
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(12)
5.69/2.35	Obligation:
5.69/2.35	
5.69/2.35	Termination digraph:
5.69/2.35	Nodes:
5.69/2.35	(1) f516_0_main_Load(i84:0, i83:0) -> f516_0_main_Load(arith, i83:0) :|: i84:0 < i83:0 && arith = i84:0 + 1
5.69/2.35	
5.69/2.35	Arcs:
5.69/2.35	(1) -> (1)
5.69/2.35	
5.69/2.35	This digraph is fully evaluated!
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(13) IntTRSCompressionProof (EQUIVALENT)
5.69/2.35	Compressed rules.
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(14)
5.69/2.35	Obligation:
5.69/2.35	Rules:
5.69/2.35	f516_0_main_Load(i84:0:0, i83:0:0) -> f516_0_main_Load(i84:0:0 + 1, i83:0:0) :|: i84:0:0 < i83:0:0
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(15) TempFilterProof (SOUND)
5.69/2.35	Used the following sort dictionary for filtering: 
5.69/2.35	f516_0_main_Load(INTEGER, INTEGER)
5.69/2.35	Replaced non-predefined constructor symbols by 0.
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(16)
5.69/2.35	Obligation:
5.69/2.35	Rules:
5.69/2.35	f516_0_main_Load(i84:0:0, i83:0:0) -> f516_0_main_Load(c, i83:0:0) :|: c = i84:0:0 + 1 && i84:0:0 < i83:0:0
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(17) PolynomialOrderProcessor (EQUIVALENT)
5.69/2.35	Found the following polynomial interpretation:
5.69/2.35	[f516_0_main_Load(x, x1)] = -x + x1
5.69/2.35	
5.69/2.35	The following rules are decreasing:
5.69/2.35	f516_0_main_Load(i84:0:0, i83:0:0) -> f516_0_main_Load(c, i83:0:0) :|: c = i84:0:0 + 1 && i84:0:0 < i83:0:0
5.69/2.35	The following rules are bounded:
5.69/2.35	f516_0_main_Load(i84:0:0, i83:0:0) -> f516_0_main_Load(c, i83:0:0) :|: c = i84:0:0 + 1 && i84:0:0 < i83:0:0
5.69/2.35	
5.69/2.35	----------------------------------------
5.69/2.35	
5.69/2.35	(18)
5.69/2.35	YES
5.69/2.37	EOF