else TagSet.positive ts
in
let _, _, m, f = Transition.node tr in
else TagSet.positive ts
in
let _, _, m, f = Transition.node tr in
- let (_, _, ls), (_, _, rs) = Formula.st f in
+ let ls, rs = Formula.st f in
if Ptset.Int.is_empty pos then acc_tr
else
(TagSet.inj_positive pos, (ls, rs, m))::acc_tr
if Ptset.Int.is_empty pos then acc_tr
else
(TagSet.inj_positive pos, (ls, rs, m))::acc_tr