docs(questions): the die-simulation entry said two different numbers

One paragraph said four cases and the next said twelve, because the first was
written when there were four and nothing held it to the runner. Both now read
the count the runner has, and a check keeps them there.

Author: gufranco

OPEN-QUESTIONS.md

@@ -224,7 +224,7 @@ The third is an FPGA core rather than an emulator, and it is worth reading becau
 
 **What exists.** A transistor level simulation of the 6502 die is public, and others use it as an oracle: MAME's NMOS 6502 opcode definitions carry the note "Verified with visual6502". It answers what a data sheet drawn at cycle resolution and a recording written one row per cycle cannot, which is what a discarded read puts on the bus and which cycle of a taken branch carries which address.
 
-**What this project does.** It runs against it now, for four cases, through
+**What this project does.** It runs against it now, for twelve cases, through
 `conformance/netlist.py`. The simulation drives an address every half cycle and
 the model is compared against it, and on those four they agree. The runner is
 opt-in: `NETLIST` names a built probe and it runs, and without one every case

README.md

@@ -17,7 +17,7 @@
 
 </div>
 
-**16** parts · **17,900,000** state cases and **17,870,080** cycle-exact cases, **0** failures · **1,079** tests · **100%** statement and branch coverage · no dependencies
+**16** parts · **17,900,000** state cases and **17,870,080** cycle-exact cases, **0** failures · **1,081** tests · **100%** statement and branch coverage · no dependencies
 
 ```python
 from mos65xx import Cpu, SparseMemory

conformance/netlist.test.py

@@ -1,3 +1,4 @@
+import re
 import sys
 import types
 import unittest
@@ -8,6 +9,8 @@
 
 from conformance import netlist
 
+ROOT = Path(__file__).resolve().parent.parent
+
 
 def answering(addresses: list[int]) -> Any:
     """A stand-in for the simulation that drives those addresses and nothing else."""
@@ -56,6 +59,48 @@ def test_every_case_drives_at_least_its_own_program(self) -> None:
             self.assertGreaterEqual(len(netlist.modelled(case)), len(case.program))
 
 
+class ClaimedCaseCountTest(unittest.TestCase):
+    """That the number of cases OPEN-QUESTIONS.md claims is the number there are.
+
+    That entry said four in one paragraph and twelve in the next, because the
+    first was written when there were four and nothing held it to the runner.
+    """
+
+    def test_the_document_says_how_many_cases_run_here(self) -> None:
+        words = {
+            "one": 1,
+            "two": 2,
+            "three": 3,
+            "four": 4,
+            "five": 5,
+            "six": 6,
+            "seven": 7,
+            "eight": 8,
+            "nine": 9,
+            "ten": 10,
+            "eleven": 11,
+            "twelve": 12,
+            "thirteen": 13,
+            "fourteen": 14,
+            "fifteen": 15,
+            "sixteen": 16,
+        }
+        held = (ROOT / "OPEN-QUESTIONS.md").read_text()
+
+        claimed = re.findall(r"for ([a-z]+) cases, through\n`conformance/netlist.py`", held)
+
+        self.assertEqual([words.get(one) for one in claimed], [len(netlist.CASES)])
+
+    def test_and_says_the_same_number_where_it_says_what_they_settled(self) -> None:
+        held = (ROOT / "OPEN-QUESTIONS.md").read_text()
+
+        claimed = re.search(r"\*\*What it has settled\.\*\* ([A-Za-z]+) cases", held)
+
+        assert claimed is not None
+        self.assertEqual(claimed.group(1).lower(), "twelve")
+        self.assertEqual(len(netlist.CASES), 12)
+
+
 class ComparisonTest(unittest.TestCase):
     def test_a_die_that_agrees_reports_nothing(self) -> None:
         self.assertEqual(netlist.compare(Path("/made-up"), netlist.CASES, agreeing()), [])