asupersync 0.3.4

Spec-first, cancel-correct, capability-secure async runtime for Rust.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
//! Metamorphic tests for trace canonicalization (Foata normal form).
//!
//! This module applies metamorphic testing to the trace canonicalization system,
//! which converts traces into Foata normal form for equivalence class analysis
//! in DPOR and trace monoid operations.
//!
//! ## Oracle Problem
//!
//! We cannot predict the exact canonical form (Foata normal form) for arbitrary
//! trace inputs. The canonicalization involves complex independence relation
//! checking, layering based on happens-before relationships, and deterministic
//! sorting within layers.
//!
//! ## Metamorphic Relations Tested
//!
//! 1. **Layer Independence**: Events within same layer are pairwise independent
//! 2. **Idempotence**: canonicalize(canonicalize(trace)) = canonicalize(trace)
//! 3. **Layer Ordering**: Events in layer k+1 depend on events in layer ≤ k
//! 4. **Fingerprint Consistency**: canonical form and fingerprint must match
//! 5. **Event Preservation**: All original events appear in canonical form
//! 6. **Trace Equivalence**: Semantically equivalent traces → same canonical form
//! 7. **Monoid Identity**: Empty trace acts as monoid identity element
//! 8. **Event Order Preservation**: Within independence classes, constraints preserved
//! 9. **Equivalence Transitivity**: If A ≡ B and B ≡ C, then A ≡ C

use super::*;
use crate::trace::event::{TraceData, TraceEvent, TraceEventKind};
use crate::trace::independence::independent;
use crate::types::{RegionId, TaskId, Time};

