“…Let us now consider that our program is also constituted of a moded version of the concat/3 predicate introduced in Section 1: The predicate calls in the example above being recursive calls, we introduce the following example to illustrate the case where a predicate makes calls to other predicates. The analysis finds the following final interaction set for dapp: (5),ψ ⊥ (4),ψ a (11),⇒ cons (8),⇐ cons (10),ψ ⊥ (9),ψ a (12)} L4, L2 {:=(2),ψ ⊥ (4),⇐ cons (5),ψ a (11),⇒ cons (8),⇐ cons (10),ψ ⊥ (9),ψ a (12)} L4, L3 {:=(7),ψ ⊥ (9),⇐ cons (10),ψ a (12)…”