/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 352 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 3 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 168 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToIRSProof [SOUND, 29 ms] (14) IRSwT (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 50 ms] (18) IRSwT (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IRSwT (21) TempFilterProof [SOUND, 20 ms] (22) IntTRS (23) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (24) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package SharingAnalysis; public class Random { static String[] args; static int index = 0; public static int random() { final String string = args[index]; index++; return string.length(); } } package SharingAnalysis; public class SharingAnalysis { int val; SharingAnalysis field; public static void main(String[] args) { Random.args = args; SharingAnalysis t1 = new SharingAnalysis(); SharingAnalysis t2 = t1.appendNewList(1); SharingAnalysis t3 = t2.appendNewList(Random.random()); t2.field = null; copy(t1, t3); } public static void copy(SharingAnalysis source, SharingAnalysis target) { while (source != null) { SharingAnalysis newEle = new SharingAnalysis(); newEle.val = source.val; target.field = newEle; source = source.field; target = target.field; } } /** * @param i number of elements to append * @return the last list element appended */ private SharingAnalysis appendNewList(int i) { this.field = new SharingAnalysis(); SharingAnalysis cur = this.field; while (i > 1) { i--; cur = cur.field = new SharingAnalysis(); } return cur; } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package SharingAnalysis; public class Random { static String[] args; static int index = 0; public static int random() { final String string = args[index]; index++; return string.length(); } } package SharingAnalysis; public class SharingAnalysis { int val; SharingAnalysis field; public static void main(String[] args) { Random.args = args; SharingAnalysis t1 = new SharingAnalysis(); SharingAnalysis t2 = t1.appendNewList(1); SharingAnalysis t3 = t2.appendNewList(Random.random()); t2.field = null; copy(t1, t3); } public static void copy(SharingAnalysis source, SharingAnalysis target) { while (source != null) { SharingAnalysis newEle = new SharingAnalysis(); newEle.val = source.val; target.field = newEle; source = source.field; target = target.field; } } /** * @param i number of elements to append * @return the last list element appended */ private SharingAnalysis appendNewList(int i) { this.field = new SharingAnalysis(); SharingAnalysis cur = this.field; while (i > 1) { i--; cur = cur.field = new SharingAnalysis(); } return cur; } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: SharingAnalysis.SharingAnalysis.main([Ljava/lang/String;)V: Graph of 203 nodes with 2 SCCs. ---------------------------------------- (5) TerminationGraphToSCCProof (SOUND) Splitted TerminationGraph to 2 SCCss. ---------------------------------------- (6) Complex Obligation (AND) ---------------------------------------- (7) Obligation: SCC of termination graph based on JBC Program. SCC contains nodes from the following methods: SharingAnalysis.SharingAnalysis.main([Ljava/lang/String;)V SCC calls the following helper methods: Performed SCC analyses: *Used field analysis yielded the following read fields: *SharingAnalysis.SharingAnalysis: [val, field] *Marker field analysis yielded the following relations that could be markers: ---------------------------------------- (8) SCCToQDPProof (SOUND) Transformed TerminationGraph SCC to QDP. Log: Generated 26 rules for P and 0 rules for R.P rules: f898_0_copy_NULL(EOS(STATIC_898), java.lang.Object(o131sub), java.lang.Object(o131sub)) -> f901_0_copy_NULL(EOS(STATIC_901), java.lang.Object(o131sub), java.lang.Object(o131sub)) :|: TRUE f901_0_copy_NULL(EOS(STATIC_901), java.lang.Object(o131sub), java.lang.Object(o131sub)) -> f904_0_copy_New(EOS(STATIC_904), java.lang.Object(o131sub)) :|: TRUE f904_0_copy_New(EOS(STATIC_904), java.lang.Object(o131sub)) -> f909_0_copy_Duplicate(EOS(STATIC_909), java.lang.Object(o131sub)) :|: TRUE f909_0_copy_Duplicate(EOS(STATIC_909), java.lang.Object(o131sub)) -> f913_0_copy_InvokeMethod(EOS(STATIC_913), java.lang.Object(o131sub)) :|: TRUE f913_0_copy_InvokeMethod(EOS(STATIC_913), java.lang.Object(o131sub)) -> f916_0__init__Load(EOS(STATIC_916), java.lang.Object(o131sub)) :|: TRUE f916_0__init__Load(EOS(STATIC_916), java.lang.Object(o131sub)) -> f920_0__init__InvokeMethod(EOS(STATIC_920), java.lang.Object(o131sub)) :|: TRUE f920_0__init__InvokeMethod(EOS(STATIC_920), java.lang.Object(o131sub)) -> f924_0__init__Return(EOS(STATIC_924), java.lang.Object(o131sub)) :|: TRUE f924_0__init__Return(EOS(STATIC_924), java.lang.Object(o131sub)) -> f926_0_copy_Store(EOS(STATIC_926), java.lang.Object(o131sub)) :|: TRUE f926_0_copy_Store(EOS(STATIC_926), java.lang.Object(o131sub)) -> f929_0_copy_Load(EOS(STATIC_929), java.lang.Object(o131sub)) :|: TRUE f929_0_copy_Load(EOS(STATIC_929), java.lang.Object(o131sub)) -> f931_0_copy_Load(EOS(STATIC_931), java.lang.Object(o131sub)) :|: TRUE f931_0_copy_Load(EOS(STATIC_931), java.lang.Object(o131sub)) -> f933_0_copy_FieldAccess(EOS(STATIC_933), java.lang.Object(o131sub), java.lang.Object(o131sub)) :|: TRUE f933_0_copy_FieldAccess(EOS(STATIC_933), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f936_0_copy_FieldAccess(EOS(STATIC_936), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) :|: TRUE f936_0_copy_FieldAccess(EOS(STATIC_936), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f939_0_copy_FieldAccess(EOS(STATIC_939), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) :|: TRUE f939_0_copy_FieldAccess(EOS(STATIC_939), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f943_0_copy_Load(EOS(STATIC_943), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) :|: TRUE f943_0_copy_Load(EOS(STATIC_943), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f945_0_copy_Load(EOS(STATIC_945), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) :|: TRUE f945_0_copy_Load(EOS(STATIC_945), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f946_0_copy_FieldAccess(EOS(STATIC_946), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) :|: TRUE f946_0_copy_FieldAccess(EOS(STATIC_946), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f952_0_copy_Load(EOS(STATIC_952), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) :|: TRUE f952_0_copy_Load(EOS(STATIC_952), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f953_0_copy_FieldAccess(EOS(STATIC_953), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) :|: TRUE f953_0_copy_FieldAccess(EOS(STATIC_953), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o136))) -> f954_0_copy_Store(EOS(STATIC_954), o136) :|: TRUE f954_0_copy_Store(EOS(STATIC_954), o136) -> f955_0_copy_Load(EOS(STATIC_955), o136) :|: TRUE f955_0_copy_Load(EOS(STATIC_955), o136) -> f957_0_copy_FieldAccess(EOS(STATIC_957), o136) :|: TRUE f957_0_copy_FieldAccess(EOS(STATIC_957), o136) -> f959_0_copy_Store(EOS(STATIC_959), o136) :|: TRUE f959_0_copy_Store(EOS(STATIC_959), o136) -> f961_0_copy_JMP(EOS(STATIC_961), o136) :|: TRUE f961_0_copy_JMP(EOS(STATIC_961), o136) -> f975_0_copy_Load(EOS(STATIC_975), o136) :|: TRUE f975_0_copy_Load(EOS(STATIC_975), o136) -> f892_0_copy_Load(EOS(STATIC_892), o136) :|: TRUE f892_0_copy_Load(EOS(STATIC_892), o123) -> f898_0_copy_NULL(EOS(STATIC_898), o123, o123) :|: TRUE R rules: Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.P rules: f898_0_copy_NULL(EOS(STATIC_898), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66:0, o136:0)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66:0, o136:0))) -> f898_0_copy_NULL(EOS(STATIC_898), o136:0, o136:0) :|: TRUE R rules: Filtered ground terms: f898_0_copy_NULL(x1, x2, x3) -> f898_0_copy_NULL(x2, x3) EOS(x1) -> EOS SharingAnalysis.SharingAnalysis(x1, x2, x3) -> SharingAnalysis.SharingAnalysis(x2, x3) Filtered unneeded arguments: SharingAnalysis.SharingAnalysis(x1, x2) -> SharingAnalysis.SharingAnalysis(x2) Filtered duplicate args: f898_0_copy_NULL(x1, x2) -> f898_0_copy_NULL(x2) Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.P rules: F898_0_COPY_NULL(java.lang.Object(SharingAnalysis.SharingAnalysis(o136:0:0))) -> F898_0_COPY_NULL(o136:0:0) :|: TRUE R rules: ---------------------------------------- (9) Obligation: Q DP problem: The TRS P consists of the following rules: F898_0_COPY_NULL(java.lang.Object(SharingAnalysis.SharingAnalysis(o136:0:0))) -> F898_0_COPY_NULL(o136:0:0) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (10) QDPSizeChangeProof (EQUIVALENT) 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. From the DPs we obtained the following set of size-change graphs: *F898_0_COPY_NULL(java.lang.Object(SharingAnalysis.SharingAnalysis(o136:0:0))) -> F898_0_COPY_NULL(o136:0:0) The graph contains the following edges 1 > 1 ---------------------------------------- (11) YES ---------------------------------------- (12) Obligation: SCC of termination graph based on JBC Program. SCC contains nodes from the following methods: SharingAnalysis.SharingAnalysis.main([Ljava/lang/String;)V SCC calls the following helper methods: Performed SCC analyses: *Used field analysis yielded the following read fields: *Marker field analysis yielded the following relations that could be markers: ---------------------------------------- (13) SCCToIRSProof (SOUND) Transformed FIGraph SCCs to intTRSs. Log: Generated rules. Obtained 24 IRulesP rules: f400_0_appendNewList_ConstantStackPush(EOS(STATIC_400), i37, i37, o44[SharingAnalysis.field]o41) -> f409_0_appendNewList_LE(EOS(STATIC_409), i37, i37, 1, o44[SharingAnalysis.field]o41) :|: TRUE f409_0_appendNewList_LE(EOS(STATIC_409), i47, i47, matching1, o44[SharingAnalysis.field]o41) -> f419_0_appendNewList_LE(EOS(STATIC_419), i47, i47, 1, o44[SharingAnalysis.field]o41) :|: TRUE && matching1 = 1 f419_0_appendNewList_LE(EOS(STATIC_419), i47, i47, matching1, o44[SharingAnalysis.field]o41) -> f441_0_appendNewList_Inc(EOS(STATIC_441), i47, o44[SharingAnalysis.field]o41) :|: i47 > 1 && matching1 = 1 f441_0_appendNewList_Inc(EOS(STATIC_441), i47, o44[SharingAnalysis.field]o41) -> f447_0_appendNewList_Load(EOS(STATIC_447), i47 + -1, o44[SharingAnalysis.field]o41) :|: TRUE f447_0_appendNewList_Load(EOS(STATIC_447), i48, o44[SharingAnalysis.field]o41) -> f453_0_appendNewList_New(EOS(STATIC_453), i48, o44[SharingAnalysis.field]o41) :|: TRUE f453_0_appendNewList_New(EOS(STATIC_453), i48, o44[SharingAnalysis.field]o41) -> f458_0_appendNewList_Duplicate(EOS(STATIC_458), i48, o44[SharingAnalysis.field]o41) :|: TRUE f458_0_appendNewList_Duplicate(EOS(STATIC_458), i48, o44[SharingAnalysis.field]o41) -> f463_0_appendNewList_InvokeMethod(EOS(STATIC_463), i48, o44[SharingAnalysis.field]o41) :|: TRUE f463_0_appendNewList_InvokeMethod(EOS(STATIC_463), i48, o44[SharingAnalysis.field]o41) -> f469_0__init__Load(EOS(STATIC_469), i48, o44[SharingAnalysis.field]o41) :|: TRUE f469_0__init__Load(EOS(STATIC_469), i48, o44[SharingAnalysis.field]o41) -> f477_0__init__InvokeMethod(EOS(STATIC_477), i48, o44[SharingAnalysis.field]o41) :|: TRUE f477_0__init__InvokeMethod(EOS(STATIC_477), i48, o44[SharingAnalysis.field]o41) -> f479_0__init__Return(EOS(STATIC_479), i48, o44[SharingAnalysis.field]o41) :|: TRUE f479_0__init__Return(EOS(STATIC_479), i48, o44[SharingAnalysis.field]o41) -> f481_0_appendNewList_Duplicate(EOS(STATIC_481), i48, o44[SharingAnalysis.field]o41) :|: TRUE f481_0_appendNewList_Duplicate(EOS(STATIC_481), i48, o44[SharingAnalysis.field]o41) -> f482_0_appendNewList_FieldAccess(EOS(STATIC_482), i48, o44[SharingAnalysis.field]o41) :|: TRUE f482_0_appendNewList_FieldAccess(EOS(STATIC_482), i48, o44[SharingAnalysis.field]o41) -> f514_0_appendNewList_FieldAccess(EOS(STATIC_514), i48, o44[SharingAnalysis.field]o41) :|: o44[SharingAnalysis.field]o41 > 0 f482_0_appendNewList_FieldAccess(EOS(STATIC_482), i48, o62[SharingAnalysis.field]o62) -> f515_0_appendNewList_FieldAccess(EOS(STATIC_515), i48) :|: TRUE f514_0_appendNewList_FieldAccess(EOS(STATIC_514), i48, o44[SharingAnalysis.field]o41) -> f527_0_appendNewList_Store(EOS(STATIC_527), i48, o44[SharingAnalysis.field]o56) :|: o44[SharingAnalysis.field]o56 > o44[SharingAnalysis.field]o41 && o44[SharingAnalysis.field]o41 >= 0 f527_0_appendNewList_Store(EOS(STATIC_527), i48, o44[SharingAnalysis.field]o56) -> f552_0_appendNewList_JMP(EOS(STATIC_552), i48, o44[SharingAnalysis.field]o56) :|: TRUE f552_0_appendNewList_JMP(EOS(STATIC_552), i48, o44[SharingAnalysis.field]o56) -> f584_0_appendNewList_Load(EOS(STATIC_584), i48, o44[SharingAnalysis.field]o56) :|: TRUE f584_0_appendNewList_Load(EOS(STATIC_584), i48, o44[SharingAnalysis.field]o56) -> f394_0_appendNewList_Load(EOS(STATIC_394), i48, o44[SharingAnalysis.field]o56) :|: TRUE f394_0_appendNewList_Load(EOS(STATIC_394), i37, o44[SharingAnalysis.field]o41) -> f400_0_appendNewList_ConstantStackPush(EOS(STATIC_400), i37, i37, o44[SharingAnalysis.field]o41) :|: TRUE f515_0_appendNewList_FieldAccess(EOS(STATIC_515), i48) -> f531_0_appendNewList_FieldAccess(EOS(STATIC_531), i48) :|: TRUE f531_0_appendNewList_FieldAccess(EOS(STATIC_531), i48) -> f562_0_appendNewList_Store(EOS(STATIC_562), i48) :|: TRUE f562_0_appendNewList_Store(EOS(STATIC_562), i48) -> f589_0_appendNewList_JMP(EOS(STATIC_589), i48) :|: TRUE f589_0_appendNewList_JMP(EOS(STATIC_589), i48) -> f616_0_appendNewList_Load(EOS(STATIC_616), i48) :|: TRUE f616_0_appendNewList_Load(EOS(STATIC_616), i48) -> f394_0_appendNewList_Load(EOS(STATIC_394), i48, o63[SharingAnalysis.field]o56) :|: o63[SharingAnalysis.field]o56 = 1 Combined rules. Obtained 2 IRulesP rules: f400_0_appendNewList_ConstantStackPush(EOS(STATIC_400), i37:0, i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(EOS(STATIC_400), i37:0 - 1, i37:0 - 1, 1) :|: i37:0 > 1 f400_0_appendNewList_ConstantStackPush(EOS(STATIC_400), i37:0, i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(EOS(STATIC_400), i37:0 - 1, i37:0 - 1, o44[SharingAnalysis.field]o56:0) :|: o44[SharingAnalysis.field]o41:0 > 0 && o44[SharingAnalysis.field]o56:0 > o44[SharingAnalysis.field]o41:0 && i37:0 > 1 Filtered constant ground arguments: f400_0_appendNewList_ConstantStackPush(x1, x2, x3, x4) -> f400_0_appendNewList_ConstantStackPush(x2, x3, x4) EOS(x1) -> EOS Filtered duplicate arguments: f400_0_appendNewList_ConstantStackPush(x1, x2, x3) -> f400_0_appendNewList_ConstantStackPush(x2, x3) Finished conversion. Obtained 2 rules.P rules: f400_0_appendNewList_ConstantStackPush(i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(i37:0 - 1, 1) :|: i37:0 > 1 f400_0_appendNewList_ConstantStackPush(i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(i37:0 - 1, o44[SharingAnalysis.field]o56:0) :|: o44[SharingAnalysis.field]o56:0 > o44[SharingAnalysis.field]o41:0 && i37:0 > 1 && o44[SharingAnalysis.field]o41:0 > 0 ---------------------------------------- (14) Obligation: Rules: f400_0_appendNewList_ConstantStackPush(i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(i37:0 - 1, 1) :|: i37:0 > 1 f400_0_appendNewList_ConstantStackPush(x, x1) -> f400_0_appendNewList_ConstantStackPush(x - 1, x2) :|: x2 > x1 && x > 1 && x1 > 0 ---------------------------------------- (15) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (16) Obligation: Rules: f400_0_appendNewList_ConstantStackPush(i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(arith, 1) :|: i37:0 > 1 && arith = i37:0 - 1 f400_0_appendNewList_ConstantStackPush(x3, x4) -> f400_0_appendNewList_ConstantStackPush(x5, x6) :|: x6 > x4 && x3 > 1 && x4 > 0 && x5 = x3 - 1 ---------------------------------------- (17) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f400_0_appendNewList_ConstantStackPush(i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(arith, 1) :|: i37:0 > 1 && arith = i37:0 - 1 (2) f400_0_appendNewList_ConstantStackPush(x3, x4) -> f400_0_appendNewList_ConstantStackPush(x5, x6) :|: x6 > x4 && x3 > 1 && x4 > 0 && x5 = x3 - 1 Arcs: (1) -> (1), (2) (2) -> (1), (2) This digraph is fully evaluated! ---------------------------------------- (18) Obligation: Termination digraph: Nodes: (1) f400_0_appendNewList_ConstantStackPush(i37:0, o44[SharingAnalysis.field]o41:0) -> f400_0_appendNewList_ConstantStackPush(arith, 1) :|: i37:0 > 1 && arith = i37:0 - 1 (2) f400_0_appendNewList_ConstantStackPush(x3, x4) -> f400_0_appendNewList_ConstantStackPush(x5, x6) :|: x6 > x4 && x3 > 1 && x4 > 0 && x5 = x3 - 1 Arcs: (1) -> (1), (2) (2) -> (1), (2) This digraph is fully evaluated! ---------------------------------------- (19) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (20) Obligation: Rules: f400_0_appendNewList_ConstantStackPush(i37:0:0, o44[SharingAnalysis.field]o41:0:0) -> f400_0_appendNewList_ConstantStackPush(i37:0:0 - 1, 1) :|: i37:0:0 > 1 f400_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f400_0_appendNewList_ConstantStackPush(x3:0 - 1, x6:0) :|: x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0 ---------------------------------------- (21) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f400_0_appendNewList_ConstantStackPush(INTEGER, VARIABLE) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (22) Obligation: Rules: f400_0_appendNewList_ConstantStackPush(i37:0:0, o44[SharingAnalysis.field]o41:0:0) -> f400_0_appendNewList_ConstantStackPush(c, c1) :|: c1 = 1 && c = i37:0:0 - 1 && i37:0:0 > 1 f400_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f400_0_appendNewList_ConstantStackPush(c2, x6:0) :|: c2 = x3:0 - 1 && (x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0) ---------------------------------------- (23) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f400_0_appendNewList_ConstantStackPush(x, x1)] = x The following rules are decreasing: f400_0_appendNewList_ConstantStackPush(i37:0:0, o44[SharingAnalysis.field]o41:0:0) -> f400_0_appendNewList_ConstantStackPush(c, c1) :|: c1 = 1 && c = i37:0:0 - 1 && i37:0:0 > 1 f400_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f400_0_appendNewList_ConstantStackPush(c2, x6:0) :|: c2 = x3:0 - 1 && (x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0) The following rules are bounded: f400_0_appendNewList_ConstantStackPush(i37:0:0, o44[SharingAnalysis.field]o41:0:0) -> f400_0_appendNewList_ConstantStackPush(c, c1) :|: c1 = 1 && c = i37:0:0 - 1 && i37:0:0 > 1 f400_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f400_0_appendNewList_ConstantStackPush(c2, x6:0) :|: c2 = x3:0 - 1 && (x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0) ---------------------------------------- (24) YES