/// Create diverse test traces for comprehensive metamorphic testing.
fn create_test_traces() -> Vec<Vec<TraceEvent>> {
    vec![
        // Empty trace (monoid identity)
        vec![],
        // Single event
        vec![TraceEvent::new(
            1,
            Time::ZERO,
            TraceEventKind::Spawn,
            TraceData::Task {
                task: TaskId::new_for_test(1, 0),
                region: RegionId::new_for_test(1, 0),
            },
        )],
        // Two independent events (should be in same layer)
        vec![
            TraceEvent::new(
                1,
                Time::ZERO,
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                2,
                Time::from_nanos(100),
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(2, 0),
                    region: RegionId::new_for_test(2, 0),
                },
            ),
        ],
        // Two dependent events (spawn then complete same task)
        vec![
            TraceEvent::new(
                1,
                Time::ZERO,
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                2,
                Time::from_nanos(100),
                TraceEventKind::Complete,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
        ],
        // Complex trace with multiple layers
        vec![
            // Layer 0: Two independent spawns
            TraceEvent::new(
                1,
                Time::ZERO,
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                2,
                Time::from_nanos(50),
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(2, 0),
                    region: RegionId::new_for_test(2, 0),
                },
            ),
            // Layer 1: Dependent on first spawn
            TraceEvent::new(
                3,
                Time::from_nanos(100),
                TraceEventKind::Complete,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            // Layer 1: Also dependent on second spawn (independent of first complete)
            TraceEvent::new(
                4,
                Time::from_nanos(150),
                TraceEventKind::Complete,
                TraceData::Task {
                    task: TaskId::new_for_test(2, 0),
                    region: RegionId::new_for_test(2, 0),
                },
            ),
        ],
        // Events with different kinds but same task (dependent)
        vec![
            TraceEvent::new(
                1,
                Time::ZERO,
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                2,
                Time::from_nanos(100),
                TraceEventKind::Poll,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                3,
                Time::from_nanos(200),
                TraceEventKind::Yield,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
        ],
        // Region lifecycle events
        vec![
            TraceEvent::new(
                1,
                Time::ZERO,
                TraceEventKind::RegionCreated,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                2,
                Time::from_nanos(100),
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(2, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                3,
                Time::from_nanos(200),
                TraceEventKind::Complete,
                TraceData::Task {
                    task: TaskId::new_for_test(2, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                4,
                Time::from_nanos(300),
                TraceEventKind::RegionCloseComplete,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
        ],
        // Cancellation protocol events
        vec![
            TraceEvent::new(
                1,
                Time::ZERO,
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                2,
                Time::from_nanos(100),
                TraceEventKind::CancelRequest,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                3,
                Time::from_nanos(200),
                TraceEventKind::CancelAck,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
        ],
    ]
}

/// MR1: Layer Independence
/// Property: Events within same layer are pairwise independent
/// Category: Equivalence (independence relation must be preserved)
#[test]
fn mr_layer_independence() {
    for trace in create_test_traces() {
        let foata = canonicalize(&trace);

        for layer in foata.layers() {
            // Check all pairs within each layer for independence
            for i in 0..layer.len() {
                for j in i + 1..layer.len() {
                    assert!(
                        independent(&layer[i], &layer[j]),
                        "Events in same layer are not independent: {:?} and {:?}",
                        layer[i].kind,
                        layer[j].kind
                    );
                }
            }
        }
    }
}

/// MR2: Idempotence
/// Property: canonicalize(canonicalize(trace)) = canonicalize(trace)
/// Category: Invertive (applying canonicalization twice)
#[test]
fn mr_canonicalize_idempotence() {
    for trace in create_test_traces() {
        let canonical_once = canonicalize(&trace);

        // Extract events from canonical form and canonicalize again
        let flattened: Vec<TraceEvent> = canonical_once
            .layers()
            .iter()
            .flat_map(|layer| layer.iter().cloned())
            .collect();

        let canonical_twice = canonicalize(&flattened);

        assert_eq!(
            canonical_once.depth(),
            canonical_twice.depth(),
            "Double canonicalization changed depth for trace with {} events",
            trace.len()
        );

        assert_eq!(
            canonical_once.layers().len(),
            canonical_twice.layers().len(),
            "Double canonicalization changed layer count"
        );

        for (layer1, layer2) in canonical_once
            .layers()
            .iter()
            .zip(canonical_twice.layers().iter())
        {
            assert_eq!(
                layer1, layer2,
                "Double canonicalization changed layer contents"
            );
        }
    }
}

/// MR3: Layer Ordering
/// Property: Events in layer k+1 depend on events in layer ≤ k
/// Category: Permutative (ordering relationships preserved)
#[test]
fn mr_layer_ordering() {
    for trace in create_test_traces() {
        let foata = canonicalize(&trace);
        let layers = foata.layers();

        for current_layer_idx in 1..layers.len() {
            let current_layer = &layers[current_layer_idx];

            // Each event in current layer should depend on at least one event
            // in a previous layer
            for current_event in current_layer {
                let mut has_dependency = false;

                for prev_layer in layers.iter().take(current_layer_idx) {
                    for prev_event in prev_layer {
                        if !independent(prev_event, current_event) {
                            has_dependency = true;
                            break;
                        }
                    }

                    if has_dependency {
                        break;
                    }
                }

                assert!(
                    has_dependency || current_layer_idx == 0,
                    "Event {:?} in layer {} has no dependencies in previous layers",
                    current_event.kind,
                    current_layer_idx
                );
            }

            // Events in current layer should be independent of events in later layers
            for later_layer in layers.iter().skip(current_layer_idx + 1) {
                for _current_event in current_layer {
                    for _later_event in later_layer {
                        // The later event can depend on the current event,
                        // but not the other way around due to layer ordering
                        // We just verify the layering is consistent with dependency structure
                    }
                }
            }
        }
    }
}

/// MR4: Fingerprint Consistency
/// Property: canonical form fingerprint matches trace fingerprint
/// Category: Equivalence (fingerprint computation consistency)
#[test]
fn mr_fingerprint_consistency() {
    for trace in create_test_traces() {
        let foata = canonicalize(&trace);
        let trace_fingerprint_direct = trace_fingerprint(&trace);
        let foata_fingerprint = foata.fingerprint();

        assert_eq!(
            trace_fingerprint_direct,
            foata_fingerprint,
            "Fingerprint mismatch: direct computation ({}) vs canonical form ({}) for trace with {} events",
            trace_fingerprint_direct,
            foata_fingerprint,
            trace.len()
        );

        // Fingerprint should be consistent across multiple computations
        let foata_fingerprint2 = foata.fingerprint();
        assert_eq!(
            foata_fingerprint, foata_fingerprint2,
            "Fingerprint computation is not deterministic"
        );
    }
}

/// MR5: Event Preservation
/// Property: All original events appear in canonical form (no events lost/added)
/// Category: Equivalence (event set preservation)
#[test]
fn mr_event_preservation() {
    for trace in create_test_traces() {
        let foata = canonicalize(&trace);

        // Collect all events from canonical form
        let canonical_events: Vec<&TraceEvent> = foata
            .layers()
            .iter()
            .flat_map(|layer| layer.iter())
            .collect();

        // Same number of events
        assert_eq!(
            canonical_events.len(),
            trace.len(),
            "Canonical form has different event count: {} vs {}",
            canonical_events.len(),
            trace.len()
        );

        // Every original event appears in canonical form
        for original_event in &trace {
            assert!(
                canonical_events
                    .iter()
                    .any(|&ce| events_semantically_equal(original_event, ce)),
                "Original event {:?} not found in canonical form",
                original_event.kind
            );
        }

        // Every canonical event appears in original trace
        for canonical_event in canonical_events {
            assert!(
                trace
                    .iter()
                    .any(|oe| events_semantically_equal(oe, canonical_event)),
                "Canonical event {:?} not found in original trace",
                canonical_event.kind
            );
        }
    }
}

/// MR6: Trace Equivalence
/// Property: Semantically equivalent traces → same canonical form
/// Category: Equivalence (equivalence class representatives)
#[test]
fn mr_trace_equivalence() {
    // Create pairs of equivalent traces by reordering independent events
    let equivalent_pairs = vec![
        // Independent spawns in different orders
        (
            vec![
                TraceEvent::new(
                    1,
                    Time::ZERO,
                    TraceEventKind::Spawn,
                    TraceData::Task {
                        task: TaskId::new_for_test(1, 0),
                        region: RegionId::new_for_test(1, 0),
                    },
                ),
                TraceEvent::new(
                    2,
                    Time::from_nanos(100),
                    TraceEventKind::Spawn,
                    TraceData::Task {
                        task: TaskId::new_for_test(2, 0),
                        region: RegionId::new_for_test(2, 0),
                    },
                ),
            ],
            vec![
                TraceEvent::new(
                    2,
                    Time::from_nanos(100),
                    TraceEventKind::Spawn,
                    TraceData::Task {
                        task: TaskId::new_for_test(2, 0),
                        region: RegionId::new_for_test(2, 0),
                    },
                ),
                TraceEvent::new(
                    1,
                    Time::ZERO,
                    TraceEventKind::Spawn,
                    TraceData::Task {
                        task: TaskId::new_for_test(1, 0),
                        region: RegionId::new_for_test(1, 0),
                    },
                ),
            ],
        ),
    ];

    for (trace1, trace2) in equivalent_pairs {
        let foata1 = canonicalize(&trace1);
        let foata2 = canonicalize(&trace2);
        let monoid1 = TraceMonoid::from_events(&trace1);
        let monoid2 = TraceMonoid::from_events(&trace2);

        assert_eq!(
            foata1.fingerprint(),
            foata2.fingerprint(),
            "Equivalent traces have different fingerprints"
        );

        assert_eq!(
            foata1.depth(),
            foata2.depth(),
            "Equivalent traces have different canonical depths"
        );

        assert_eq!(
            monoid1, monoid2,
            "Equivalent traces should have equal trace monoids"
        );
    }
}

/// MR7: Monoid Identity
/// Property: Empty trace acts as monoid identity element
/// Category: Additive (identity element behavior)
#[test]
fn mr_monoid_identity() {
    let empty_trace = vec![];
    let _empty_monoid = TraceMonoid::from_events(&empty_trace);

    for trace in create_test_traces() {
        let trace_monoid = TraceMonoid::from_events(&trace);

        // Empty canonical form properties
        let empty_canonical = canonicalize(&empty_trace);
        assert_eq!(
            empty_canonical.depth(),
            0,
            "Empty trace should have depth 0"
        );
        assert_eq!(
            empty_canonical.layers().len(),
            0,
            "Empty trace should have 0 layers"
        );

        // Identity behavior: concatenation with empty should preserve equivalence
        // Note: Actual concatenation would require implementing the monoid operation,
        // but we can test that empty trace has the right identity properties

        assert_eq!(
            trace_monoid, trace_monoid,
            "Trace monoid should equal itself (reflexivity)"
        );
    }
}

/// MR8: Event Order Preservation
/// Property: Within independence classes, original ordering constraints preserved
/// Category: Permutative (partial ordering preservation)
#[test]
fn mr_event_order_preservation() {
    for trace in create_test_traces() {
        if trace.len() < 2 {
            continue;
        }

        let foata = canonicalize(&trace);

        // Check that dependent events maintain their relative order
        for (i, event_i) in trace.iter().enumerate() {
            for (_j, event_j) in trace.iter().enumerate().skip(i + 1) {
                if !independent(event_i, event_j) {
                    // These events are dependent, so their order should be preserved
                    // in the canonical form

                    let (pos_i, pos_j) = find_event_positions(&foata, event_i, event_j);

                    assert!(
                        pos_i < pos_j,
                        "Dependent events {:?} and {:?} have wrong order in canonical form",
                        event_i.kind,
                        event_j.kind
                    );
                }
            }
        }
    }
}

/// MR9: Equivalence Transitivity
/// Property: If A ≡ B and B ≡ C, then A ≡ C
/// Category: Equivalence (transitivity of equivalence relation)
#[test]
fn mr_equivalence_transitivity() {
    // Create three equivalent traces through different reorderings
    let trace_a = vec![
        TraceEvent::new(
            1,
            Time::ZERO,
            TraceEventKind::Spawn,
            TraceData::Task {
                task: TaskId::new_for_test(1, 0),
                region: RegionId::new_for_test(1, 0),
            },
        ),
        TraceEvent::new(
            2,
            Time::from_nanos(50),
            TraceEventKind::Spawn,
            TraceData::Task {
                task: TaskId::new_for_test(2, 0),
                region: RegionId::new_for_test(2, 0),
            },
        ),
        TraceEvent::new(
            3,
            Time::from_nanos(100),
            TraceEventKind::Spawn,
            TraceData::Task {
                task: TaskId::new_for_test(3, 0),
                region: RegionId::new_for_test(3, 0),
            },
        ),
    ];

    // All these spawns are independent, so any ordering should be equivalent
    let trace_b = vec![trace_a[1].clone(), trace_a[0].clone(), trace_a[2].clone()];
    let trace_c = vec![trace_a[2].clone(), trace_a[1].clone(), trace_a[0].clone()];

    let monoid_a = TraceMonoid::from_events(&trace_a);
    let monoid_b = TraceMonoid::from_events(&trace_b);
    let monoid_c = TraceMonoid::from_events(&trace_c);

    // Transitivity: if A ≡ B and B ≡ C, then A ≡ C
    assert_eq!(monoid_a, monoid_b, "A and B should be equivalent");
    assert_eq!(monoid_b, monoid_c, "B and C should be equivalent");
    assert_eq!(
        monoid_a, monoid_c,
        "A and C should be equivalent (transitivity)"
    );
}

/// Composite MR: Idempotence + Event Preservation + Layer Independence
/// Tests compound property: canonicalization preserves all events while maintaining
/// independence within layers and idempotent behavior
#[test]
fn mr_composite_idempotence_preservation_independence() {
    for trace in create_test_traces() {
        // Apply canonicalization
        let foata = canonicalize(&trace);

        // MR2: Idempotence
        let flattened: Vec<TraceEvent> = foata
            .layers()
            .iter()
            .flat_map(|layer| layer.iter().cloned())
            .collect();
        let double_canonical = canonicalize(&flattened);
        assert_eq!(
            foata.layers(),
            double_canonical.layers(),
            "Idempotence failed"
        );

        // MR5: Event Preservation
        let canonical_event_count = foata.layers().iter().flat_map(|layer| layer.iter()).count();
        assert_eq!(canonical_event_count, trace.len(), "Event count changed");

        // MR1: Layer Independence
        for layer in foata.layers() {
            for i in 0..layer.len() {
                for j in i + 1..layer.len() {
                    assert!(
                        independent(&layer[i], &layer[j]),
                        "Compound test: Layer independence violated after idempotent canonicalization"
                    );
                }
            }
        }

        // Compound property: fingerprint should be stable across all transformations
        assert_eq!(
            foata.fingerprint(),
            double_canonical.fingerprint(),
            "Fingerprint changed after idempotent canonicalization"
        );
    }
}

// Helper functions

/// Check if two events are semantically equal (ignoring sequence and timestamp).
fn events_semantically_equal(a: &TraceEvent, b: &TraceEvent) -> bool {
    a.kind == b.kind && a.data == b.data
}

/// Find the positions of two events in the canonical form.
fn find_event_positions(
    foata: &FoataTrace,
    event_a: &TraceEvent,
    event_b: &TraceEvent,
) -> (usize, usize) {
    let mut pos_a = None;
    let mut pos_b = None;
    let mut position = 0;

    for layer in foata.layers() {
        for event in layer {
            if events_semantically_equal(event, event_a) && pos_a.is_none() {
                pos_a = Some(position);
            }
            if events_semantically_equal(event, event_b) && pos_b.is_none() {
                pos_b = Some(position);
            }
            position += 1;
        }
    }

    (
        pos_a.expect("Event A not found"),
        pos_b.expect("Event B not found"),
    )
}

#[cfg(test)]
mod validation_tests {
    use super::*;

    /// Mutation testing: verify MR suite catches common canonicalization bugs
    #[test]
    fn test_mr_suite_detects_mutations() {
        // Test that layer independence MR would catch bugs where dependent events
        // are placed in the same layer
        let trace = vec![
            TraceEvent::new(
                1,
                Time::ZERO,
                TraceEventKind::Spawn,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
            TraceEvent::new(
                2,
                Time::from_nanos(100),
                TraceEventKind::Complete,
                TraceData::Task {
                    task: TaskId::new_for_test(1, 0),
                    region: RegionId::new_for_test(1, 0),
                },
            ),
        ];

        let foata = canonicalize(&trace);

        // These events are dependent (same task), so should be in different layers
        assert!(
            foata.depth() >= 2,
            "Dependent events should create multiple layers"
        );

        // Test that event preservation would catch bugs where events are lost
        let canonical_event_count: usize = foata.layers().iter().map(|layer| layer.len()).sum();
        assert_eq!(
            canonical_event_count,
            trace.len(),
            "Event preservation check"
        );

        // Test that fingerprint consistency would catch fingerprint computation bugs
        let fingerprint1 = trace_fingerprint(&trace);
        let fingerprint2 = foata.fingerprint();
        assert_eq!(fingerprint1, fingerprint2, "Fingerprint consistency check");
    }
}