10.22/3.85	YES
10.35/3.86	proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
10.35/3.86	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.35/3.86	
10.35/3.86	
10.35/3.86	termination of the given Bare JBC problem could be proven:
10.35/3.86	
10.35/3.86	(0) Bare JBC problem
10.35/3.86	(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
10.35/3.86	(2) JBC problem
10.35/3.86	(3) JBCToGraph [EQUIVALENT, 188 ms]
10.35/3.86	(4) JBCTerminationGraph
10.35/3.86	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
10.35/3.86	(6) AND
10.35/3.86	    (7) JBCTerminationSCC
10.35/3.86	        (8) SCCToQDPProof [SOUND, 101 ms]
10.35/3.86	        (9) QDP
10.35/3.86	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
10.35/3.86	        (11) YES
10.35/3.86	    (12) JBCTerminationSCC
10.35/3.86	        (13) SCCToIRSProof [SOUND, 97 ms]
10.35/3.86	        (14) IRSwT
10.35/3.86	        (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
10.35/3.86	        (16) IRSwT
10.35/3.86	        (17) IRSwTTerminationDigraphProof [EQUIVALENT, 20 ms]
10.35/3.86	        (18) IRSwT
10.35/3.86	        (19) IntTRSCompressionProof [EQUIVALENT, 0 ms]
10.35/3.86	        (20) IRSwT
10.35/3.86	        (21) TempFilterProof [SOUND, 45 ms]
10.35/3.86	        (22) IntTRS
10.35/3.86	        (23) RankingReductionPairProof [EQUIVALENT, 24 ms]
10.35/3.86	        (24) YES
10.35/3.86	
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(0)
10.35/3.86	Obligation:
10.35/3.86	need to prove termination of the following program:
10.35/3.86	public class ListReverseAcyclicList {
10.35/3.86		public static void main(String... args) {
10.35/3.86			List x = List.createList(args[0].length(), null);
10.35/3.86			List.reverse(x);
10.35/3.86		}
10.35/3.86	}
10.35/3.86	
10.35/3.86	class List {
10.35/3.86		List n;
10.35/3.86	
10.35/3.86		public List(List next) {
10.35/3.86			this.n = next;
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static void reverse(List x) {		
10.35/3.86			List y = null;
10.35/3.86			while (x != null) {
10.35/3.86				List z = x;
10.35/3.86				x = x.n;
10.35/3.86				z.n = y;
10.35/3.86				y = z;
10.35/3.86			}
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static List createList(int l, List end) {
10.35/3.86			while (--l > 0) {
10.35/3.86				end = new List(end);
10.35/3.86			}
10.35/3.86			return end;
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static List createCycle(int l) {
10.35/3.86			List last = new List(null);
10.35/3.86			List first = createList(l - 1, last);
10.35/3.86			last.n = first;
10.35/3.86			return first;
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static List createPanhandleList(int pl, int cl) {
10.35/3.86			return createList(pl, createCycle(cl));
10.35/3.86		}
10.35/3.86	
10.35/3.86	}
10.35/3.86	
10.35/3.86	
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(1) BareJBCToJBCProof (EQUIVALENT)
10.35/3.86	initialized classpath
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(2)
10.35/3.86	Obligation:
10.35/3.86	need to prove termination of the following program:
10.35/3.86	public class ListReverseAcyclicList {
10.35/3.86		public static void main(String... args) {
10.35/3.86			List x = List.createList(args[0].length(), null);
10.35/3.86			List.reverse(x);
10.35/3.86		}
10.35/3.86	}
10.35/3.86	
10.35/3.86	class List {
10.35/3.86		List n;
10.35/3.86	
10.35/3.86		public List(List next) {
10.35/3.86			this.n = next;
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static void reverse(List x) {		
10.35/3.86			List y = null;
10.35/3.86			while (x != null) {
10.35/3.86				List z = x;
10.35/3.86				x = x.n;
10.35/3.86				z.n = y;
10.35/3.86				y = z;
10.35/3.86			}
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static List createList(int l, List end) {
10.35/3.86			while (--l > 0) {
10.35/3.86				end = new List(end);
10.35/3.86			}
10.35/3.86			return end;
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static List createCycle(int l) {
10.35/3.86			List last = new List(null);
10.35/3.86			List first = createList(l - 1, last);
10.35/3.86			last.n = first;
10.35/3.86			return first;
10.35/3.86		}
10.35/3.86	
10.35/3.86		public static List createPanhandleList(int pl, int cl) {
10.35/3.86			return createList(pl, createCycle(cl));
10.35/3.86		}
10.35/3.86	
10.35/3.86	}
10.35/3.86	
10.35/3.86	
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(3) JBCToGraph (EQUIVALENT)
10.35/3.86	Constructed TerminationGraph.
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(4)
10.35/3.86	Obligation:
10.35/3.86	Termination Graph based on JBC Program:
10.35/3.86	ListReverseAcyclicList.main([Ljava/lang/String;)V: Graph of 147 nodes with 2 SCCs.
10.35/3.86	
10.35/3.86	
10.35/3.86	
10.35/3.86	
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(5) TerminationGraphToSCCProof (SOUND)
10.35/3.86	Splitted TerminationGraph to 2 SCCss.
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(6)
10.35/3.86	Complex Obligation (AND)
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(7)
10.35/3.86	Obligation:
10.35/3.86	SCC of termination graph based on JBC Program.
10.35/3.86	SCC contains nodes from the following methods: ListReverseAcyclicList.main([Ljava/lang/String;)V
10.35/3.86	SCC calls the following helper methods: 
10.35/3.86	Performed SCC analyses:
10.35/3.86	*Used field analysis yielded the following read fields:
10.35/3.86	*List: [n]
10.35/3.86	*Marker field analysis yielded the following relations that could be markers:
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(8) SCCToQDPProof (SOUND)
10.35/3.86	Transformed TerminationGraph SCC to QDP. Log: 
10.35/3.86	Generated 16 rules for P and 0 rules for R.P rules:
10.35/3.86	f664_0_reverse_NULL(EOS(STATIC_664), java.lang.Object(o205sub), java.lang.Object(List(EOC, o181)), java.lang.Object(o205sub)) -> f668_0_reverse_Load(EOS(STATIC_668), java.lang.Object(o205sub), java.lang.Object(List(EOC, o181))) :|: TRUE
10.35/3.86	f668_0_reverse_Load(EOS(STATIC_668), java.lang.Object(o205sub), java.lang.Object(List(EOC, o181))) -> f673_0_reverse_Store(EOS(STATIC_673), java.lang.Object(o205sub), java.lang.Object(List(EOC, o181)), java.lang.Object(o205sub)) :|: TRUE
10.35/3.86	f673_0_reverse_Store(EOS(STATIC_673), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215))) -> f675_0_reverse_Store(EOS(STATIC_675), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215))) :|: TRUE
10.35/3.86	f675_0_reverse_Store(EOS(STATIC_675), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215))) -> f679_0_reverse_Load(EOS(STATIC_679), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215))) :|: TRUE
10.35/3.86	f679_0_reverse_Load(EOS(STATIC_679), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215))) -> f682_0_reverse_FieldAccess(EOS(STATIC_682), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o215))) :|: TRUE
10.35/3.86	f682_0_reverse_FieldAccess(EOS(STATIC_682), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o215))) -> f685_0_reverse_Store(EOS(STATIC_685), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215)), o215) :|: TRUE
10.35/3.86	f685_0_reverse_Store(EOS(STATIC_685), java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215)), o215) -> f688_0_reverse_Load(EOS(STATIC_688), o215, java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215))) :|: TRUE
10.35/3.86	f688_0_reverse_Load(EOS(STATIC_688), o215, java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215))) -> f691_0_reverse_Load(EOS(STATIC_691), o215, java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o215))) :|: TRUE
10.35/3.86	f691_0_reverse_Load(EOS(STATIC_691), o215, java.lang.Object(List(EOC, o181)), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o215))) -> f695_0_reverse_FieldAccess(EOS(STATIC_695), o215, java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o181))) :|: TRUE
10.35/3.86	f695_0_reverse_FieldAccess(EOS(STATIC_695), o215, java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o215)), java.lang.Object(List(EOC, o181))) -> f698_0_reverse_Load(EOS(STATIC_698), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) :|: TRUE
10.35/3.86	f698_0_reverse_Load(EOS(STATIC_698), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) -> f699_0_reverse_Store(EOS(STATIC_699), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) :|: TRUE
10.35/3.86	f699_0_reverse_Store(EOS(STATIC_699), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) -> f702_0_reverse_JMP(EOS(STATIC_702), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) :|: TRUE
10.35/3.86	f702_0_reverse_JMP(EOS(STATIC_702), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) -> f741_0_reverse_Load(EOS(STATIC_741), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) :|: TRUE
10.35/3.86	f741_0_reverse_Load(EOS(STATIC_741), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) -> f652_0_reverse_Load(EOS(STATIC_652), o215, java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181))))) :|: TRUE
10.35/3.86	f652_0_reverse_Load(EOS(STATIC_652), o179, java.lang.Object(List(EOC, o181))) -> f661_0_reverse_NULL(EOS(STATIC_661), o179, java.lang.Object(List(EOC, o181)), o179) :|: TRUE
10.35/3.86	f661_0_reverse_NULL(EOS(STATIC_661), java.lang.Object(o205sub), java.lang.Object(List(EOC, o181)), java.lang.Object(o205sub)) -> f664_0_reverse_NULL(EOS(STATIC_664), java.lang.Object(o205sub), java.lang.Object(List(EOC, o181)), java.lang.Object(o205sub)) :|: TRUE
10.35/3.86	R rules:
10.35/3.86	Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.P rules:
10.35/3.86	f664_0_reverse_NULL(EOS(STATIC_664), java.lang.Object(List(EOC, java.lang.Object(o205sub:0))), java.lang.Object(List(EOC, o181:0)), java.lang.Object(List(EOC, java.lang.Object(o205sub:0)))) -> f664_0_reverse_NULL(EOS(STATIC_664), java.lang.Object(o205sub:0), java.lang.Object(List(EOC, java.lang.Object(List(EOC, o181:0)))), java.lang.Object(o205sub:0)) :|: TRUE
10.35/3.86	R rules:
10.35/3.86	Filtered ground terms:
10.35/3.86	   f664_0_reverse_NULL(x1, x2, x3, x4) -> f664_0_reverse_NULL(x2, x3, x4)
10.35/3.86	   EOS(x1) -> EOS
10.35/3.86	   List(x1, x2) -> List(x2)
10.35/3.86	Filtered duplicate args:
10.35/3.86	   f664_0_reverse_NULL(x1, x2, x3) -> f664_0_reverse_NULL(x2, x3)
10.35/3.86	Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.P rules:
10.35/3.86	F664_0_REVERSE_NULL(java.lang.Object(List(o181:0:0)), java.lang.Object(List(java.lang.Object(o205sub:0:0)))) -> F664_0_REVERSE_NULL(java.lang.Object(List(java.lang.Object(List(o181:0:0)))), java.lang.Object(o205sub:0:0)) :|: TRUE
10.35/3.86	R rules:
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(9)
10.35/3.86	Obligation:
10.35/3.86	Q DP problem:
10.35/3.86	The TRS P consists of the following rules:
10.35/3.86	
10.35/3.86	   F664_0_REVERSE_NULL(java.lang.Object(List(o181:0:0)), java.lang.Object(List(java.lang.Object(o205sub:0:0)))) -> F664_0_REVERSE_NULL(java.lang.Object(List(java.lang.Object(List(o181:0:0)))), java.lang.Object(o205sub:0:0))
10.35/3.86	
10.35/3.86	R is empty.
10.35/3.86	Q is empty.
10.35/3.86	We have to consider all minimal (P,Q,R)-chains.
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(10) QDPSizeChangeProof (EQUIVALENT)
10.35/3.86	By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 
10.35/3.86	
10.35/3.86	From the DPs we obtained the following set of size-change graphs:
10.35/3.86	*F664_0_REVERSE_NULL(java.lang.Object(List(o181:0:0)), java.lang.Object(List(java.lang.Object(o205sub:0:0)))) -> F664_0_REVERSE_NULL(java.lang.Object(List(java.lang.Object(List(o181:0:0)))), java.lang.Object(o205sub:0:0))
10.35/3.86	The graph contains the following edges 2 > 2
10.35/3.86	
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(11)
10.35/3.86	YES
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(12)
10.35/3.86	Obligation:
10.35/3.86	SCC of termination graph based on JBC Program.
10.35/3.86	SCC contains nodes from the following methods: ListReverseAcyclicList.main([Ljava/lang/String;)V
10.35/3.86	SCC calls the following helper methods: 
10.35/3.86	Performed SCC analyses:
10.35/3.86	*Used field analysis yielded the following read fields:
10.35/3.86	
10.35/3.86	*Marker field analysis yielded the following relations that could be markers:
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(13) SCCToIRSProof (SOUND)
10.35/3.86	Transformed FIGraph SCCs to intTRSs. Log: 
10.35/3.86	Generated rules. Obtained 17 IRulesP rules:
10.35/3.86	f446_0_createList_LE(EOS(STATIC_446), i71, i71) -> f451_0_createList_New(EOS(STATIC_451), i71) :|: i71 > 0
10.35/3.86	f451_0_createList_New(EOS(STATIC_451), i71) -> f456_0_createList_Duplicate(EOS(STATIC_456), i71) :|: TRUE
10.35/3.86	f456_0_createList_Duplicate(EOS(STATIC_456), i71) -> f463_0_createList_Load(EOS(STATIC_463), i71) :|: TRUE
10.35/3.86	f463_0_createList_Load(EOS(STATIC_463), i71) -> f469_0_createList_InvokeMethod(EOS(STATIC_469), i71) :|: TRUE
10.35/3.86	f469_0_createList_InvokeMethod(EOS(STATIC_469), i71) -> f474_0__init__Load(EOS(STATIC_474), i71) :|: TRUE
10.35/3.86	f474_0__init__Load(EOS(STATIC_474), i71) -> f478_0__init__InvokeMethod(EOS(STATIC_478), i71) :|: TRUE
10.35/3.86	f478_0__init__InvokeMethod(EOS(STATIC_478), i71) -> f482_0__init__Load(EOS(STATIC_482), i71) :|: TRUE
10.35/3.86	f482_0__init__Load(EOS(STATIC_482), i71) -> f485_0__init__Load(EOS(STATIC_485), i71) :|: TRUE
10.35/3.86	f485_0__init__Load(EOS(STATIC_485), i71) -> f490_0__init__FieldAccess(EOS(STATIC_490), i71) :|: TRUE
10.35/3.86	f490_0__init__FieldAccess(EOS(STATIC_490), i71) -> f499_0__init__Return(EOS(STATIC_499), i71) :|: TRUE
10.35/3.86	f499_0__init__Return(EOS(STATIC_499), i71) -> f505_0_createList_Store(EOS(STATIC_505), i71) :|: TRUE
10.35/3.86	f505_0_createList_Store(EOS(STATIC_505), i71) -> f507_0_createList_JMP(EOS(STATIC_507), i71) :|: TRUE
10.35/3.86	f507_0_createList_JMP(EOS(STATIC_507), i71) -> f547_0_createList_Inc(EOS(STATIC_547), i71) :|: TRUE
10.35/3.86	f547_0_createList_Inc(EOS(STATIC_547), i71) -> f429_0_createList_Inc(EOS(STATIC_429), i71) :|: TRUE
10.35/3.86	f429_0_createList_Inc(EOS(STATIC_429), i62) -> f435_0_createList_Load(EOS(STATIC_435), i62 + -1) :|: TRUE
10.35/3.86	f435_0_createList_Load(EOS(STATIC_435), i67) -> f441_0_createList_LE(EOS(STATIC_441), i67, i67) :|: TRUE
10.35/3.86	f441_0_createList_LE(EOS(STATIC_441), i71, i71) -> f446_0_createList_LE(EOS(STATIC_446), i71, i71) :|: TRUE
10.35/3.86	Combined rules. Obtained 1 IRulesP rules:
10.35/3.86	f446_0_createList_LE(EOS(STATIC_446), i71:0, i71:0) -> f446_0_createList_LE(EOS(STATIC_446), i71:0 - 1, i71:0 - 1) :|: i71:0 > 0
10.35/3.86	Filtered constant ground arguments:
10.35/3.86	   f446_0_createList_LE(x1, x2, x3) -> f446_0_createList_LE(x2, x3)
10.35/3.86	   EOS(x1) -> EOS
10.35/3.86	Filtered duplicate arguments:
10.35/3.86	   f446_0_createList_LE(x1, x2) -> f446_0_createList_LE(x2)
10.35/3.86	Finished conversion. Obtained 1 rules.P rules:
10.35/3.86	f446_0_createList_LE(i71:0) -> f446_0_createList_LE(i71:0 - 1) :|: i71:0 > 0
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(14)
10.35/3.86	Obligation:
10.35/3.86	Rules:
10.35/3.86	f446_0_createList_LE(i71:0) -> f446_0_createList_LE(i71:0 - 1) :|: i71:0 > 0
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(15) IRSFormatTransformerProof (EQUIVALENT)
10.35/3.86	Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(16)
10.35/3.86	Obligation:
10.35/3.86	Rules:
10.35/3.86	f446_0_createList_LE(i71:0) -> f446_0_createList_LE(arith) :|: i71:0 > 0 && arith = i71:0 - 1
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(17) IRSwTTerminationDigraphProof (EQUIVALENT)
10.35/3.86	Constructed termination digraph!
10.35/3.86	Nodes:
10.35/3.86	(1) f446_0_createList_LE(i71:0) -> f446_0_createList_LE(arith) :|: i71:0 > 0 && arith = i71:0 - 1
10.35/3.86	
10.35/3.86	Arcs:
10.35/3.86	(1) -> (1)
10.35/3.86	
10.35/3.86	This digraph is fully evaluated!
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(18)
10.35/3.86	Obligation:
10.35/3.86	
10.35/3.86	Termination digraph:
10.35/3.86	Nodes:
10.35/3.86	(1) f446_0_createList_LE(i71:0) -> f446_0_createList_LE(arith) :|: i71:0 > 0 && arith = i71:0 - 1
10.35/3.86	
10.35/3.86	Arcs:
10.35/3.86	(1) -> (1)
10.35/3.86	
10.35/3.86	This digraph is fully evaluated!
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(19) IntTRSCompressionProof (EQUIVALENT)
10.35/3.86	Compressed rules.
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(20)
10.35/3.86	Obligation:
10.35/3.86	Rules:
10.35/3.86	f446_0_createList_LE(i71:0:0) -> f446_0_createList_LE(i71:0:0 - 1) :|: i71:0:0 > 0
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(21) TempFilterProof (SOUND)
10.35/3.86	Used the following sort dictionary for filtering: 
10.35/3.86	f446_0_createList_LE(INTEGER)
10.35/3.86	Replaced non-predefined constructor symbols by 0.
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(22)
10.35/3.86	Obligation:
10.35/3.86	Rules:
10.35/3.86	f446_0_createList_LE(i71:0:0) -> f446_0_createList_LE(c) :|: c = i71:0:0 - 1 && i71:0:0 > 0
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(23) RankingReductionPairProof (EQUIVALENT)
10.35/3.86	Interpretation:
10.35/3.86	[ f446_0_createList_LE ] = f446_0_createList_LE_1
10.35/3.86	
10.35/3.86	The following rules are decreasing:
10.35/3.86	f446_0_createList_LE(i71:0:0) -> f446_0_createList_LE(c) :|: c = i71:0:0 - 1 && i71:0:0 > 0
10.35/3.86	
10.35/3.86	The following rules are bounded:
10.35/3.86	f446_0_createList_LE(i71:0:0) -> f446_0_createList_LE(c) :|: c = i71:0:0 - 1 && i71:0:0 > 0
10.35/3.86	
10.35/3.86	
10.35/3.86	----------------------------------------
10.35/3.86	
10.35/3.86	(24)
10.35/3.86	YES
10.40/3.90	EOF