Give the digits, cycle by cycle, that open a lock within 6 cycles.
Reachability keeps each iteration's frontier, the states first reached at that iteration. The first frontier that holds a bad state is the earliest iteration at which one is reachable. Picking a bad state there, then a predecessor of it in the frontier before, and so on back to an initial state, gives a shortest trace: the states, and the inputs that move between them, cycle by cycle.
The 3-bit counter starts at 0 and adds 1 on each clock while en is 1. Its output at7 is 1 when it holds 7.
en
at7
It reaches one new state per iteration, so 7 is first reached at iteration 7, and at7 is reachable.
Walking back from 7 through the frontiers gives 6, 5 and so on down to 0, each step taken with en = 1: the trace is en = 1 on 7 cycles.
en = 1
No shorter trace exists, because 7 is in no earlier frontier.
The lock shown in the work area takes a 2-bit digit d on each clock cycle. Its output open becomes 1 when it has seen the right digits in a row.
d
open
Give the digits, cycle by cycle, that open it.
One row per clock cycle, from the initial state: the value of d in that cycle, a whole number from 0 to 3. Add a row with Add cycle. For example, a trace of a 1-bit input over three cycles might read 1, 0 and 1.
d from 0 to 3 in each cycle.
At most 6 cycles.
open is 1 at the end, or in an earlier cycle.
Watch the conditions: they check that each digit fits in 2 bits and that the trace has at most 6 cycles.
Press Simulate: it shows open after each cycle, so you can see whether and when the lock opens.
Write down progress after each of your digits by hand, and compare it with what Simulate shows.
progress
Kata 7.2 of Binary Decision Diagrams with CUDD on formal.org. The site checks the answer when you press Check answer; sign in to keep your progress.