ApronDomain.SLatticeinclude SPrintableinclude Printable.Sval top_env : GobApron.Environment.t -> tval bot_env : GobApron.Environment.t -> tval is_top_env : t -> boolval is_bot_env : t -> boolinclude Lattice.S with type t := tinclude Lattice.PO with type t := twiden x y assumes leq x y. Solvers guarantee this by calling widen old (join old new).
val invariant : t -> GobApron.Lincons1.t list