A temporal implies whose two sides start at the same edge. Give each attempt's verdict and decision edge.
Hardware context: A request that may be followed by a data strobe and then a completion. Count both sides of an implies from the same edge and tell a vacuous success from a pass.
After a request, if x comes one edge later, y must come two edges after the request. Both sides of the implies start at the request edge.
The trace gives the sampled values at ten rising edges. Eight 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 = 0, edge 2 = 1, edge 3 = 0, edge 4 = 1, edge 5 = 0, edge 6 = 0, edge 7 = 1, edge 8 = 1, edge 9 = 0, edge 10 = 0x: edge 1 = 0, edge 2 = 0, edge 3 = 1, edge 4 = 0, edge 5 = 0, edge 6 = 0, edge 7 = 0, edge 8 = 1, edge 9 = 1, edge 10 = 0y: edge 1 = 0, edge 2 = 0, edge 3 = 0, edge 4 = 1, edge 5 = 1, edge 6 = 0, edge 7 = 0, edge 8 = 0, edge 9 = 0, edge 10 = 1
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 does not report temporal implies failures (measured). The key is the standard behaviour, checked against an independent evaluator.
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 |-> ((##1 x) implies (##2 y)));
| Left side ##1 x | Right side ##2 y | implies |
|---|---|---|
| true | true | true |
| true | false | false |
| false | either | true (vacuous) |
The clock rises at 5, 15, 25, ... 95. The run ends at 100.
Hints
Hint 1
Count both delays from the request edge, not from the edge of x.
Hint 2
A false left side makes the implies true. Is that a real pass or a vacuous one?
Hint 3
The attempt is decided as soon as the answer cannot change.
What is checked: The verdict and decision edge of eight attempts, against the standard key derived in docs/sva-standard-traces/A3.md (sva-081-b).
More problems on this topic