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


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

(0)
Obligation:
Rules:
l0(Result_4HAT0, cnt_58HAT0, devExt_7HAT0, i_12HAT0, irp_11HAT0, loop_count_14HAT0, loop_max_13HAT0, lt_46HAT0, nPacketsOld_9HAT0, nPackets_10HAT0, request_8HAT0) -> l1(Result_4HATpost, cnt_58HATpost, devExt_7HATpost, i_12HATpost, irp_11HATpost, loop_count_14HATpost, loop_max_13HATpost, lt_46HATpost, nPacketsOld_9HATpost, nPackets_10HATpost, request_8HATpost) :|: cnt_58HAT0 = cnt_58HATpost && Result_4HATpost = Result_4HATpost && lt_46HATpost = cnt_58HAT0 && devExt_7HATpost = devExt_7HATpost && request_8HATpost = request_8HATpost && nPacketsOld_9HATpost = nPacketsOld_9HATpost && nPackets_10HATpost = nPackets_10HATpost && irp_11HATpost = irp_11HATpost && i_12HATpost = i_12HATpost && loop_max_13HATpost = loop_max_13HATpost && loop_count_14HATpost = loop_count_14HATpost
l2(x, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> l0(x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) :|: x10 = x21 && x9 = x20 && x8 = x19 && x7 = x18 && x6 = x17 && x5 = x16 && x4 = x15 && x3 = x14 && x2 = x13 && x1 = x12 && x = x11
Start term: l2(Result_4HAT0, cnt_58HAT0, devExt_7HAT0, i_12HAT0, irp_11HAT0, loop_count_14HAT0, loop_max_13HAT0, lt_46HAT0, nPacketsOld_9HAT0, nPackets_10HAT0, request_8HAT0)

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

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

(2)
Obligation:
Rules:
l0(Result_4HAT0, cnt_58HAT0, devExt_7HAT0, i_12HAT0, irp_11HAT0, loop_count_14HAT0, loop_max_13HAT0, lt_46HAT0, nPacketsOld_9HAT0, nPackets_10HAT0, request_8HAT0) -> l1(Result_4HATpost, cnt_58HATpost, devExt_7HATpost, i_12HATpost, irp_11HATpost, loop_count_14HATpost, loop_max_13HATpost, lt_46HATpost, nPacketsOld_9HATpost, nPackets_10HATpost, request_8HATpost) :|: cnt_58HAT0 = cnt_58HATpost && Result_4HATpost = Result_4HATpost && lt_46HATpost = cnt_58HAT0 && devExt_7HATpost = devExt_7HATpost && request_8HATpost = request_8HATpost && nPacketsOld_9HATpost = nPacketsOld_9HATpost && nPackets_10HATpost = nPackets_10HATpost && irp_11HATpost = irp_11HATpost && i_12HATpost = i_12HATpost && loop_max_13HATpost = loop_max_13HATpost && loop_count_14HATpost = loop_count_14HATpost
l2(x, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> l0(x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) :|: x10 = x21 && x9 = x20 && x8 = x19 && x7 = x18 && x6 = x17 && x5 = x16 && x4 = x15 && x3 = x14 && x2 = x13 && x1 = x12 && x = x11
Start term: l2(Result_4HAT0, cnt_58HAT0, devExt_7HAT0, i_12HAT0, irp_11HAT0, loop_count_14HAT0, loop_max_13HAT0, lt_46HAT0, nPacketsOld_9HAT0, nPackets_10HAT0, request_8HAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(Result_4HAT0, cnt_58HAT0, devExt_7HAT0, i_12HAT0, irp_11HAT0, loop_count_14HAT0, loop_max_13HAT0, lt_46HAT0, nPacketsOld_9HAT0, nPackets_10HAT0, request_8HAT0) -> l1(Result_4HATpost, cnt_58HATpost, devExt_7HATpost, i_12HATpost, irp_11HATpost, loop_count_14HATpost, loop_max_13HATpost, lt_46HATpost, nPacketsOld_9HATpost, nPackets_10HATpost, request_8HATpost) :|: cnt_58HAT0 = cnt_58HATpost && Result_4HATpost = Result_4HATpost && lt_46HATpost = cnt_58HAT0 && devExt_7HATpost = devExt_7HATpost && request_8HATpost = request_8HATpost && nPacketsOld_9HATpost = nPacketsOld_9HATpost && nPackets_10HATpost = nPackets_10HATpost && irp_11HATpost = irp_11HATpost && i_12HATpost = i_12HATpost && loop_max_13HATpost = loop_max_13HATpost && loop_count_14HATpost = loop_count_14HATpost
(2) l2(x, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) -> l0(x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) :|: x10 = x21 && x9 = x20 && x8 = x19 && x7 = x18 && x6 = x17 && x5 = x16 && x4 = x15 && x3 = x14 && x2 = x13 && x1 = x12 && x = x11

Arcs:
(2) -> (1)

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

(4)
TRUE