/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 379 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 134 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToIRSProof [SOUND, 84 ms] (14) IRSwT (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 19 ms] (18) IRSwT (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IRSwT (21) TempFilterProof [SOUND, 22 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: f879_0_copy_NULL(EOS(STATIC_879), java.lang.Object(o135sub), java.lang.Object(o135sub)) -> f880_0_copy_NULL(EOS(STATIC_880), java.lang.Object(o135sub), java.lang.Object(o135sub)) :|: TRUE f880_0_copy_NULL(EOS(STATIC_880), java.lang.Object(o135sub), java.lang.Object(o135sub)) -> f882_0_copy_New(EOS(STATIC_882), java.lang.Object(o135sub)) :|: TRUE f882_0_copy_New(EOS(STATIC_882), java.lang.Object(o135sub)) -> f884_0_copy_Duplicate(EOS(STATIC_884), java.lang.Object(o135sub)) :|: TRUE f884_0_copy_Duplicate(EOS(STATIC_884), java.lang.Object(o135sub)) -> f886_0_copy_InvokeMethod(EOS(STATIC_886), java.lang.Object(o135sub)) :|: TRUE f886_0_copy_InvokeMethod(EOS(STATIC_886), java.lang.Object(o135sub)) -> f888_0__init__Load(EOS(STATIC_888), java.lang.Object(o135sub)) :|: TRUE f888_0__init__Load(EOS(STATIC_888), java.lang.Object(o135sub)) -> f889_0__init__InvokeMethod(EOS(STATIC_889), java.lang.Object(o135sub)) :|: TRUE f889_0__init__InvokeMethod(EOS(STATIC_889), java.lang.Object(o135sub)) -> f890_0__init__Return(EOS(STATIC_890), java.lang.Object(o135sub)) :|: TRUE f890_0__init__Return(EOS(STATIC_890), java.lang.Object(o135sub)) -> f891_0_copy_Store(EOS(STATIC_891), java.lang.Object(o135sub)) :|: TRUE f891_0_copy_Store(EOS(STATIC_891), java.lang.Object(o135sub)) -> f938_0_copy_Load(EOS(STATIC_938), java.lang.Object(o135sub)) :|: TRUE f938_0_copy_Load(EOS(STATIC_938), java.lang.Object(o135sub)) -> f939_0_copy_Load(EOS(STATIC_939), java.lang.Object(o135sub)) :|: TRUE f939_0_copy_Load(EOS(STATIC_939), java.lang.Object(o135sub)) -> f940_0_copy_FieldAccess(EOS(STATIC_940), java.lang.Object(o135sub), java.lang.Object(o135sub)) :|: TRUE f940_0_copy_FieldAccess(EOS(STATIC_940), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f941_0_copy_FieldAccess(EOS(STATIC_941), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) :|: TRUE f941_0_copy_FieldAccess(EOS(STATIC_941), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f942_0_copy_FieldAccess(EOS(STATIC_942), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) :|: TRUE f942_0_copy_FieldAccess(EOS(STATIC_942), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f949_0_copy_Load(EOS(STATIC_949), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) :|: TRUE f949_0_copy_Load(EOS(STATIC_949), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f958_0_copy_Load(EOS(STATIC_958), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) :|: TRUE f958_0_copy_Load(EOS(STATIC_958), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f962_0_copy_FieldAccess(EOS(STATIC_962), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) :|: TRUE f962_0_copy_FieldAccess(EOS(STATIC_962), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f963_0_copy_Load(EOS(STATIC_963), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) :|: TRUE f963_0_copy_Load(EOS(STATIC_963), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f1045_0_copy_FieldAccess(EOS(STATIC_1045), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) :|: TRUE f1045_0_copy_FieldAccess(EOS(STATIC_1045), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66, o142))) -> f1046_0_copy_Store(EOS(STATIC_1046), o142) :|: TRUE f1046_0_copy_Store(EOS(STATIC_1046), o142) -> f1047_0_copy_Load(EOS(STATIC_1047), o142) :|: TRUE f1047_0_copy_Load(EOS(STATIC_1047), o142) -> f1048_0_copy_FieldAccess(EOS(STATIC_1048), o142) :|: TRUE f1048_0_copy_FieldAccess(EOS(STATIC_1048), o142) -> f1049_0_copy_Store(EOS(STATIC_1049), o142) :|: TRUE f1049_0_copy_Store(EOS(STATIC_1049), o142) -> f1050_0_copy_JMP(EOS(STATIC_1050), o142) :|: TRUE f1050_0_copy_JMP(EOS(STATIC_1050), o142) -> f1051_0_copy_Load(EOS(STATIC_1051), o142) :|: TRUE f1051_0_copy_Load(EOS(STATIC_1051), o142) -> f878_0_copy_Load(EOS(STATIC_878), o142) :|: TRUE f878_0_copy_Load(EOS(STATIC_878), o128) -> f879_0_copy_NULL(EOS(STATIC_879), o128, o128) :|: TRUE R rules: Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.P rules: f879_0_copy_NULL(EOS(STATIC_879), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66:0, o142:0)), java.lang.Object(SharingAnalysis.SharingAnalysis(EOC, i66:0, o142:0))) -> f879_0_copy_NULL(EOS(STATIC_879), o142:0, o142:0) :|: TRUE R rules: Filtered ground terms: f879_0_copy_NULL(x1, x2, x3) -> f879_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: f879_0_copy_NULL(x1, x2) -> f879_0_copy_NULL(x2) Combined rules. Obtained 1 conditional rules for P and 0 conditional rules for R.P rules: F879_0_COPY_NULL(java.lang.Object(SharingAnalysis.SharingAnalysis(o142:0:0))) -> F879_0_COPY_NULL(o142:0:0) :|: TRUE R rules: ---------------------------------------- (9) Obligation: Q DP problem: The TRS P consists of the following rules: F879_0_COPY_NULL(java.lang.Object(SharingAnalysis.SharingAnalysis(o142:0:0))) -> F879_0_COPY_NULL(o142: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: *F879_0_COPY_NULL(java.lang.Object(SharingAnalysis.SharingAnalysis(o142:0:0))) -> F879_0_COPY_NULL(o142: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: f427_0_appendNewList_ConstantStackPush(EOS(STATIC_427), i35, i35, o45[SharingAnalysis.field]o42) -> f439_0_appendNewList_LE(EOS(STATIC_439), i35, i35, 1, o45[SharingAnalysis.field]o42) :|: TRUE f439_0_appendNewList_LE(EOS(STATIC_439), i47, i47, matching1, o45[SharingAnalysis.field]o42) -> f446_0_appendNewList_LE(EOS(STATIC_446), i47, i47, 1, o45[SharingAnalysis.field]o42) :|: TRUE && matching1 = 1 f446_0_appendNewList_LE(EOS(STATIC_446), i47, i47, matching1, o45[SharingAnalysis.field]o42) -> f449_0_appendNewList_Inc(EOS(STATIC_449), i47, o45[SharingAnalysis.field]o42) :|: i47 > 1 && matching1 = 1 f449_0_appendNewList_Inc(EOS(STATIC_449), i47, o45[SharingAnalysis.field]o42) -> f455_0_appendNewList_Load(EOS(STATIC_455), i47 + -1, o45[SharingAnalysis.field]o42) :|: TRUE f455_0_appendNewList_Load(EOS(STATIC_455), i48, o45[SharingAnalysis.field]o42) -> f461_0_appendNewList_New(EOS(STATIC_461), i48, o45[SharingAnalysis.field]o42) :|: TRUE f461_0_appendNewList_New(EOS(STATIC_461), i48, o45[SharingAnalysis.field]o42) -> f465_0_appendNewList_Duplicate(EOS(STATIC_465), i48, o45[SharingAnalysis.field]o42) :|: TRUE f465_0_appendNewList_Duplicate(EOS(STATIC_465), i48, o45[SharingAnalysis.field]o42) -> f467_0_appendNewList_InvokeMethod(EOS(STATIC_467), i48, o45[SharingAnalysis.field]o42) :|: TRUE f467_0_appendNewList_InvokeMethod(EOS(STATIC_467), i48, o45[SharingAnalysis.field]o42) -> f472_0__init__Load(EOS(STATIC_472), i48, o45[SharingAnalysis.field]o42) :|: TRUE f472_0__init__Load(EOS(STATIC_472), i48, o45[SharingAnalysis.field]o42) -> f478_0__init__InvokeMethod(EOS(STATIC_478), i48, o45[SharingAnalysis.field]o42) :|: TRUE f478_0__init__InvokeMethod(EOS(STATIC_478), i48, o45[SharingAnalysis.field]o42) -> f481_0__init__Return(EOS(STATIC_481), i48, o45[SharingAnalysis.field]o42) :|: TRUE f481_0__init__Return(EOS(STATIC_481), i48, o45[SharingAnalysis.field]o42) -> f486_0_appendNewList_Duplicate(EOS(STATIC_486), i48, o45[SharingAnalysis.field]o42) :|: TRUE f486_0_appendNewList_Duplicate(EOS(STATIC_486), i48, o45[SharingAnalysis.field]o42) -> f488_0_appendNewList_FieldAccess(EOS(STATIC_488), i48, o45[SharingAnalysis.field]o42) :|: TRUE f488_0_appendNewList_FieldAccess(EOS(STATIC_488), i48, o45[SharingAnalysis.field]o42) -> f533_0_appendNewList_FieldAccess(EOS(STATIC_533), i48, o45[SharingAnalysis.field]o42) :|: o45[SharingAnalysis.field]o42 > 0 f488_0_appendNewList_FieldAccess(EOS(STATIC_488), i48, o68[SharingAnalysis.field]o68) -> f534_0_appendNewList_FieldAccess(EOS(STATIC_534), i48) :|: TRUE f533_0_appendNewList_FieldAccess(EOS(STATIC_533), i48, o45[SharingAnalysis.field]o42) -> f544_0_appendNewList_Store(EOS(STATIC_544), i48, o45[SharingAnalysis.field]o62) :|: o45[SharingAnalysis.field]o62 > o45[SharingAnalysis.field]o42 && o45[SharingAnalysis.field]o42 >= 0 f544_0_appendNewList_Store(EOS(STATIC_544), i48, o45[SharingAnalysis.field]o62) -> f552_0_appendNewList_JMP(EOS(STATIC_552), i48, o45[SharingAnalysis.field]o62) :|: TRUE f552_0_appendNewList_JMP(EOS(STATIC_552), i48, o45[SharingAnalysis.field]o62) -> f604_0_appendNewList_Load(EOS(STATIC_604), i48, o45[SharingAnalysis.field]o62) :|: TRUE f604_0_appendNewList_Load(EOS(STATIC_604), i48, o45[SharingAnalysis.field]o62) -> f420_0_appendNewList_Load(EOS(STATIC_420), i48, o45[SharingAnalysis.field]o62) :|: TRUE f420_0_appendNewList_Load(EOS(STATIC_420), i35, o45[SharingAnalysis.field]o42) -> f427_0_appendNewList_ConstantStackPush(EOS(STATIC_427), i35, i35, o45[SharingAnalysis.field]o42) :|: TRUE f534_0_appendNewList_FieldAccess(EOS(STATIC_534), i48) -> f547_0_appendNewList_FieldAccess(EOS(STATIC_547), i48) :|: TRUE f547_0_appendNewList_FieldAccess(EOS(STATIC_547), i48) -> f563_0_appendNewList_Store(EOS(STATIC_563), i48) :|: TRUE f563_0_appendNewList_Store(EOS(STATIC_563), i48) -> f633_0_appendNewList_JMP(EOS(STATIC_633), i48) :|: TRUE f633_0_appendNewList_JMP(EOS(STATIC_633), i48) -> f651_0_appendNewList_Load(EOS(STATIC_651), i48) :|: TRUE f651_0_appendNewList_Load(EOS(STATIC_651), i48) -> f420_0_appendNewList_Load(EOS(STATIC_420), i48, o69[SharingAnalysis.field]o62) :|: o69[SharingAnalysis.field]o62 = 1 Combined rules. Obtained 2 IRulesP rules: f427_0_appendNewList_ConstantStackPush(EOS(STATIC_427), i35:0, i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(EOS(STATIC_427), i35:0 - 1, i35:0 - 1, 1) :|: i35:0 > 1 f427_0_appendNewList_ConstantStackPush(EOS(STATIC_427), i35:0, i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(EOS(STATIC_427), i35:0 - 1, i35:0 - 1, o45[SharingAnalysis.field]o62:0) :|: o45[SharingAnalysis.field]o42:0 > 0 && o45[SharingAnalysis.field]o62:0 > o45[SharingAnalysis.field]o42:0 && i35:0 > 1 Filtered constant ground arguments: f427_0_appendNewList_ConstantStackPush(x1, x2, x3, x4) -> f427_0_appendNewList_ConstantStackPush(x2, x3, x4) EOS(x1) -> EOS Filtered duplicate arguments: f427_0_appendNewList_ConstantStackPush(x1, x2, x3) -> f427_0_appendNewList_ConstantStackPush(x2, x3) Finished conversion. Obtained 2 rules.P rules: f427_0_appendNewList_ConstantStackPush(i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(i35:0 - 1, 1) :|: i35:0 > 1 f427_0_appendNewList_ConstantStackPush(i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(i35:0 - 1, o45[SharingAnalysis.field]o62:0) :|: o45[SharingAnalysis.field]o62:0 > o45[SharingAnalysis.field]o42:0 && i35:0 > 1 && o45[SharingAnalysis.field]o42:0 > 0 ---------------------------------------- (14) Obligation: Rules: f427_0_appendNewList_ConstantStackPush(i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(i35:0 - 1, 1) :|: i35:0 > 1 f427_0_appendNewList_ConstantStackPush(x, x1) -> f427_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: f427_0_appendNewList_ConstantStackPush(i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(arith, 1) :|: i35:0 > 1 && arith = i35:0 - 1 f427_0_appendNewList_ConstantStackPush(x3, x4) -> f427_0_appendNewList_ConstantStackPush(x5, x6) :|: x6 > x4 && x3 > 1 && x4 > 0 && x5 = x3 - 1 ---------------------------------------- (17) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f427_0_appendNewList_ConstantStackPush(i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(arith, 1) :|: i35:0 > 1 && arith = i35:0 - 1 (2) f427_0_appendNewList_ConstantStackPush(x3, x4) -> f427_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) f427_0_appendNewList_ConstantStackPush(i35:0, o45[SharingAnalysis.field]o42:0) -> f427_0_appendNewList_ConstantStackPush(arith, 1) :|: i35:0 > 1 && arith = i35:0 - 1 (2) f427_0_appendNewList_ConstantStackPush(x3, x4) -> f427_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: f427_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f427_0_appendNewList_ConstantStackPush(x3:0 - 1, x6:0) :|: x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0 f427_0_appendNewList_ConstantStackPush(i35:0:0, o45[SharingAnalysis.field]o42:0:0) -> f427_0_appendNewList_ConstantStackPush(i35:0:0 - 1, 1) :|: i35:0:0 > 1 ---------------------------------------- (21) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f427_0_appendNewList_ConstantStackPush(INTEGER, VARIABLE) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (22) Obligation: Rules: f427_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f427_0_appendNewList_ConstantStackPush(c, x6:0) :|: c = x3:0 - 1 && (x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0) f427_0_appendNewList_ConstantStackPush(i35:0:0, o45[SharingAnalysis.field]o42:0:0) -> f427_0_appendNewList_ConstantStackPush(c1, c2) :|: c2 = 1 && c1 = i35:0:0 - 1 && i35:0:0 > 1 ---------------------------------------- (23) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f427_0_appendNewList_ConstantStackPush(x, x1)] = x The following rules are decreasing: f427_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f427_0_appendNewList_ConstantStackPush(c, x6:0) :|: c = x3:0 - 1 && (x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0) f427_0_appendNewList_ConstantStackPush(i35:0:0, o45[SharingAnalysis.field]o42:0:0) -> f427_0_appendNewList_ConstantStackPush(c1, c2) :|: c2 = 1 && c1 = i35:0:0 - 1 && i35:0:0 > 1 The following rules are bounded: f427_0_appendNewList_ConstantStackPush(x3:0, x4:0) -> f427_0_appendNewList_ConstantStackPush(c, x6:0) :|: c = x3:0 - 1 && (x6:0 > x4:0 && x3:0 > 1 && x4:0 > 0) f427_0_appendNewList_ConstantStackPush(i35:0:0, o45[SharingAnalysis.field]o42:0:0) -> f427_0_appendNewList_ConstantStackPush(c1, c2) :|: c2 = 1 && c1 = i35:0:0 - 1 && i35:0:0 > 1 ---------------------------------------- (24) YES