1. A computer-implemented method performed by a computerized device, comprising: obtaining a proof of a property with respect to a bounded model having a bounded number of cycles, wherein the bounded model comprising an initial axiom and a transition relation axiom, wherein the proof of the property is a Directed Acyclic Graph (DAG), wherein each non-leaf node of the DAG is deducible from its child nodes, wherein a root of the DAG is the property, and wherein leaves of the DAG are associated with an axiom of the bounded model; selecting a set of candidate invariants comprising at least one intermediate node of the DAG; determining, without using the proof and using a Boolean satisfiability problem solver, a subset of the set of candidates, wherein the subset comprises invariants which are held in an unbounded model during each cycle after the bound, wherein the unbounded model is an unbounded version of the bounded model; and utilizing the subset for model checking of the unbounded model.
6. The computer-implemented method of claim 1 , wherein said utilizing the subset comprises: using the invariants to prove the property is held inductively, wherein the property is held inductively if based on a cycle that holds the property, a successive cycle holds the property.