An open repetition followed by more: give each attempt's verdict and the edge where it is decided.
Hardware context: A worker that stays busy as long as the job takes, then signals done. Read the verdicts of an open repetition followed by more.
After a request, busy holds for at least two edges, as long as the work takes. done comes on the edge after the last busy one.
The trace gives the sampled values at sixteen rising edges. Six attempts are asked. For each, choose its verdict and the edge where it is decided.
The Assertion and the Trace
Read the sampled values as text
req: edge 1 = 1, edge 2 = 0, edge 3 = 0, edge 4 = 0, edge 5 = 0, edge 6 = 0, edge 7 = 0, edge 8 = 1, edge 9 = 0, edge 10 = 0, edge 11 = 0, edge 12 = 1, edge 13 = 0, edge 14 = 0, edge 15 = 1, edge 16 = 0busy: edge 1 = 1, edge 2 = 1, edge 3 = 1, edge 4 = 1, edge 5 = 1, edge 6 = 1, edge 7 = 0, edge 8 = 1, edge 9 = 1, edge 10 = 1, edge 11 = 0, edge 12 = 1, edge 13 = 1, edge 14 = 0, edge 15 = 1, edge 16 = 1done: edge 1 = 0, edge 2 = 0, edge 3 = 0, edge 4 = 0, edge 5 = 0, edge 6 = 0, edge 7 = 1, edge 8 = 0, edge 9 = 0, edge 10 = 0, edge 11 = 0, edge 12 = 0, edge 13 = 1, edge 14 = 0, edge 15 = 0, edge 16 = 0
Standard behaviour: no free simulator runs this construct correctly. The key was derived by hand from IEEE 1800-2017 and checked independently.
Simulator note: Verilator 5.052 reports no failure on this trace (lesson A2.2). The key is the standard behaviour, derived by hand and checked by the trace oracle.
How to Answer
For each attempt, choose its verdict and the edge where that verdict is decided. A vacuous attempt is graded on its verdict only. A pending one is still running at the end of the run.
- Answer every attempt: its verdict, and the edge where that verdict is decided.
- Read the values the assertion samples at each edge (the dots), not the values after the edge.
- Run grades the first attempt and says whether it is right. Submit grades every attempt and says only whether all are right.
Full specification
a1: assert property (@(posedge clk) req |-> busy[*2:$] ##1 done);
The clock rises at 5, 15, 25, ... 155. The run ends at 160.
Hints
Hint 1
Each length of the repetition is its own thread, and $ means there is no longest one.
Hint 2
When one thread dies, is the attempt over?
Hint 3
A done must come after at least two busy edges. And a wait that is still open at the end: weak or strong?
What is checked: The verdict and decision edge of six attempts, against the standard key derived in docs/sva-standard-traces/A2.md (sva-044-b).
More problems on this topic