About the Execution of ITS-Tools for Champagne-PT-H06T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 562.123 | 453442.00 | 544524.00 | 1329.10 | TFFFFTFFFFFFFFFF | 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.r050-smll-177946901000060.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 Champagne-PT-H06T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K Mar 6 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 6 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 6 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 6 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 148K 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 Champagne-PT-H06T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H06T1U-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779494054109
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H06T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 23:54:16] [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 23:54:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:54:16] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2026-05-22 23:54:16] [INFO ] Transformed 519 places.
[2026-05-22 23:54:16] [INFO ] Transformed 668 transitions.
[2026-05-22 23:54:16] [INFO ] Found NUPN structural information;
[2026-05-22 23:54:16] [INFO ] Parsed PT model containing 519 places and 668 transitions and 1625 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Champagne-PT-H06T1U-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 668/668 transitions.
Discarding 107 places :
Symmetric choice reduction at 0 with 107 rule applications. Total rules 107 place count 412 transition count 561
Iterating global reduction 0 with 107 rules applied. Total rules applied 214 place count 412 transition count 561
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 281 place count 345 transition count 494
Iterating global reduction 0 with 67 rules applied. Total rules applied 348 place count 345 transition count 494
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 381 place count 312 transition count 461
Iterating global reduction 0 with 33 rules applied. Total rules applied 414 place count 312 transition count 461
Applied a total of 414 rules in 216 ms. Remains 312 /519 variables (removed 207) and now considering 461/668 (removed 207) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7764504117312182847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5697538757393658188.kers'
[2026-05-22 23:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7764504117312182847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5697538757393658188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 312 cols 1211 entries
Finished phase 1 with 292 SingleSign rule and 0 generalized
[2026-05-22 23:54:17] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5697538757393658188.kers
Total runtime 7 ms.
[2026-05-22 23:54:18] [INFO ] Implicit Places using invariants in 609 ms returned []
[2026-05-22 23:54:18] [INFO ] Invariant cache hit.
[2026-05-22 23:54:18] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-22 23:54:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/312 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 460 unsolved
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 30329ms
Starting structural reductions in LTL mode, iteration 1 : 312/519 places, 461/668 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32046 ms. Remains : 312/519 places, 461/668 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2026-05-22 23:54:49] [INFO ] Invariant cache hit.
[2026-05-22 23:54:49] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-22 23:54:49] [INFO ] Invariant cache hit.
[2026-05-22 23:54:50] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 312/312 places, 461/461 transitions.
Support contains 34 out of 312 places after structural reductions.
[2026-05-22 23:54:50] [INFO ] Flatten gal took : 76 ms
[2026-05-22 23:54:50] [INFO ] Flatten gal took : 37 ms
[2026-05-22 23:54:50] [INFO ] Input system was already deterministic with 461 transitions.
RANDOM walk for 40000 steps (123 resets) in 1179 ms. (33 steps per ms) remains 2/31 properties
BEST_FIRST walk for 40004 steps (11 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2026-05-22 23:54:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 275/312 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 461/773 variables, 312/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/773 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 773/773 variables, and 332 constraints, problems are : Problem set: 0 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 275/312 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 461/773 variables, 312/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/773 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 773/773 variables, and 334 constraints, problems are : Problem set: 0 solved, 2 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 2 properties in 15 ms.
Computed a total of 29 stabilizing places and 29 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' '!(X(((p0 U (G(p0)||(p0&&G(p1)))) U X(X((p2&&X(p0)))))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 296 transition count 445
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 296 transition count 445
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 286 transition count 435
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 286 transition count 435
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 282 transition count 431
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 282 transition count 431
Applied a total of 60 rules in 32 ms. Remains 282 /312 variables (removed 30) and now considering 431/461 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5215729421311527847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-688489368679335306.kers'
[2026-05-22 23:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5215729421311527847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-688489368679335306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 431 rows 282 cols 1151 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-22 23:54:53] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-688489368679335306.kers
Total runtime 5 ms.
[2026-05-22 23:54:53] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-22 23:54:53] [INFO ] Invariant cache hit.
[2026-05-22 23:54:53] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-22 23:54:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/713 variables, and 302 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/713 variables, 430/732 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/713 variables, and 733 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 282/312 places, 431/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60826 ms. Remains : 282/312 places, 431/461 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 U (G(p0)||(p0&&G(p1)))) U X(X((p2&&X(p0)))))))'
Stuttering acceptance computed with spot in 1641 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-00
Product exploration explored 100000 steps with 20000 reset in 605 ms.
Product exploration explored 100000 steps with 20000 reset in 449 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/282 stabilizing places and 22/431 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 12 factoid took 219 ms. Reduced automaton from 24 states, 80 edges and 3 AP (stutter sensitive) to 21 states, 67 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (126 resets) in 447 ms. (89 steps per ms) remains 3/22 properties
BEST_FIRST walk for 32710 steps (8 resets) in 86 ms. (375 steps per ms) remains 0/3 properties
Knowledge based reduction with 12 factoid took 452 ms. Reduced automaton from 21 states, 67 edges and 3 AP (stutter sensitive) to 21 states, 67 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1068 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Knowledge-based reduction took 1943 ms.
Stuttering acceptance computed with spot in 1042 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 431/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2026-05-22 23:55:59] [INFO ] Invariant cache hit.
[2026-05-22 23:55:59] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-22 23:55:59] [INFO ] Invariant cache hit.
[2026-05-22 23:56:00] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 282/282 places, 431/431 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/282 stabilizing places and 22/431 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 21 states, 67 edges and 3 AP (stutter sensitive) to 21 states, 67 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (129 resets) in 299 ms. (133 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40004 steps (9 resets) in 63 ms. (625 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2026-05-22 23:56:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/282 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/713 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/282 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/713 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 713/713 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 690ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 2 factoid took 484 ms. Reduced automaton from 21 states, 67 edges and 3 AP (stutter sensitive) to 21 states, 67 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1117 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Knowledge-based reduction took 2607 ms.
Stuttering acceptance computed with spot in 1111 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 1093 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 215 ms.
Product exploration explored 100000 steps with 20000 reset in 234 ms.
Spot run failed in 157 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/ltsmin7877883723138996728
[2026-05-22 23:56:05] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7877883723138996728
Running compilation step : cd /tmp/ltsmin7877883723138996728;'/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 1607 ms.
Running link step : cd /tmp/ltsmin7877883723138996728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin7877883723138996728;'/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/stateBased4801537740525107244.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H06T1U-LTLFireability-00 finished in 74801 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(p0) U X(X(X((p1&&(p2||X(X(p2)))))))))'
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 295 transition count 444
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 295 transition count 444
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 284 transition count 433
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 284 transition count 433
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 278 transition count 427
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 278 transition count 427
Applied a total of 68 rules in 17 ms. Remains 278 /312 variables (removed 34) and now considering 427/461 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14569884355318187345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14952396121011110374.kers'
[2026-05-22 23:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14569884355318187345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14952396121011110374.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 427 rows 278 cols 1143 entries
Finished phase 1 with 258 SingleSign rule and 0 generalized
[2026-05-22 23:56:07] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14952396121011110374.kers
Total runtime 3 ms.
[2026-05-22 23:56:07] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-22 23:56:07] [INFO ] Invariant cache hit.
[2026-05-22 23:56:08] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2026-05-22 23:56:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/705 variables, 278/298 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 705/705 variables, and 298 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/705 variables, 278/298 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 426/724 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/705 variables, and 724 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 278/312 places, 427/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 278/312 places, 427/461 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) U X(X(X((p1&&(p2||X(X(p2)))))))))'
Stuttering acceptance computed with spot in 1460 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-01
Stuttering criterion allowed to conclude after 396 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-01 finished in 62276 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||G(p1)))))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Graph (trivial) has 321 edges and 312 vertex of which 154 / 312 are part of one of the 20 SCC in 6 ms
Free SCC test removed 134 places
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 177 transition count 275
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 76 rules applied. Total rules applied 116 place count 138 transition count 238
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 135 place count 119 transition count 238
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 154 place count 100 transition count 182
Iterating global reduction 3 with 19 rules applied. Total rules applied 173 place count 100 transition count 182
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 185 place count 100 transition count 170
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 257 place count 64 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 260 place count 61 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 263 place count 61 transition count 125
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 61 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 59 transition count 120
Applied a total of 268 rules in 102 ms. Remains 59 /312 variables (removed 253) and now considering 120/461 (removed 341) transitions.
[2026-05-22 23:57:10] [INFO ] Flow matrix only has 62 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17676945035504893339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18096918600945737910.kers'
[2026-05-22 23:57:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17676945035504893339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18096918600945737910.kers]
Normalized transition count is 61 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 61 rows 54 cols 158 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 23:57:10] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18096918600945737910.kers
Total runtime 2 ms.
[2026-05-22 23:57:10] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-22 23:57:10] [INFO ] Flow matrix only has 62 transitions (discarded 58 similar events)
[2026-05-22 23:57:10] [INFO ] Invariant cache hit.
[2026-05-22 23:57:10] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2026-05-22 23:57:10] [INFO ] Redundant transitions in 5 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-22 23:57:10] [INFO ] Flow matrix only has 62 transitions (discarded 58 similar events)
[2026-05-22 23:57:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/59 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 61/120 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/120 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/121 variables, and 79 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2745 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/59 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 61/120 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 64/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/121 variables, and 143 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5576ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5577ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/312 places, 120/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5970 ms. Remains : 59/312 places, 120/461 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||G(p1)))))'
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-02 finished in 6119 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(G((((F(p0)||X(X(F(p1)))) U p2) U X(p3)))))'
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 297 transition count 446
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 297 transition count 446
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 287 transition count 436
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 287 transition count 436
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 281 transition count 430
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 281 transition count 430
Applied a total of 62 rules in 40 ms. Remains 281 /312 variables (removed 31) and now considering 430/461 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18065519324986437546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7098723237723644424.kers'
[2026-05-22 23:57:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18065519324986437546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7098723237723644424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 430 rows 281 cols 1149 entries
Finished phase 1 with 261 SingleSign rule and 0 generalized
[2026-05-22 23:57:16] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7098723237723644424.kers
Total runtime 5 ms.
[2026-05-22 23:57:16] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-22 23:57:16] [INFO ] Invariant cache hit.
[2026-05-22 23:57:16] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2026-05-22 23:57:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/711 variables, 281/304 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/711 variables, and 304 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/711 variables, 281/304 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/711 variables, 429/733 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/711 variables, 7/740 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 711/711 variables, and 745 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 281/312 places, 430/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60805 ms. Remains : 281/312 places, 430/461 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(G((((F(p0)||X(X(F(p1)))) U p2) U X(p3)))))'
Stuttering acceptance computed with spot in 461 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-03
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-03 finished in 61448 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)&&X(G(p1)))))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Graph (trivial) has 317 edges and 312 vertex of which 147 / 312 are part of one of the 19 SCC in 1 ms
Free SCC test removed 128 places
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 183 transition count 280
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 78 rules applied. Total rules applied 119 place count 143 transition count 242
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 21 rules applied. Total rules applied 140 place count 124 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 122 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 142 place count 122 transition count 239
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 121 transition count 239
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 164 place count 101 transition count 182
Iterating global reduction 4 with 20 rules applied. Total rules applied 184 place count 101 transition count 182
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 196 place count 101 transition count 170
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 270 place count 64 transition count 133
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 272 place count 62 transition count 126
Iterating global reduction 5 with 2 rules applied. Total rules applied 274 place count 62 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 276 place count 62 transition count 124
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 6 with 2 rules applied. Total rules applied 278 place count 61 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 279 place count 61 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 281 place count 61 transition count 122
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 282 place count 60 transition count 120
Iterating global reduction 7 with 1 rules applied. Total rules applied 283 place count 60 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 284 place count 60 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 286 place count 58 transition count 117
Applied a total of 286 rules in 89 ms. Remains 58 /312 variables (removed 254) and now considering 117/461 (removed 344) transitions.
[2026-05-22 23:58:17] [INFO ] Flow matrix only has 59 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6115320255014922817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15867947996028891973.kers'
[2026-05-22 23:58:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6115320255014922817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15867947996028891973.kers]
Normalized transition count is 58 out of 59 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 58 rows 53 cols 150 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 23:58:17] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15867947996028891973.kers
Total runtime 1 ms.
[2026-05-22 23:58:17] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 23:58:17] [INFO ] Flow matrix only has 59 transitions (discarded 58 similar events)
[2026-05-22 23:58:17] [INFO ] Invariant cache hit.
[2026-05-22 23:58:17] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2026-05-22 23:58:17] [INFO ] Redundant transitions in 5 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-22 23:58:17] [INFO ] Flow matrix only has 59 transitions (discarded 58 similar events)
[2026-05-22 23:58:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 58/116 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/117 variables, and 78 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2579 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 58/116 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 64/142 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/117 variables, and 142 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2576 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5167ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/312 places, 117/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5528 ms. Remains : 58/312 places, 117/461 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)&&X(G(p1)))))'
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-04
Stuttering criterion allowed to conclude after 126 steps with 3 reset in 3 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-04 finished in 5728 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(p0))'
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Graph (trivial) has 325 edges and 312 vertex of which 160 / 312 are part of one of the 20 SCC in 1 ms
Free SCC test removed 140 places
Ensure Unique test removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 171 transition count 268
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 74 rules applied. Total rules applied 113 place count 133 transition count 232
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 131 place count 115 transition count 232
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 150 place count 96 transition count 176
Iterating global reduction 3 with 19 rules applied. Total rules applied 169 place count 96 transition count 176
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 181 place count 96 transition count 164
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 249 place count 62 transition count 130
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 252 place count 59 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 255 place count 59 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 258 place count 59 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 57 transition count 116
Applied a total of 260 rules in 49 ms. Remains 57 /312 variables (removed 255) and now considering 116/461 (removed 345) transitions.
[2026-05-22 23:58:23] [INFO ] Flow matrix only has 54 transitions (discarded 62 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12507427344074341387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12308704664772137265.kers'
[2026-05-22 23:58:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12507427344074341387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12308704664772137265.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 53 rows 52 cols 140 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 23:58:23] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12308704664772137265.kers
Total runtime 2 ms.
[2026-05-22 23:58:23] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 23:58:23] [INFO ] Flow matrix only has 54 transitions (discarded 62 similar events)
[2026-05-22 23:58:23] [INFO ] Invariant cache hit.
[2026-05-22 23:58:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 23:58:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2026-05-22 23:58:23] [INFO ] Redundant transitions in 5 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-22 23:58:23] [INFO ] Flow matrix only has 54 transitions (discarded 62 similar events)
[2026-05-22 23:58:23] [INFO ] Invariant cache hit.
[2026-05-22 23:58:23] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 53/110 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 81 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3457 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 53/110 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 162 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3648 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7116ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 7118ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/312 places, 116/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7435 ms. Remains : 57/312 places, 116/461 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))'
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-08 finished in 7524 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 U (p1&&(p0||X(p2))))||F(p3))))'
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 294 transition count 443
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 294 transition count 443
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 282 transition count 431
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 282 transition count 431
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 277 transition count 426
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 277 transition count 426
Applied a total of 70 rules in 24 ms. Remains 277 /312 variables (removed 35) and now considering 426/461 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1897950181598132927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1467400791641969740.kers'
[2026-05-22 23:58:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1897950181598132927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1467400791641969740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 426 rows 277 cols 1141 entries
Finished phase 1 with 257 SingleSign rule and 0 generalized
[2026-05-22 23:58:30] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1467400791641969740.kers
Total runtime 5 ms.
[2026-05-22 23:58:30] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-22 23:58:30] [INFO ] Invariant cache hit.
[2026-05-22 23:58:31] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2026-05-22 23:58:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/703 variables, and 297 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 425/722 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 723 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 277/312 places, 426/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60805 ms. Remains : 277/312 places, 426/461 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 U (p1&&(p0||X(p2))))||F(p3))))'
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-09
Stuttering criterion allowed to conclude after 410 steps with 1 reset in 3 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-09 finished in 61067 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 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Graph (trivial) has 321 edges and 312 vertex of which 159 / 312 are part of one of the 20 SCC in 1 ms
Free SCC test removed 139 places
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 172 transition count 271
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 73 rules applied. Total rules applied 111 place count 135 transition count 235
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 129 place count 117 transition count 235
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 147 place count 99 transition count 180
Iterating global reduction 3 with 18 rules applied. Total rules applied 165 place count 99 transition count 180
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 177 place count 99 transition count 168
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 249 place count 63 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 252 place count 60 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 255 place count 60 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 258 place count 60 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 58 transition count 118
Applied a total of 260 rules in 47 ms. Remains 58 /312 variables (removed 254) and now considering 118/461 (removed 343) transitions.
[2026-05-22 23:59:31] [INFO ] Flow matrix only has 56 transitions (discarded 62 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10783439340873017217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15735130070701445173.kers'
[2026-05-22 23:59:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10783439340873017217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15735130070701445173.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 55 rows 53 cols 138 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 23:59:31] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15735130070701445173.kers
Total runtime 1 ms.
[2026-05-22 23:59:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-22 23:59:31] [INFO ] Flow matrix only has 56 transitions (discarded 62 similar events)
[2026-05-22 23:59:31] [INFO ] Invariant cache hit.
[2026-05-22 23:59:32] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2026-05-22 23:59:32] [INFO ] Redundant transitions in 5 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-22 23:59:32] [INFO ] Flow matrix only has 56 transitions (discarded 62 similar events)
[2026-05-22 23:59:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/58 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 78 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2693 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/58 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 64/142 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 142 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5424ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5424ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/312 places, 118/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5734 ms. Remains : 58/312 places, 118/461 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 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-10 finished in 5868 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) U (p1&&X(p2)))||G(p2)))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 295 transition count 444
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 295 transition count 444
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 282 transition count 431
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 282 transition count 431
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 276 transition count 425
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 276 transition count 425
Applied a total of 72 rules in 22 ms. Remains 276 /312 variables (removed 36) and now considering 425/461 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13491862751946341691.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1441304540697027614.kers'
[2026-05-22 23:59:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13491862751946341691.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1441304540697027614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 276 cols 1139 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-22 23:59:37] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1441304540697027614.kers
Total runtime 5 ms.
[2026-05-22 23:59:37] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-22 23:59:37] [INFO ] Invariant cache hit.
[2026-05-22 23:59:38] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2026-05-22 23:59:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 425/701 variables, 276/301 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/701 variables, and 301 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 425/701 variables, 276/301 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 424/725 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 731 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 276/312 places, 425/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 276/312 places, 425/461 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) U (p1&&X(p2)))||G(p2)))'
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-12 finished in 61105 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(X(X(G(p1)))))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 294 transition count 443
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 294 transition count 443
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 282 transition count 431
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 282 transition count 431
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 276 transition count 425
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 276 transition count 425
Applied a total of 72 rules in 23 ms. Remains 276 /312 variables (removed 36) and now considering 425/461 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18079367951054185525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15731363671723733182.kers'
[2026-05-23 00:00:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18079367951054185525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15731363671723733182.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 276 cols 1139 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 00:00:38] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15731363671723733182.kers
Total runtime 4 ms.
[2026-05-23 00:00:38] [INFO ] Implicit Places using invariants in 200 ms returned []
[2026-05-23 00:00:38] [INFO ] Invariant cache hit.
[2026-05-23 00:00:39] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 276/312 places, 425/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 276/312 places, 425/461 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(X(X(G(p0))))||p1)))'
Stuttering acceptance computed with spot in 262 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-13
Entered a terminal (fully accepting) state of product in 180 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-13 finished in 963 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 U X(G((F(G(p1)) U p2))))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 294 transition count 443
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 294 transition count 443
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 282 transition count 431
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 282 transition count 431
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 277 transition count 426
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 277 transition count 426
Applied a total of 70 rules in 24 ms. Remains 277 /312 variables (removed 35) and now considering 426/461 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16114457306156814279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1064387112702916044.kers'
[2026-05-23 00:00:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16114457306156814279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1064387112702916044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 426 rows 277 cols 1141 entries
Finished phase 1 with 257 SingleSign rule and 0 generalized
[2026-05-23 00:00:39] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1064387112702916044.kers
Total runtime 5 ms.
[2026-05-23 00:00:39] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-23 00:00:39] [INFO ] Invariant cache hit.
[2026-05-23 00:00:40] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2026-05-23 00:00:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/703 variables, and 297 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 425/722 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 723 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 277/312 places, 426/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60778 ms. Remains : 277/312 places, 426/461 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 U X(G((F(G(p1)) U p2))))))'
Stuttering acceptance computed with spot in 475 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-14
Stuttering criterion allowed to conclude after 427 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-14 finished in 61317 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(p0)&&(F(G((p1||X(F((p1&&F(p2))))))) U p3)))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 461/461 transitions.
Graph (trivial) has 318 edges and 312 vertex of which 157 / 312 are part of one of the 20 SCC in 1 ms
Free SCC test removed 137 places
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 174 transition count 274
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 68 rules applied. Total rules applied 105 place count 138 transition count 242
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 121 place count 122 transition count 242
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 141 place count 102 transition count 185
Iterating global reduction 3 with 20 rules applied. Total rules applied 161 place count 102 transition count 185
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 174 place count 102 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 174 place count 102 transition count 171
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 176 place count 101 transition count 171
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 246 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 63 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 63 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 255 place count 63 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 61 transition count 122
Applied a total of 257 rules in 44 ms. Remains 61 /312 variables (removed 251) and now considering 122/461 (removed 339) transitions.
[2026-05-23 00:01:41] [INFO ] Flow matrix only has 66 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-166174215678962582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16404890355564521751.kers'
[2026-05-23 00:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-166174215678962582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16404890355564521751.kers]
Normalized transition count is 65 out of 66 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 65 rows 57 cols 172 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-23 00:01:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16404890355564521751.kers
Total runtime 1 ms.
[2026-05-23 00:01:41] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 00:01:41] [INFO ] Flow matrix only has 66 transitions (discarded 56 similar events)
[2026-05-23 00:01:41] [INFO ] Invariant cache hit.
[2026-05-23 00:01:41] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2026-05-23 00:01:41] [INFO ] Redundant transitions in 5 ms returned []
Running 66 sub problems to find dead transitions.
[2026-05-23 00:01:41] [INFO ] Flow matrix only has 66 transitions (discarded 56 similar events)
[2026-05-23 00:01:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 2/61 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 65/126 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/127 variables, and 81 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2893 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 2/61 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 65/126 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 66/147 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/127 variables, and 147 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2906 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5810ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5811ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/312 places, 122/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6109 ms. Remains : 61/312 places, 122/461 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)&&(F(G((p1||X(F((p1&&F(p2))))))) U p3)))'
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T1U-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLFireability-15 finished in 6476 ms.
All properties solved by simple procedures.
Total runtime 451041 ms.
BK_STOP 1779494507551
--------------------
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="Champagne-PT-H06T1U"
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 Champagne-PT-H06T1U, 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 r050-smll-177946901000060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H06T1U.tgz
mv Champagne-PT-H06T1U 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 ;