FAILURE MAP
← Case archive

FA-92164 / PLC ladder logic scan cycles / Member archive

FIFO load overwrites the newest entry when full · case 04

A part queued while the FIFO is full replaces the last queued part instead of being rejected.

Member previewVariant 4 · 3 implementations · 8 checks per implementation

Case contract

FIFO load (FFL) and unload (FFU) pair on one file of the given length. ops is a list of [op, value], one triggered instruction per scan. Load stores value at the position and increments it; when full (position == length) the load is ignored. Unload moves element 0 to dest, shifts the file toward 0 and zeroes the vacated last element; unloading an empty FIFO leaves dest unchanged. DN is position >= length and EM is position == 0. Return [position, dest, DN, EM, file] per scan.

Why this case matters

Ladder programs are executed as repeated scans; each defect here changes what a rung, timer, counter or data-table instruction reports on a particular scan, which is how commissioning and field faults are actually observed.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixtureActualExpectedOutcome
regression: scenario 6[[1, 0, true, false, [92]], [1, 0, true, false, [63]], [0, 63, false, true, [0]], [0, 63, false, true, [0]], [0, 63, false, true, [0]], [1, 63, true, false, [33]], [1, 63, true, false, [31]], [1, 63, true, false, [44]], [0, 44, false, true, [0]]][[1, 0, true, false, [92]], [1, 0, true, false, [92]], [0, 92, false, true, [0]], [0, 92, false, true, [0]], [0, 92, false, true, [0]], [1, 92, true, false, [33]], [1, 92, true, false, [33]], [1, 92, true, false, [33]], [0, 33, false, true, [0]]]Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.

Sign in to the archive ↗