About the Execution of ITS-Tools for AutonomousCar-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 815.483 | 765643.00 | 862966.00 | 2433.60 | FFFFFFTFFFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r018-smll-177946787900044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is AutonomousCar-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 75K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779476137230
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 18:55:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 18:55:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:55:40] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2026-05-22 18:55:40] [INFO ] Transformed 190 places.
[2026-05-22 18:55:40] [INFO ] Transformed 273 transitions.
[2026-05-22 18:55:40] [INFO ] Found NUPN structural information;
[2026-05-22 18:55:40] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-03b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 167 transition count 250
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 167 transition count 250
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 82 place count 167 transition count 214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 164 transition count 211
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 164 transition count 211
Applied a total of 88 rules in 106 ms. Remains 164 /190 variables (removed 26) and now considering 211/273 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4506696859845425542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6089562005801256848.kers'
[2026-05-22 18:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4506696859845425542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6089562005801256848.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 164 cols 711 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-22 18:55:40] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6089562005801256848.kers
Total runtime 6 ms.
[2026-05-22 18:55:41] [INFO ] Implicit Places using invariants in 508 ms returned []
[2026-05-22 18:55:41] [INFO ] Invariant cache hit.
[2026-05-22 18:55:41] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-22 18:55:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 6 (OVERLAPS) 211/375 variables, 164/203 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 2/205 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 1/206 constraints. Problems are: Problem set: 2 solved, 208 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/375 variables, and 206 constraints, problems are : Problem set: 2 solved, 208 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 2/164 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 31/39 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 211/375 variables, 164/203 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 208/411 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/412 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 3/415 constraints. Problems are: Problem set: 2 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 2/417 constraints. Problems are: Problem set: 2 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 417 constraints, problems are : Problem set: 2 solved, 208 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 208/210 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60305ms problems are : Problem set: 2 solved, 208 unsolved
Search for dead transitions found 2 dead transitions in 60334ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/190 places, 209/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 209
Applied a total of 1 rules in 14 ms. Remains 163 /164 variables (removed 1) and now considering 209/209 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1751458457753675994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9971163332914813144.kers'
[2026-05-22 18:56:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1751458457753675994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9971163332914813144.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 163 cols 705 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-22 18:56:41] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9971163332914813144.kers
Total runtime 1 ms.
[2026-05-22 18:56:42] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-22 18:56:42] [INFO ] Invariant cache hit.
[2026-05-22 18:56:42] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/190 places, 209/273 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61847 ms. Remains : 163/190 places, 209/273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2026-05-22 18:56:42] [INFO ] Invariant cache hit.
[2026-05-22 18:56:42] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-22 18:56:42] [INFO ] Invariant cache hit.
[2026-05-22 18:56:42] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-22 18:56:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/372 variables, 163/195 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/372 variables, and 199 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/372 variables, 163/198 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 208/406 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 414 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in LTL mode , in 1 iterations and 60463 ms. Remains : 163/163 places, 209/209 transitions.
Support contains 38 out of 163 places after structural reductions.
[2026-05-22 18:57:43] [INFO ] Flatten gal took : 84 ms
[2026-05-22 18:57:43] [INFO ] Flatten gal took : 39 ms
[2026-05-22 18:57:43] [INFO ] Input system was already deterministic with 209 transitions.
Support contains 36 out of 163 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (57 resets) in 2397 ms. (16 steps per ms) remains 2/33 properties
BEST_FIRST walk for 33422 steps (77 resets) in 183 ms. (181 steps per ms) remains 0/2 properties
FORMULA AutonomousCar-PT-03b-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 34 stabilizing places and 34 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(X(p0)||p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 154 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 199
Applied a total of 20 rules in 22 ms. Remains 153 /163 variables (removed 10) and now considering 199/209 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18312149024028542843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2464189721290464998.kers'
[2026-05-22 18:57:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18312149024028542843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2464189721290464998.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 153 cols 685 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-22 18:57:44] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2464189721290464998.kers
Total runtime 2 ms.
[2026-05-22 18:57:45] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-22 18:57:45] [INFO ] Invariant cache hit.
[2026-05-22 18:57:45] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-22 18:57:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 197 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 198/392 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 199/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60532 ms. Remains : 153/163 places, 199/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(X(p0)||p1))))'
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-00
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-00 finished in 60997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Graph (trivial) has 150 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 160 transition count 141
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 86 rules applied. Total rules applied 152 place count 95 transition count 120
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 165 place count 83 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 82 transition count 119
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 166 place count 82 transition count 113
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 178 place count 76 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 181 place count 73 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 184 place count 73 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 184 place count 73 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 72 transition count 109
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 244 place count 43 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 245 place count 43 transition count 79
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 252 place count 36 transition count 57
Iterating global reduction 5 with 7 rules applied. Total rules applied 259 place count 36 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 262 place count 36 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 266 place count 34 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 270 place count 32 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 30 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 273 place count 29 transition count 68
Applied a total of 273 rules in 59 ms. Remains 29 /163 variables (removed 134) and now considering 68/209 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18217232156477195732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-24020892320767139.kers'
[2026-05-22 18:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18217232156477195732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-24020892320767139.kers]
Normalized transition count is 67 out of 68 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 67 rows 28 cols 377 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-22 18:58:45] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-24020892320767139.kers
Total runtime 0 ms.
[2026-05-22 18:58:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-22 18:58:45] [INFO ] Invariant cache hit.
[2026-05-22 18:58:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:58:45] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [23, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 121 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/163 places, 68/209 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 25 transition count 66
Applied a total of 4 rules in 8 ms. Remains 25 /27 variables (removed 2) and now considering 66/68 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12394095477295486151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14042633750721915304.kers'
[2026-05-22 18:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12394095477295486151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14042633750721915304.kers]
Normalized transition count is 65 out of 66 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 25 cols 371 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-22 18:58:45] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14042633750721915304.kers
Total runtime 1 ms.
[2026-05-22 18:58:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-22 18:58:46] [INFO ] Invariant cache hit.
[2026-05-22 18:58:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:58:46] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/163 places, 66/209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 25/163 places, 66/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-01
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-01 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||X(p1)))) U (!p0&&(!p0 U !p1)))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 158 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 158 transition count 204
Applied a total of 10 rules in 11 ms. Remains 158 /163 variables (removed 5) and now considering 204/209 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15054371715507345171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16566956821065305560.kers'
[2026-05-22 18:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15054371715507345171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16566956821065305560.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 158 cols 695 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-22 18:58:46] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16566956821065305560.kers
Total runtime 4 ms.
[2026-05-22 18:58:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-22 18:58:46] [INFO ] Invariant cache hit.
[2026-05-22 18:58:46] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-22 18:58:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 204/362 variables, 158/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/362 variables, and 198 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/362 variables, 158/195 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 203/398 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 405 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 158/163 places, 204/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60396 ms. Remains : 158/163 places, 204/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||X(p1)))) U (!p0&&(!p0 U !p1)))))'
Stuttering acceptance computed with spot in 277 ms :[(OR p1 p0), (OR p1 p0), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-02
Product exploration explored 100000 steps with 14 reset in 295 ms.
Product exploration explored 100000 steps with 12 reset in 242 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge based reduction with 8 factoid took 97 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (47 resets) in 404 ms. (98 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40000 steps (48 resets) in 250 ms. (159 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (20 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
[2026-05-22 18:59:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/158 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 362/362 variables, and 169 constraints, problems are : Problem set: 1 solved, 0 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 604ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1))]
[2026-05-22 18:59:49] [INFO ] Invariant cache hit.
Proved EG true asserting that LTL formula F !true is false.
Knowledge-based reduction took 1651 ms.
Stuttering acceptance computed with spot in 268 ms :[true, true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 204/204 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2026-05-22 18:59:49] [INFO ] Invariant cache hit.
[2026-05-22 18:59:49] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-22 18:59:49] [INFO ] Invariant cache hit.
[2026-05-22 18:59:49] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 158/158 places, 204/204 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (24 resets) in 98 ms. (404 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1))]
[2026-05-22 18:59:50] [INFO ] Invariant cache hit.
Proved EG true asserting that LTL formula F !true is false.
Knowledge-based reduction took 715 ms.
Stuttering acceptance computed with spot in 269 ms :[true, true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 265 ms :[true, true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 129 ms.
Product exploration explored 100000 steps with 28 reset in 239 ms.
Spot run failed in 144 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1677018067166667457
[2026-05-22 18:59:51] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1677018067166667457
Running compilation step : cd /tmp/ltsmin1677018067166667457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 980 ms.
Running link step : cd /tmp/ltsmin1677018067166667457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin1677018067166667457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5740656664047027210.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2026-05-22 19:00:06] [INFO ] Invariant cache hit.
[2026-05-22 19:00:06] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-22 19:00:06] [INFO ] Invariant cache hit.
[2026-05-22 19:00:07] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 158/158 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin4148498963730626729
[2026-05-22 19:00:07] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4148498963730626729
Running compilation step : cd /tmp/ltsmin4148498963730626729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 755 ms.
Running link step : cd /tmp/ltsmin4148498963730626729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin4148498963730626729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5040576487784711201.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 19:00:22] [INFO ] Flatten gal took : 16 ms
[2026-05-22 19:00:22] [INFO ] Flatten gal took : 14 ms
[2026-05-22 19:00:22] [INFO ] Time to serialize gal into /tmp/LTL3033023567093825431.gal : 6 ms
[2026-05-22 19:00:22] [INFO ] Time to serialize properties into /tmp/LTL7230764926973750899.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3033023567093825431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9814495442221385407.hoa' '-atoms' '/tmp/LTL7230764926973750899.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7230764926973750899.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9814495442221385407.hoa
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t27, t35, t38, t39, t40, t67, t68, t71, t72, t74, t88, t94, t95, t98, t99, t10...372
Computing Next relation with stutter on 680 deadlock states
Detected timeout of ITS tools.
[2026-05-22 19:00:37] [INFO ] Flatten gal took : 14 ms
[2026-05-22 19:00:37] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:00:37] [INFO ] Time to serialize gal into /tmp/LTL7627206906535036852.gal : 3 ms
[2026-05-22 19:00:37] [INFO ] Time to serialize properties into /tmp/LTL17883202444927561995.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7627206906535036852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17883202444927561995.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G(("(p134!=1)")||(X("(p171!=1)")))))U(("(p134==1)")&&(("(p134==1)")U("(p171==1)"))))))
Formula 0 simplified : X(GF(!"(p134!=1)" & X!"(p171!=1)") R (!"(p134==1)" | (!"(p134==1)" R !"(p171==1)")))
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t27, t35, t38, t39, t40, t67, t68, t71, t72, t74, t88, t94, t95, t98, t99, t10...372
Computing Next relation with stutter on 680 deadlock states
Detected timeout of ITS tools.
[2026-05-22 19:00:52] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:00:52] [INFO ] Applying decomposition
[2026-05-22 19:00:52] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3176873270638692583.txt' '-o' '/tmp/graph3176873270638692583.bin' '-w' '/tmp/graph3176873270638692583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3176873270638692583.bin' '-l' '-1' '-v' '-w' '/tmp/graph3176873270638692583.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:00:52] [INFO ] Decomposing Gal with order
[2026-05-22 19:00:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:00:52] [INFO ] Removed a total of 116 redundant transitions.
[2026-05-22 19:00:52] [INFO ] Flatten gal took : 115 ms
[2026-05-22 19:00:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 13 ms.
[2026-05-22 19:00:52] [INFO ] Time to serialize gal into /tmp/LTL13286730398424395981.gal : 8 ms
[2026-05-22 19:00:52] [INFO ] Time to serialize properties into /tmp/LTL15895238927723415142.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13286730398424395981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15895238927723415142.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F(G(("(i9.i1.u43.p134!=1)")||(X("(i13.i0.u53.p171!=1)")))))U(("(i9.i1.u43.p134==1)")&&(("(i9.i1.u43.p134==1)")U("(i13.i0.u53.p17...167
Formula 0 simplified : X(GF(!"(i9.i1.u43.p134!=1)" & X!"(i13.i0.u53.p171!=1)") R (!"(i9.i1.u43.p134==1)" | (!"(i9.i1.u43.p134==1)" R !"(i13.i0.u53.p171==1)...159
Reverse transition relation is NOT exact ! Due to transitions t155, t176, t188, t206, u37.t35, u37.t38, u37.t39, u37.t40, i0.t150, i0.t148, i3.u15.t125, i3...532
Computing Next relation with stutter on 680 deadlock states
169 unique states visited
169 strongly connected components in search stack
169 transitions explored
169 items max in DFS search stack
145 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.4926,57816,1,0,86020,1382,2310,144732,346,4784,152861
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-03b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-03b-LTLFireability-02 finished in 128298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(p1)))&&F(p2)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 154 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 199
Applied a total of 20 rules in 7 ms. Remains 153 /163 variables (removed 10) and now considering 199/209 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4028695541859280644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11639836821513480432.kers'
[2026-05-22 19:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4028695541859280644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11639836821513480432.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 153 cols 685 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-22 19:00:54] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11639836821513480432.kers
Total runtime 2 ms.
[2026-05-22 19:00:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-22 19:00:54] [INFO ] Invariant cache hit.
[2026-05-22 19:00:54] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-22 19:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 198 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/195 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 198/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 199/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60477 ms. Remains : 153/163 places, 199/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(p1)))&&F(p2)))'
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-03
Stuttering criterion allowed to conclude after 881 steps with 31 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-03 finished in 60713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1 U X(!p1))) U (!p1 U p2)))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Graph (trivial) has 143 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 160 transition count 140
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 87 rules applied. Total rules applied 154 place count 94 transition count 119
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 167 place count 82 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 81 transition count 118
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 168 place count 81 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 178 place count 76 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 181 place count 73 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 184 place count 73 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 184 place count 73 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 72 transition count 109
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 238 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 239 place count 46 transition count 81
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 243 place count 42 transition count 71
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 42 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 249 place count 42 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 253 place count 40 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 257 place count 38 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 259 place count 36 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 260 place count 35 transition count 90
Applied a total of 260 rules in 34 ms. Remains 35 /163 variables (removed 128) and now considering 90/209 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15433303552622226624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9293854356430886890.kers'
[2026-05-22 19:01:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15433303552622226624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9293854356430886890.kers]
Normalized transition count is 89 out of 90 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 89 rows 34 cols 500 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-22 19:01:55] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9293854356430886890.kers
Total runtime 1 ms.
[2026-05-22 19:01:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-22 19:01:55] [INFO ] Invariant cache hit.
[2026-05-22 19:01:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 19:01:55] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [31, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 166 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/163 places, 90/209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 31 transition count 88
Applied a total of 4 rules in 10 ms. Remains 31 /33 variables (removed 2) and now considering 88/90 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9397020884266161938.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8366626126082640118.kers'
[2026-05-22 19:01:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9397020884266161938.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8366626126082640118.kers]
Normalized transition count is 87 out of 88 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 31 cols 498 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-22 19:01:55] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8366626126082640118.kers
Total runtime 1 ms.
[2026-05-22 19:01:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-22 19:01:55] [INFO ] Invariant cache hit.
[2026-05-22 19:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:01:55] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/163 places, 88/209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 347 ms. Remains : 31/163 places, 88/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1 U X(!p1))) U (!p1 U p2)))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p2) p1), p1, true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-05
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-05 finished in 539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Graph (trivial) has 152 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 160 transition count 139
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 89 rules applied. Total rules applied 157 place count 93 transition count 117
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 170 place count 80 transition count 117
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 170 place count 80 transition count 110
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 184 place count 73 transition count 110
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 186 place count 71 transition count 108
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 71 transition count 108
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 248 place count 41 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 41 transition count 76
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 256 place count 34 transition count 54
Iterating global reduction 4 with 7 rules applied. Total rules applied 263 place count 34 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 266 place count 34 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 270 place count 32 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 274 place count 30 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 28 transition count 65
Applied a total of 276 rules in 36 ms. Remains 28 /163 variables (removed 135) and now considering 65/209 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16650259895948790739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17926423835246295865.kers'
[2026-05-22 19:01:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16650259895948790739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17926423835246295865.kers]
Normalized transition count is 64 out of 65 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 64 rows 27 cols 370 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-22 19:01:55] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17926423835246295865.kers
Total runtime 1 ms.
[2026-05-22 19:01:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 19:01:55] [INFO ] Invariant cache hit.
[2026-05-22 19:01:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-22 19:01:56] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [24, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 153 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/163 places, 65/209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 63
Applied a total of 4 rules in 6 ms. Remains 24 /26 variables (removed 2) and now considering 63/65 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4010994525178083672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4516274543019521575.kers'
[2026-05-22 19:01:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4010994525178083672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4516274543019521575.kers]
Normalized transition count is 62 out of 63 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 62 rows 24 cols 368 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-22 19:01:56] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4516274543019521575.kers
Total runtime 1 ms.
[2026-05-22 19:01:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 19:01:56] [INFO ] Invariant cache hit.
[2026-05-22 19:01:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-22 19:01:56] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/163 places, 63/209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 338 ms. Remains : 24/163 places, 63/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 3 reset in 192 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/24 stabilizing places and 5/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Knowledge-based reduction took 347 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2026-05-22 19:01:57] [INFO ] Invariant cache hit.
[2026-05-22 19:01:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 19:01:57] [INFO ] Invariant cache hit.
[2026-05-22 19:01:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-22 19:01:57] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2026-05-22 19:01:57] [INFO ] Redundant transitions in 21 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-22 19:01:57] [INFO ] Invariant cache hit.
[2026-05-22 19:01:57] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/86 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 22/52 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 53 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/86 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 22/52 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 53/105 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/87 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/87 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 108 constraints, problems are : Problem set: 0 solved, 53 unsolved in 5613 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7362ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 7363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7560 ms. Remains : 24/24 places, 63/63 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/24 stabilizing places and 5/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Knowledge-based reduction took 258 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3 reset in 52 ms.
Product exploration explored 100000 steps with 7 reset in 114 ms.
Built C files in :
/tmp/ltsmin13038248526414290567
[2026-05-22 19:02:05] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2026-05-22 19:02:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:02:05] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2026-05-22 19:02:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:02:05] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2026-05-22 19:02:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:02:05] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13038248526414290567
Running compilation step : cd /tmp/ltsmin13038248526414290567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 283 ms.
Running link step : cd /tmp/ltsmin13038248526414290567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13038248526414290567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16950598942943187787.hoa' '--buchi-type=spotba'
LTSmin run took 46 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03b-LTLFireability-06 finished in 9688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Graph (trivial) has 150 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 160 transition count 139
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 88 rules applied. Total rules applied 156 place count 93 transition count 118
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 168 place count 81 transition count 118
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 168 place count 81 transition count 110
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 184 place count 73 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 70 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 70 transition count 107
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 246 place count 42 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 42 transition count 77
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 253 place count 36 transition count 58
Iterating global reduction 4 with 6 rules applied. Total rules applied 259 place count 36 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 261 place count 36 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 265 place count 34 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 269 place count 32 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 31 transition count 71
Applied a total of 270 rules in 19 ms. Remains 31 /163 variables (removed 132) and now considering 71/209 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2951149887180417386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10350191006796406665.kers'
[2026-05-22 19:02:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2951149887180417386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10350191006796406665.kers]
Normalized transition count is 70 out of 71 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 70 rows 30 cols 441 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 19:02:05] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10350191006796406665.kers
Total runtime 1 ms.
[2026-05-22 19:02:05] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 19:02:05] [INFO ] Invariant cache hit.
[2026-05-22 19:02:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 19:02:05] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [27, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 151 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/163 places, 71/209 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 27 transition count 69
Applied a total of 4 rules in 6 ms. Remains 27 /29 variables (removed 2) and now considering 69/71 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8505645103913396218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9680279403607100058.kers'
[2026-05-22 19:02:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8505645103913396218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9680279403607100058.kers]
Normalized transition count is 68 out of 69 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 27 cols 443 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 19:02:05] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9680279403607100058.kers
Total runtime 1 ms.
[2026-05-22 19:02:05] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 19:02:05] [INFO ] Invariant cache hit.
[2026-05-22 19:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:02:05] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/163 places, 69/209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 316 ms. Remains : 27/163 places, 69/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 2 reset in 112 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 174 steps (12 resets) in 8 ms. (19 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 204 ms.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2026-05-22 19:02:06] [INFO ] Invariant cache hit.
[2026-05-22 19:02:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-22 19:02:06] [INFO ] Invariant cache hit.
[2026-05-22 19:02:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:02:06] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-22 19:02:06] [INFO ] Redundant transitions in 17 ms returned []
Running 59 sub problems to find dead transitions.
[2026-05-22 19:02:06] [INFO ] Invariant cache hit.
[2026-05-22 19:02:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 68/95 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 36 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2643 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 68/95 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 59/91 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 95 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 7856ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 7857ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8026 ms. Remains : 27/27 places, 69/69 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 118 steps (5 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 238 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 66 ms.
Product exploration explored 100000 steps with 3 reset in 76 ms.
Built C files in :
/tmp/ltsmin3560531412043859104
[2026-05-22 19:02:15] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2026-05-22 19:02:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:02:15] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2026-05-22 19:02:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:02:15] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2026-05-22 19:02:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:02:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3560531412043859104
Running compilation step : cd /tmp/ltsmin3560531412043859104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 269 ms.
Running link step : cd /tmp/ltsmin3560531412043859104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3560531412043859104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11419738023135998784.hoa' '--buchi-type=spotba'
LTSmin run took 64 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03b-LTLFireability-07 finished in 9909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(((p0 U p1)||p2) U !((X(p2) U p3) U X(p4))))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 158 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 158 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 156 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 156 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 155 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 155 transition count 201
Applied a total of 16 rules in 6 ms. Remains 155 /163 variables (removed 8) and now considering 201/209 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12503710766043520686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9296525940567617768.kers'
[2026-05-22 19:02:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12503710766043520686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9296525940567617768.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 155 cols 689 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-22 19:02:15] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9296525940567617768.kers
Total runtime 4 ms.
[2026-05-22 19:02:15] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-22 19:02:15] [INFO ] Invariant cache hit.
[2026-05-22 19:02:15] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-22 19:02:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 201/356 variables, 155/191 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 195 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/192 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/392 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 399 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 155/163 places, 201/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60482 ms. Remains : 155/163 places, 201/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(((p0 U p1)||p2) U !((X(p2) U p3) U X(p4))))'
Stuttering acceptance computed with spot in 483 ms :[(NOT p4), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (NOT p4), (AND p1 (NOT p4)), true, (OR (NOT p2) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4))), p1, (OR (AND p1 (NOT p3) p4) (AND p1 (NOT p2) p4))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-08 finished in 61037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(G((p1||X(p2))))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 156 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 156 transition count 202
Applied a total of 14 rules in 6 ms. Remains 156 /163 variables (removed 7) and now considering 202/209 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-604864557829956818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2463459531912228148.kers'
[2026-05-22 19:03:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-604864557829956818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2463459531912228148.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 156 cols 691 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-22 19:03:16] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2463459531912228148.kers
Total runtime 1 ms.
[2026-05-22 19:03:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-22 19:03:16] [INFO ] Invariant cache hit.
[2026-05-22 19:03:16] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-05-22 19:03:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 202/358 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/358 variables, and 207 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/358 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 201/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 156/163 places, 202/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60389 ms. Remains : 156/163 places, 202/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(G((p1||X(p2))))))))'
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 121 ms.
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 19 ms. Proved property starting from automaton with 6 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03b-LTLFireability-10 finished in 60984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U X(X(X(p2)))))'
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 155 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 154 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 154 transition count 200
Applied a total of 18 rules in 9 ms. Remains 154 /163 variables (removed 9) and now considering 200/209 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16746778912845982421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11122631509458688438.kers'
[2026-05-22 19:04:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16746778912845982421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11122631509458688438.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 154 cols 687 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-22 19:04:17] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11122631509458688438.kers
Total runtime 2 ms.
[2026-05-22 19:04:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-22 19:04:17] [INFO ] Invariant cache hit.
[2026-05-22 19:04:17] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-22 19:04:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/189 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/354 variables, and 199 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 199/398 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 405 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 154/163 places, 200/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60391 ms. Remains : 154/163 places, 200/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||p1) U X(X(X(p2)))))'
Stuttering acceptance computed with spot in 581 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-12
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-12 finished in 61027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U G(p1)))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 154 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 199
Applied a total of 20 rules in 12 ms. Remains 153 /163 variables (removed 10) and now considering 199/209 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5580889868942574714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7531512795207698848.kers'
[2026-05-22 19:05:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5580889868942574714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7531512795207698848.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 153 cols 685 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-22 19:05:18] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7531512795207698848.kers
Total runtime 3 ms.
[2026-05-22 19:05:18] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-22 19:05:18] [INFO ] Invariant cache hit.
[2026-05-22 19:05:18] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-22 19:05:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/352 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 197 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 198/392 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 199/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 153/163 places, 199/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U G(p1)))'
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-13
Product exploration explored 100000 steps with 20019 reset in 139 ms.
Product exploration explored 100000 steps with 20004 reset in 152 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge based reduction with 6 factoid took 69 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (36 resets) in 152 ms. (261 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (57 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2026-05-22 19:06:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/153 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/352 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/153 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/352 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 910ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 199/199 transitions.
Graph (trivial) has 138 edges and 153 vertex of which 4 / 153 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 377 edges and 151 vertex of which 149 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 149 transition count 136
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 78 rules applied. Total rules applied 139 place count 92 transition count 115
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 152 place count 80 transition count 114
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 155 place count 79 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 78 transition count 112
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 156 place count 78 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 168 place count 72 transition count 106
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 232 place count 40 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 40 transition count 73
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 239 place count 34 transition count 55
Iterating global reduction 6 with 6 rules applied. Total rules applied 245 place count 34 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 247 place count 34 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 33 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 253 place count 31 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 254 place count 31 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 255 place count 30 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 256 place count 30 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 257 place count 29 transition count 67
Applied a total of 257 rules in 44 ms. Remains 29 /153 variables (removed 124) and now considering 67/199 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 29/153 places, 67/199 transitions.
RANDOM walk for 25214 steps (1784 resets) in 81 ms. (307 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G (OR (NOT p0) p1))
Knowledge based reduction with 6 factoid took 50 ms. Proved property starting from automaton with 6 states, 14 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 1286 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutonomousCar-PT-03b-LTLFireability-13 finished in 62379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(!p1&&X(p2)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 156 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 156 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 155 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 155 transition count 201
Applied a total of 16 rules in 11 ms. Remains 155 /163 variables (removed 8) and now considering 201/209 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7078591560339523186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6800145703740084513.kers'
[2026-05-22 19:06:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7078591560339523186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6800145703740084513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 155 cols 689 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-22 19:06:20] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6800145703740084513.kers
Total runtime 2 ms.
[2026-05-22 19:06:20] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-22 19:06:20] [INFO ] Invariant cache hit.
[2026-05-22 19:06:21] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-22 19:06:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 201/356 variables, 155/190 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 193 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/356 variables, 155/192 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 200/392 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 399 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 155/163 places, 201/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60461 ms. Remains : 155/163 places, 201/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(p1&&X(p2)))))'
Stuttering acceptance computed with spot in 186 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-14 finished in 60695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((p0 U (p1||G(p0)))))||(p2&&X((G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&F((p2||X(p2)))))))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 209/209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 155 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 154 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 154 transition count 200
Applied a total of 18 rules in 10 ms. Remains 154 /163 variables (removed 9) and now considering 200/209 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16327854703153278822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16287286499930433031.kers'
[2026-05-22 19:07:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16327854703153278822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16287286499930433031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 154 cols 687 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-22 19:07:21] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16287286499930433031.kers
Total runtime 3 ms.
[2026-05-22 19:07:21] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-22 19:07:21] [INFO ] Invariant cache hit.
[2026-05-22 19:07:21] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-22 19:07:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 200/354 variables, 154/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/354 variables, and 197 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/354 variables, 154/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 199/393 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 400 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 154/163 places, 200/209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60466 ms. Remains : 154/163 places, 200/209 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((p0 U (p1||G(p0)))))||(p2&&X((G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&F((p2||X(p2)))))))))))'
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 19 ms. Proved property starting from automaton with 6 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03b-LTLFireability-15 finished in 61251 ms.
All properties solved by simple procedures.
Total runtime 763094 ms.
BK_STOP 1779476902873
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-03b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946787900044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03b.tgz
mv AutonomousCar-PT-03b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
