6. The method of claim 1 wherein the property checking schema for the said LTL operator F(p) for a given time frame bound comprises: a) starting search from a given start state at time frame i, with a given constraint database, wherein i=0 corresponds to an initial state of the circuit; b) checking for satisfiability of p in the i th state of a path, c) if satisfiable, terminating the search with success; d) if unsatisfiable, learning that p is always false in the i th state and adding this learnt knowledge to a constraint database; e) continuing the search by increasing i until the said time frame bound is reached, and repeating steps b-d; and f) terminating the search inconclusively if the said time frame bound is reached.
6. The method of claim 1 wherein the property checking schema for the said LTL operator F(p) for a given time frame bound comprises: a) starting search from a given start state at time frame i, with a given constraint database, wherein i=0 corresponds to an initial state of the circuit; b) checking for satisfiability of p in the i th state of a path, c) if satisfiable, terminating the search with success; d) if unsatisfiable, learning that p is always false in the i th state and adding this learnt knowledge to a constraint database; e) continuing the search by increasing i until the said time frame bound is reached, and repeating steps b-d; and f) terminating the search inconclusively if the said time frame bound is reached. 7. The method of claim 6 further comprising checking for completeness of the solution between steps d and e, to determine failure wherein, failure characterizes that the said success in step c is not achievable for any time frame i.