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, 81 ms]
(4) TRUE


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

(0)
Obligation:
Rules:
l0(AHAT0, NBuffersHAT0, NLocBufferHAT0, RHAT0, istempHAT0) -> l1(AHATpost, NBuffersHATpost, NLocBufferHATpost, RHATpost, istempHATpost) :|: NBuffersHATpost = NBuffersHATpost && NLocBufferHATpost = NLocBufferHATpost && istempHATpost = istempHATpost && AHATpost = RHATpost && RHATpost = 0
l2(x, x1, x2, x3, x4) -> l0(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x1 = x6 && x = x5
Start term: l2(AHAT0, NBuffersHAT0, NLocBufferHAT0, RHAT0, istempHAT0)

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

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

(2)
Obligation:
Rules:
l0(AHAT0, NBuffersHAT0, NLocBufferHAT0, RHAT0, istempHAT0) -> l1(AHATpost, NBuffersHATpost, NLocBufferHATpost, RHATpost, istempHATpost) :|: NBuffersHATpost = NBuffersHATpost && NLocBufferHATpost = NLocBufferHATpost && istempHATpost = istempHATpost && AHATpost = RHATpost && RHATpost = 0
l2(x, x1, x2, x3, x4) -> l0(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x1 = x6 && x = x5
Start term: l2(AHAT0, NBuffersHAT0, NLocBufferHAT0, RHAT0, istempHAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(AHAT0, NBuffersHAT0, NLocBufferHAT0, RHAT0, istempHAT0) -> l1(AHATpost, NBuffersHATpost, NLocBufferHATpost, RHATpost, istempHATpost) :|: NBuffersHATpost = NBuffersHATpost && NLocBufferHATpost = NLocBufferHATpost && istempHATpost = istempHATpost && AHATpost = RHATpost && RHATpost = 0
(2) l2(x, x1, x2, x3, x4) -> l0(x5, x6, x7, x8, x9) :|: x4 = x9 && x3 = x8 && x2 = x7 && x1 = x6 && x = x5

Arcs:
(2) -> (1)

This digraph is fully evaluated!
----------------------------------------

(4)
TRUE