let tree = run.tree in
let auto = run.auto in
let states_by_rank = Ata.get_states_by_rank auto in
- let td_todo = states_by_rank.(i) in
+ let td_todo = snd states_by_rank.(i) in
let bu_todo =
if i == Array.length states_by_rank - 1 then StateSet.empty
else
- states_by_rank.(i+1)
+ snd (states_by_rank.(i+1))
in
let last_run = i >= Array.length states_by_rank - 2 in
let rec loop_td_and_bu node parent parent_sat =