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


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

(0)
Obligation:
Rules:
l0(aHAT0, ret_returnOne2HAT0) -> l1(aHATpost, ret_returnOne2HATpost) :|: aHAT1 = -1 && ret_returnOne2HATpost = 1 && aHATpost = ret_returnOne2HATpost
l2(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2
Start term: l2(aHAT0, ret_returnOne2HAT0)

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

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

(2)
Obligation:
Rules:
l0(aHAT0, ret_returnOne2HAT0) -> l1(aHATpost, ret_returnOne2HATpost) :|: aHAT1 = -1 && ret_returnOne2HATpost = 1 && aHATpost = ret_returnOne2HATpost
l2(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2
Start term: l2(aHAT0, ret_returnOne2HAT0)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) l0(aHAT0, ret_returnOne2HAT0) -> l1(aHATpost, ret_returnOne2HATpost) :|: aHAT1 = -1 && ret_returnOne2HATpost = 1 && aHATpost = ret_returnOne2HATpost
(2) l2(x, x1) -> l0(x2, x3) :|: x1 = x3 && x = x2

Arcs:
(2) -> (1)

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

(4)
TRUE