LLM‑guided, counterexample‑grounded verifiable reasoning: a local LLM proposes solutions; an SMT solver (Z3) verifies and returns unsat‑core hints; the LLM uses those hints to iteratively revise ...