let name = Some (name, true) in
let f aw ww =
let f at tt =
- let l = if !G.cc then match y, at.E.n_degr with
- | true, _ -> N.one
- | _ , 0 -> N.one
- | _ , 1 -> N.unknown st
- | _ , 2 -> N.two
- | _ -> assert false
+ let l =
+ if !G.cc then match y, at.E.n_degr with
+ | true, _ -> N.one
+ | _ , 0 -> N.one
+ | _ , 1 -> N.unknown st
+ | _ , 2 -> N.two
+ | _ -> assert false
else N.infinite
in
let b = D.Abst (l, ww) in
in
complete_qid f lst (name, true, [])
in
- get_cnt_relaxed (D.sta f) lst
+ get_cnt_relaxed (D.replace f N.one) lst
| A.Def (name, w, trans, v) ->
let f lenv =
let f qid =
}
let refresh_status lst = {lst with
- mk_uri = G.get_mk_uri ()
+ mk_uri = G.get_mk_uri (); line = 1;
}
let crg_of_aut = xlate_entity