YES
proof of prog.inttrs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given IRSwT could be proven:

(0) IRSwT
(1) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(2) IRSwT
(3) IRSwTTerminationDigraphProof [EQUIVALENT, 281 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IRSwT
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 2 ms]
(8) IRSwT
(9) TempFilterProof [SOUND, 14 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(12) YES


----------------------------------------

(0)
Obligation:
Rules:
l0(Result_4HAT0, ___cil_tmp4_8HAT0, ___retres3_7HAT0, i_5HAT0, x_6HAT0) -> l1(Result_4HATpost, ___cil_tmp4_8HATpost, ___retres3_7HATpost, i_5HATpost, x_6HATpost) :|: x_6HAT0 = x_6HATpost && i_5HAT0 = i_5HATpost && Result_4HATpost = ___cil_tmp4_8HATpost && ___cil_tmp4_8HATpost = ___retres3_7HATpost && ___retres3_7HATpost = 0 && 101 - i_5HAT0 <= 0
l0(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x2 = x7 && x1 = x6 && x = x5 && x8 = 1 + x3 && 0 <= -1 + x4 && 0 <= 100 - x3
l2(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15
l3(x20, x21, x22, x23, x24) -> l4(x25, x26, x27, x28, x29) :|: x24 = x29 && x22 = x27 && x21 = x26 && x20 = x25 && x28 = 0
l4(x30, x31, x32, x33, x34) -> l1(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x35 = x36 && x36 = x37 && x37 = 0 && x34 <= 0 && 0 <= 100 - x33
l4(x40, x41, x42, x43, x44) -> l0(x45, x46, x47, x48, x49) :|: x44 = x49 && x42 = x47 && x41 = x46 && x40 = x45 && x48 = 1 + x43 && 0 <= -1 + x44 && 0 <= 100 - x43
l5(x50, x51, x52, x53, x54) -> l3(x55, x56, x57, x58, x59) :|: x54 = x59 && x53 = x58 && x52 = x57 && x51 = x56 && x50 = x55
Start term: l5(Result_4HAT0, ___cil_tmp4_8HAT0, ___retres3_7HAT0, i_5HAT0, x_6HAT0)

----------------------------------------

(1) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(2)
Obligation:
Rules:
l0(Result_4HAT0, ___cil_tmp4_8HAT0, ___retres3_7HAT0, i_5HAT0, x_6HAT0) -> l1(Result_4HATpost, ___cil_tmp4_8HATpost, ___retres3_7HATpost, i_5HATpost, x_6HATpost) :|: x_6HAT0 = x_6HATpost && i_5HAT0 = i_5HATpost && Result_4HATpost = ___cil_tmp4_8HATpost && ___cil_tmp4_8HATpost = ___retres3_7HATpost && ___retres3_7HATpost = 0 && 101 - i_5HAT0 <= 0
l0(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x2 = x7 && x1 = x6 && x = x5 && x8 = 1 + x3 && 0 <= -1 + x4 && 0 <= 100 - x3
l2(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15
l3(x20, x21, x22, x23, x24) -> l4(x25, x26, x27, x28, x29) :|: x24 = x29 && x22 = x27 && x21 = x26 && x20 = x25 && x28 = 0
l4(x30, x31, x32, x33, x34) -> l1(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x35 = x36 && x36 = x37 && x37 = 0 && x34 <= 0 && 0 <= 100 - x33
l4(x40, x41, x42, x43, x44) -> l0(x45, x46, x47, x48, x49) :|: x44 = x49 && x42 = x47 && x41 = x46 && x40 = x45 && x48 = 1 + x43 && 0 <= -1 + x44 && 0 <= 100 - x43
l5(x50, x51, x52, x53, x54) -> l3(x55, x56, x57, x58, x59) :|: x54 = x59 && x53 = x58 && x52 = x57 && x51 = x56 && x50 = x55
Start term: l5(Result_4HAT0, ___cil_tmp4_8HAT0, ___retres3_7HAT0, i_5HAT0, x_6HAT0)

----------------------------------------

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(Result_4HAT0, ___cil_tmp4_8HAT0, ___retres3_7HAT0, i_5HAT0, x_6HAT0) -> l1(Result_4HATpost, ___cil_tmp4_8HATpost, ___retres3_7HATpost, i_5HATpost, x_6HATpost) :|: x_6HAT0 = x_6HATpost && i_5HAT0 = i_5HATpost && Result_4HATpost = ___cil_tmp4_8HATpost && ___cil_tmp4_8HATpost = ___retres3_7HATpost && ___retres3_7HATpost = 0 && 101 - i_5HAT0 <= 0
(2) l0(x, x1, x2, x3, x4) -> l2(x5, x6, x7, x8, x9) :|: x4 = x9 && x2 = x7 && x1 = x6 && x = x5 && x8 = 1 + x3 && 0 <= -1 + x4 && 0 <= 100 - x3
(3) l2(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15
(4) l3(x20, x21, x22, x23, x24) -> l4(x25, x26, x27, x28, x29) :|: x24 = x29 && x22 = x27 && x21 = x26 && x20 = x25 && x28 = 0
(5) l4(x30, x31, x32, x33, x34) -> l1(x35, x36, x37, x38, x39) :|: x34 = x39 && x33 = x38 && x35 = x36 && x36 = x37 && x37 = 0 && x34 <= 0 && 0 <= 100 - x33
(6) l4(x40, x41, x42, x43, x44) -> l0(x45, x46, x47, x48, x49) :|: x44 = x49 && x42 = x47 && x41 = x46 && x40 = x45 && x48 = 1 + x43 && 0 <= -1 + x44 && 0 <= 100 - x43
(7) l5(x50, x51, x52, x53, x54) -> l3(x55, x56, x57, x58, x59) :|: x54 = x59 && x53 = x58 && x52 = x57 && x51 = x56 && x50 = x55

Arcs:
(2) -> (3)
(3) -> (1), (2)
(4) -> (5), (6)
(6) -> (1), (2)
(7) -> (4)

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 && x2 = x7 && x1 = x6 && x = x5 && x8 = 1 + x3 && 0 <= -1 + x4 && 0 <= 100 - x3
(2) l2(x10, x11, x12, x13, x14) -> l0(x15, x16, x17, x18, x19) :|: x14 = x19 && x13 = x18 && x12 = x17 && x11 = x16 && x10 = x15

Arcs:
(1) -> (2)
(2) -> (1)

This digraph is fully evaluated!

----------------------------------------

(5) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(6)
Obligation:
Rules:
l0(x15:0, x16:0, x17:0, x3:0, x19:0) -> l0(x15:0, x16:0, x17:0, 1 + x3:0, x19:0) :|: x3:0 < 101 && x19:0 > 0

----------------------------------------

(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   l0(x1, x2, x3, x4, x5) -> l0(x4, x5)

----------------------------------------

(8)
Obligation:
Rules:
l0(x3:0, x19:0) -> l0(1 + x3:0, x19:0) :|: x3:0 < 101 && x19:0 > 0

----------------------------------------

(9) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
l0(INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(10)
Obligation:
Rules:
l0(x3:0, x19:0) -> l0(c, x19:0) :|: c = 1 + x3:0 && (x3:0 < 101 && x19:0 > 0)

----------------------------------------

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[l0(x, x1)] = 100 - x

The following rules are decreasing:
l0(x3:0, x19:0) -> l0(c, x19:0) :|: c = 1 + x3:0 && (x3:0 < 101 && x19:0 > 0)
The following rules are bounded:
l0(x3:0, x19:0) -> l0(c, x19:0) :|: c = 1 + x3:0 && (x3:0 < 101 && x19:0 > 0)

----------------------------------------

(12)
YES