{"ast_node_type":"other","tokens":[{"end":57,"kind":"keyword","start":0,"text":"//"}]}
    // edge `R2 -> R1`. Therefore, if we find all regions
    // a reverse graph, so for each constraint `R1: R2` we have an
    // reachable from each free region, we will have all the