MAYBE proof of prog.inttrs # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given IRSwT could not be shown: (0) IRSwT (1) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (2) IRSwT (3) IRSwTTerminationDigraphProof [EQUIVALENT, 1632 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 74 ms] (6) IRSwT (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IRSwT (9) TempFilterProof [SOUND, 898 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 27 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT ---------------------------------------- (0) Obligation: Rules: l0(aHAT0, bHAT0, iHAT0, nHAT0, tmpHAT0) -> l1(aHATpost, bHATpost, iHATpost, nHATpost, tmpHATpost) :|: tmpHAT0 = tmpHATpost && nHAT0 = nHATpost && iHAT0 = iHATpost && bHAT0 = bHATpost && aHAT0 = aHATpost && aHAT0 <= 0 l0(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x6 = 1 + x1 && x5 = -1 + x && 1 <= x l3(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15 l2(x20, x21, x22, x23, x24) -> l4(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25 l5(x30, x31, x32, x33, x34) -> l6(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x31 = x36 && x30 = x35 && x37 = -1 + x32 l6(x40, x41, x42, x43, x44) -> l7(x45, x46, x47, x48, x49) :|: x44 = x49 && x43 = x48 && x42 = x47 && x41 = x46 && x40 = x45 l8(x50, x51, x52, x53, x54) -> l5(x55, x56, x57, x58, x59) :|: x54 = x59 && x53 = x58 && x52 = x57 && x56 = 1 + x51 && x55 = -1 + x50 l9(x60, x61, x62, x63, x64) -> l5(x65, x66, x67, x68, x69) :|: x64 = x69 && x63 = x68 && x62 = x67 && x61 = x66 && x60 = x65 && 0 <= x64 && x64 <= 0 l9(x70, x71, x72, x73, x74) -> l8(x75, x76, x77, x78, x79) :|: x74 = x79 && x73 = x78 && x72 = x77 && x71 = x76 && x70 = x75 && 1 <= x74 l9(x80, x81, x82, x83, x84) -> l8(x85, x86, x87, x88, x89) :|: x84 = x89 && x83 = x88 && x82 = x87 && x81 = x86 && x80 = x85 && 1 + x84 <= 0 l7(x90, x91, x92, x93, x94) -> l2(x95, x96, x97, x98, x99) :|: x94 = x99 && x93 = x98 && x92 = x97 && x91 = x96 && x90 = x95 && x92 <= 0 l7(x100, x101, x102, x103, x104) -> l9(x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x101 = x106 && x100 = x105 && x109 = x109 && 1 <= x102 l4(x110, x111, x112, x113, x114) -> l3(x115, x116, x117, x118, x119) :|: x114 = x119 && x113 = x118 && x112 = x117 && x111 = x116 && x110 = x115 && x111 <= 0 l4(x120, x121, x122, x123, x124) -> l6(x125, x126, x127, x128, x129) :|: x124 = x129 && x123 = x128 && x120 = x125 && x127 = -1 + x120 && x126 = -1 + x121 && 1 <= x121 l10(x130, x131, x132, x133, x134) -> l3(x135, x136, x137, x138, x139) :|: x134 = x139 && x133 = x138 && x132 = x137 && x136 = 0 && x135 = x133 l11(x140, x141, x142, x143, x144) -> l10(x145, x146, x147, x148, x149) :|: x144 = x149 && x143 = x148 && x142 = x147 && x141 = x146 && x140 = x145 Start term: l11(aHAT0, bHAT0, iHAT0, nHAT0, tmpHAT0) ---------------------------------------- (1) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (2) Obligation: Rules: l0(aHAT0, bHAT0, iHAT0, nHAT0, tmpHAT0) -> l1(aHATpost, bHATpost, iHATpost, nHATpost, tmpHATpost) :|: tmpHAT0 = tmpHATpost && nHAT0 = nHATpost && iHAT0 = iHATpost && bHAT0 = bHATpost && aHAT0 = aHATpost && aHAT0 <= 0 l0(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x6 = 1 + x1 && x5 = -1 + x && 1 <= x l3(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15 l2(x20, x21, x22, x23, x24) -> l4(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25 l5(x30, x31, x32, x33, x34) -> l6(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x31 = x36 && x30 = x35 && x37 = -1 + x32 l6(x40, x41, x42, x43, x44) -> l7(x45, x46, x47, x48, x49) :|: x44 = x49 && x43 = x48 && x42 = x47 && x41 = x46 && x40 = x45 l8(x50, x51, x52, x53, x54) -> l5(x55, x56, x57, x58, x59) :|: x54 = x59 && x53 = x58 && x52 = x57 && x56 = 1 + x51 && x55 = -1 + x50 l9(x60, x61, x62, x63, x64) -> l5(x65, x66, x67, x68, x69) :|: x64 = x69 && x63 = x68 && x62 = x67 && x61 = x66 && x60 = x65 && 0 <= x64 && x64 <= 0 l9(x70, x71, x72, x73, x74) -> l8(x75, x76, x77, x78, x79) :|: x74 = x79 && x73 = x78 && x72 = x77 && x71 = x76 && x70 = x75 && 1 <= x74 l9(x80, x81, x82, x83, x84) -> l8(x85, x86, x87, x88, x89) :|: x84 = x89 && x83 = x88 && x82 = x87 && x81 = x86 && x80 = x85 && 1 + x84 <= 0 l7(x90, x91, x92, x93, x94) -> l2(x95, x96, x97, x98, x99) :|: x94 = x99 && x93 = x98 && x92 = x97 && x91 = x96 && x90 = x95 && x92 <= 0 l7(x100, x101, x102, x103, x104) -> l9(x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x101 = x106 && x100 = x105 && x109 = x109 && 1 <= x102 l4(x110, x111, x112, x113, x114) -> l3(x115, x116, x117, x118, x119) :|: x114 = x119 && x113 = x118 && x112 = x117 && x111 = x116 && x110 = x115 && x111 <= 0 l4(x120, x121, x122, x123, x124) -> l6(x125, x126, x127, x128, x129) :|: x124 = x129 && x123 = x128 && x120 = x125 && x127 = -1 + x120 && x126 = -1 + x121 && 1 <= x121 l10(x130, x131, x132, x133, x134) -> l3(x135, x136, x137, x138, x139) :|: x134 = x139 && x133 = x138 && x132 = x137 && x136 = 0 && x135 = x133 l11(x140, x141, x142, x143, x144) -> l10(x145, x146, x147, x148, x149) :|: x144 = x149 && x143 = x148 && x142 = x147 && x141 = x146 && x140 = x145 Start term: l11(aHAT0, bHAT0, iHAT0, nHAT0, tmpHAT0) ---------------------------------------- (3) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) l0(aHAT0, bHAT0, iHAT0, nHAT0, tmpHAT0) -> l1(aHATpost, bHATpost, iHATpost, nHATpost, tmpHATpost) :|: tmpHAT0 = tmpHATpost && nHAT0 = nHATpost && iHAT0 = iHATpost && bHAT0 = bHATpost && aHAT0 = aHATpost && aHAT0 <= 0 (2) l0(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x6 = 1 + x1 && x5 = -1 + x && 1 <= x (3) l3(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15 (4) l2(x20, x21, x22, x23, x24) -> l4(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25 (5) l5(x30, x31, x32, x33, x34) -> l6(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x31 = x36 && x30 = x35 && x37 = -1 + x32 (6) l6(x40, x41, x42, x43, x44) -> l7(x45, x46, x47, x48, x49) :|: x44 = x49 && x43 = x48 && x42 = x47 && x41 = x46 && x40 = x45 (7) l8(x50, x51, x52, x53, x54) -> l5(x55, x56, x57, x58, x59) :|: x54 = x59 && x53 = x58 && x52 = x57 && x56 = 1 + x51 && x55 = -1 + x50 (8) l9(x60, x61, x62, x63, x64) -> l5(x65, x66, x67, x68, x69) :|: x64 = x69 && x63 = x68 && x62 = x67 && x61 = x66 && x60 = x65 && 0 <= x64 && x64 <= 0 (9) l9(x70, x71, x72, x73, x74) -> l8(x75, x76, x77, x78, x79) :|: x74 = x79 && x73 = x78 && x72 = x77 && x71 = x76 && x70 = x75 && 1 <= x74 (10) l9(x80, x81, x82, x83, x84) -> l8(x85, x86, x87, x88, x89) :|: x84 = x89 && x83 = x88 && x82 = x87 && x81 = x86 && x80 = x85 && 1 + x84 <= 0 (11) l7(x90, x91, x92, x93, x94) -> l2(x95, x96, x97, x98, x99) :|: x94 = x99 && x93 = x98 && x92 = x97 && x91 = x96 && x90 = x95 && x92 <= 0 (12) l7(x100, x101, x102, x103, x104) -> l9(x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x101 = x106 && x100 = x105 && x109 = x109 && 1 <= x102 (13) l4(x110, x111, x112, x113, x114) -> l3(x115, x116, x117, x118, x119) :|: x114 = x119 && x113 = x118 && x112 = x117 && x111 = x116 && x110 = x115 && x111 <= 0 (14) l4(x120, x121, x122, x123, x124) -> l6(x125, x126, x127, x128, x129) :|: x124 = x129 && x123 = x128 && x120 = x125 && x127 = -1 + x120 && x126 = -1 + x121 && 1 <= x121 (15) l10(x130, x131, x132, x133, x134) -> l3(x135, x136, x137, x138, x139) :|: x134 = x139 && x133 = x138 && x132 = x137 && x136 = 0 && x135 = x133 (16) l11(x140, x141, x142, x143, x144) -> l10(x145, x146, x147, x148, x149) :|: x144 = x149 && x143 = x148 && x142 = x147 && x141 = x146 && x140 = x145 Arcs: (2) -> (4) (3) -> (1), (2) (4) -> (13), (14) (5) -> (6) (6) -> (11), (12) (7) -> (5) (8) -> (5) (9) -> (7) (10) -> (7) (11) -> (4) (12) -> (8), (9), (10) (13) -> (3) (14) -> (6) (15) -> (3) (16) -> (15) This digraph is fully evaluated! ---------------------------------------- (4) Obligation: Termination digraph: Nodes: (1) l0(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x6 = 1 + x1 && x5 = -1 + x && 1 <= x (2) l3(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15 (3) l4(x110, x111, x112, x113, x114) -> l3(x115, x116, x117, x118, x119) :|: x114 = x119 && x113 = x118 && x112 = x117 && x111 = x116 && x110 = x115 && x111 <= 0 (4) l2(x20, x21, x22, x23, x24) -> l4(x25, x26, x27, x28, x29) :|: x24 = x29 && x23 = x28 && x22 = x27 && x21 = x26 && x20 = x25 (5) l7(x90, x91, x92, x93, x94) -> l2(x95, x96, x97, x98, x99) :|: x94 = x99 && x93 = x98 && x92 = x97 && x91 = x96 && x90 = x95 && x92 <= 0 (6) l6(x40, x41, x42, x43, x44) -> l7(x45, x46, x47, x48, x49) :|: x44 = x49 && x43 = x48 && x42 = x47 && x41 = x46 && x40 = x45 (7) l4(x120, x121, x122, x123, x124) -> l6(x125, x126, x127, x128, x129) :|: x124 = x129 && x123 = x128 && x120 = x125 && x127 = -1 + x120 && x126 = -1 + x121 && 1 <= x121 (8) l5(x30, x31, x32, x33, x34) -> l6(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x31 = x36 && x30 = x35 && x37 = -1 + x32 (9) l9(x60, x61, x62, x63, x64) -> l5(x65, x66, x67, x68, x69) :|: x64 = x69 && x63 = x68 && x62 = x67 && x61 = x66 && x60 = x65 && 0 <= x64 && x64 <= 0 (10) l8(x50, x51, x52, x53, x54) -> l5(x55, x56, x57, x58, x59) :|: x54 = x59 && x53 = x58 && x52 = x57 && x56 = 1 + x51 && x55 = -1 + x50 (11) l9(x80, x81, x82, x83, x84) -> l8(x85, x86, x87, x88, x89) :|: x84 = x89 && x83 = x88 && x82 = x87 && x81 = x86 && x80 = x85 && 1 + x84 <= 0 (12) l9(x70, x71, x72, x73, x74) -> l8(x75, x76, x77, x78, x79) :|: x74 = x79 && x73 = x78 && x72 = x77 && x71 = x76 && x70 = x75 && 1 <= x74 (13) l7(x100, x101, x102, x103, x104) -> l9(x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x101 = x106 && x100 = x105 && x109 = x109 && 1 <= x102 Arcs: (1) -> (4) (2) -> (1) (3) -> (2) (4) -> (3), (7) (5) -> (4) (6) -> (5), (13) (7) -> (6) (8) -> (6) (9) -> (8) (10) -> (8) (11) -> (10) (12) -> (10) (13) -> (9), (11), (12) This digraph is fully evaluated! ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: l6(x105:0, x106:0, x107:0, x108:0, x44:0) -> l6(x105:0, x106:0, -1 + x107:0, x108:0, x109:0) :|: x109:0 < 1 && x109:0 > -1 && x107:0 > 0 l6(x, x1, x2, x3, x4) -> l6(-1 + x, 1 + x1, -1 + x2, x3, x5) :|: x2 > 0 && x5 > 0 l4(x120:0, x121:0, x122:0, x123:0, x124:0) -> l6(x120:0, -1 + x121:0, -1 + x120:0, x123:0, x124:0) :|: x121:0 > 0 l6(x6, x7, x8, x9, x10) -> l6(-1 + x6, 1 + x7, -1 + x8, x9, x11) :|: x8 > 0 && x11 < 0 l4(x110:0, x111:0, x112:0, x113:0, x114:0) -> l4(-1 + x110:0, 1 + x111:0, x112:0, x113:0, x114:0) :|: x111:0 < 1 && x110:0 > 0 l6(x25:0, x26:0, x27:0, x28:0, x29:0) -> l4(x25:0, x26:0, x27:0, x28:0, x29:0) :|: x27:0 < 1 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: l6(x1, x2, x3, x4, x5) -> l6(x1, x2, x3) l4(x1, x2, x3, x4, x5) -> l4(x1, x2) ---------------------------------------- (8) Obligation: Rules: l6(x105:0, x106:0, x107:0) -> l6(x105:0, x106:0, -1 + x107:0) :|: x109:0 < 1 && x109:0 > -1 && x107:0 > 0 l6(x, x1, x2) -> l6(-1 + x, 1 + x1, -1 + x2) :|: x2 > 0 && x5 > 0 l4(x120:0, x121:0) -> l6(x120:0, -1 + x121:0, -1 + x120:0) :|: x121:0 > 0 l6(x6, x7, x8) -> l6(-1 + x6, 1 + x7, -1 + x8) :|: x8 > 0 && x11 < 0 l4(x110:0, x111:0) -> l4(-1 + x110:0, 1 + x111:0) :|: x111:0 < 1 && x110:0 > 0 l6(x25:0, x26:0, x27:0) -> l4(x25:0, x26:0) :|: x27:0 < 1 ---------------------------------------- (9) TempFilterProof (SOUND) Used the following sort dictionary for filtering: l6(VARIABLE, VARIABLE, INTEGER) l4(VARIABLE, VARIABLE) Replaced non-predefined constructor symbols by 0.The following proof was generated: # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given IntTRS could not be shown: - IntTRS - PolynomialOrderProcessor Rules: l6(x105:0, x106:0, x107:0) -> l6(x105:0, x106:0, c) :|: c = -1 + x107:0 && (x109:0 < 1 && x109:0 > -1 && x107:0 > 0) l6(x, x1, x2) -> l6(c1, c2, c3) :|: c3 = -1 + x2 && (c2 = 1 + x1 && c1 = -1 + x) && (x2 > 0 && x5 > 0) l4(x120:0, x121:0) -> l6(x120:0, c4, c5) :|: c5 = -1 + x120:0 && c4 = -1 + x121:0 && x121:0 > 0 l6(x6, x7, x8) -> l6(c6, c7, c8) :|: c8 = -1 + x8 && (c7 = 1 + x7 && c6 = -1 + x6) && (x8 > 0 && x11 < 0) l4(x110:0, x111:0) -> l4(c9, c10) :|: c10 = 1 + x111:0 && c9 = -1 + x110:0 && (x111:0 < 1 && x110:0 > 0) l6(x25:0, x26:0, x27:0) -> l4(x25:0, x26:0) :|: x27:0 < 1 Found the following polynomial interpretation: [l6(x, x1, x2)] = -1 + x [l4(x3, x4)] = -1 + x3 The following rules are decreasing: l6(x, x1, x2) -> l6(c1, c2, c3) :|: c3 = -1 + x2 && (c2 = 1 + x1 && c1 = -1 + x) && (x2 > 0 && x5 > 0) l6(x6, x7, x8) -> l6(c6, c7, c8) :|: c8 = -1 + x8 && (c7 = 1 + x7 && c6 = -1 + x6) && (x8 > 0 && x11 < 0) l4(x110:0, x111:0) -> l4(c9, c10) :|: c10 = 1 + x111:0 && c9 = -1 + x110:0 && (x111:0 < 1 && x110:0 > 0) The following rules are bounded: l4(x110:0, x111:0) -> l4(c9, c10) :|: c10 = 1 + x111:0 && c9 = -1 + x110:0 && (x111:0 < 1 && x110:0 > 0) - IntTRS - PolynomialOrderProcessor - IntTRS Rules: l6(x105:0, x106:0, x107:0) -> l6(x105:0, x106:0, c) :|: c = -1 + x107:0 && (x109:0 < 1 && x109:0 > -1 && x107:0 > 0) l6(x, x1, x2) -> l6(c1, c2, c3) :|: c3 = -1 + x2 && (c2 = 1 + x1 && c1 = -1 + x) && (x2 > 0 && x5 > 0) l4(x120:0, x121:0) -> l6(x120:0, c4, c5) :|: c5 = -1 + x120:0 && c4 = -1 + x121:0 && x121:0 > 0 l6(x6, x7, x8) -> l6(c6, c7, c8) :|: c8 = -1 + x8 && (c7 = 1 + x7 && c6 = -1 + x6) && (x8 > 0 && x11 < 0) l6(x25:0, x26:0, x27:0) -> l4(x25:0, x26:0) :|: x27:0 < 1 ---------------------------------------- (10) Obligation: Rules: l6(x105:0, x106:0, x107:0) -> l6(x105:0, x106:0, -1 + x107:0) :|: x109:0 < 1 && x109:0 > -1 && x107:0 > 0 l6(x, x1, x2) -> l6(-1 + x, 1 + x1, -1 + x2) :|: x2 > 0 && x5 > 0 l4(x120:0, x121:0) -> l6(x120:0, -1 + x121:0, -1 + x120:0) :|: x121:0 > 0 l6(x6, x7, x8) -> l6(-1 + x6, 1 + x7, -1 + x8) :|: x8 > 0 && x11 < 0 l6(x25:0, x26:0, x27:0) -> l4(x25:0, x26:0) :|: x27:0 < 1 ---------------------------------------- (11) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) l6(x105:0, x106:0, x107:0) -> l6(x105:0, x106:0, -1 + x107:0) :|: x109:0 < 1 && x109:0 > -1 && x107:0 > 0 (2) l6(x, x1, x2) -> l6(-1 + x, 1 + x1, -1 + x2) :|: x2 > 0 && x5 > 0 (3) l4(x120:0, x121:0) -> l6(x120:0, -1 + x121:0, -1 + x120:0) :|: x121:0 > 0 (4) l6(x6, x7, x8) -> l6(-1 + x6, 1 + x7, -1 + x8) :|: x8 > 0 && x11 < 0 (5) l6(x25:0, x26:0, x27:0) -> l4(x25:0, x26:0) :|: x27:0 < 1 Arcs: (1) -> (1), (2), (4), (5) (2) -> (1), (2), (4), (5) (3) -> (1), (2), (4), (5) (4) -> (1), (2), (4), (5) (5) -> (3) This digraph is fully evaluated! ---------------------------------------- (12) Obligation: Termination digraph: Nodes: (1) l6(x105:0, x106:0, x107:0) -> l6(x105:0, x106:0, -1 + x107:0) :|: x109:0 < 1 && x109:0 > -1 && x107:0 > 0 (2) l6(x, x1, x2) -> l6(-1 + x, 1 + x1, -1 + x2) :|: x2 > 0 && x5 > 0 (3) l4(x120:0, x121:0) -> l6(x120:0, -1 + x121:0, -1 + x120:0) :|: x121:0 > 0 (4) l6(x25:0, x26:0, x27:0) -> l4(x25:0, x26:0) :|: x27:0 < 1 (5) l6(x6, x7, x8) -> l6(-1 + x6, 1 + x7, -1 + x8) :|: x8 > 0 && x11 < 0 Arcs: (1) -> (1), (2), (4), (5) (2) -> (1), (2), (4), (5) (3) -> (1), (2), (4), (5) (4) -> (3) (5) -> (1), (2), (4), (5) This digraph is fully evaluated! ---------------------------------------- (13) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (14) Obligation: Rules: l6(x25:0:0, x26:0:0, x27:0:0) -> l6(x25:0:0, -1 + x26:0:0, -1 + x25:0:0) :|: x27:0:0 < 1 && x26:0:0 > 0 l6(x:0, x1:0, x2:0) -> l6(-1 + x:0, 1 + x1:0, -1 + x2:0) :|: x2:0 > 0 && x5:0 > 0 l6(x105:0:0, x106:0:0, x107:0:0) -> l6(x105:0:0, x106:0:0, -1 + x107:0:0) :|: x109:0:0 < 1 && x109:0:0 > -1 && x107:0:0 > 0 l6(x6:0, x7:0, x8:0) -> l6(-1 + x6:0, 1 + x7:0, -1 + x8:0) :|: x8:0 > 0 && x11:0 < 0