About the Execution of ITS-Tools for ASLink-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16193.720 | 3600000.00 | 7087553.00 | 47574.30 | FFFFFFFTFTF?FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200372.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200372
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 921K 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 ASLink-PT-06b-LTLFireability-00
FORMULA_NAME ASLink-PT-06b-LTLFireability-01
FORMULA_NAME ASLink-PT-06b-LTLFireability-02
FORMULA_NAME ASLink-PT-06b-LTLFireability-03
FORMULA_NAME ASLink-PT-06b-LTLFireability-04
FORMULA_NAME ASLink-PT-06b-LTLFireability-05
FORMULA_NAME ASLink-PT-06b-LTLFireability-06
FORMULA_NAME ASLink-PT-06b-LTLFireability-07
FORMULA_NAME ASLink-PT-06b-LTLFireability-08
FORMULA_NAME ASLink-PT-06b-LTLFireability-09
FORMULA_NAME ASLink-PT-06b-LTLFireability-10
FORMULA_NAME ASLink-PT-06b-LTLFireability-11
FORMULA_NAME ASLink-PT-06b-LTLFireability-12
FORMULA_NAME ASLink-PT-06b-LTLFireability-13
FORMULA_NAME ASLink-PT-06b-LTLFireability-14
FORMULA_NAME ASLink-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779479559098
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 19:52:40] [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 19:52:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:52:41] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2026-05-22 19:52:41] [INFO ] Transformed 2826 places.
[2026-05-22 19:52:41] [INFO ] Transformed 3513 transitions.
[2026-05-22 19:52:41] [INFO ] Found NUPN structural information;
[2026-05-22 19:52:41] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA ASLink-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Discarding 174 places :
Symmetric choice reduction at 0 with 174 rule applications. Total rules 174 place count 2652 transition count 3339
Iterating global reduction 0 with 174 rules applied. Total rules applied 348 place count 2652 transition count 3339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 349 place count 2652 transition count 3338
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 416 place count 2585 transition count 3233
Iterating global reduction 1 with 67 rules applied. Total rules applied 483 place count 2585 transition count 3233
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 504 place count 2585 transition count 3212
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 513 place count 2576 transition count 3203
Iterating global reduction 2 with 9 rules applied. Total rules applied 522 place count 2576 transition count 3203
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 2572 transition count 3192
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 2572 transition count 3192
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 533 place count 2569 transition count 3189
Iterating global reduction 2 with 3 rules applied. Total rules applied 536 place count 2569 transition count 3189
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 539 place count 2566 transition count 3179
Iterating global reduction 2 with 3 rules applied. Total rules applied 542 place count 2566 transition count 3179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 543 place count 2565 transition count 3171
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 2565 transition count 3171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 545 place count 2564 transition count 3170
Iterating global reduction 2 with 1 rules applied. Total rules applied 546 place count 2564 transition count 3170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 547 place count 2563 transition count 3162
Iterating global reduction 2 with 1 rules applied. Total rules applied 548 place count 2563 transition count 3162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 549 place count 2562 transition count 3154
Iterating global reduction 2 with 1 rules applied. Total rules applied 550 place count 2562 transition count 3154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 551 place count 2561 transition count 3153
Iterating global reduction 2 with 1 rules applied. Total rules applied 552 place count 2561 transition count 3153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 553 place count 2560 transition count 3145
Iterating global reduction 2 with 1 rules applied. Total rules applied 554 place count 2560 transition count 3145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 555 place count 2559 transition count 3137
Iterating global reduction 2 with 1 rules applied. Total rules applied 556 place count 2559 transition count 3137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 557 place count 2558 transition count 3136
Iterating global reduction 2 with 1 rules applied. Total rules applied 558 place count 2558 transition count 3136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 559 place count 2557 transition count 3128
Iterating global reduction 2 with 1 rules applied. Total rules applied 560 place count 2557 transition count 3128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 561 place count 2556 transition count 3120
Iterating global reduction 2 with 1 rules applied. Total rules applied 562 place count 2556 transition count 3120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 563 place count 2555 transition count 3119
Iterating global reduction 2 with 1 rules applied. Total rules applied 564 place count 2555 transition count 3119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 565 place count 2554 transition count 3111
Iterating global reduction 2 with 1 rules applied. Total rules applied 566 place count 2554 transition count 3111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 567 place count 2553 transition count 3103
Iterating global reduction 2 with 1 rules applied. Total rules applied 568 place count 2553 transition count 3103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 569 place count 2552 transition count 3102
Iterating global reduction 2 with 1 rules applied. Total rules applied 570 place count 2552 transition count 3102
Applied a total of 570 rules in 4437 ms. Remains 2552 /2826 variables (removed 274) and now considering 3102/3513 (removed 411) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18301934934760735827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12606026975207017346.kers'
[2026-05-22 19:52:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18301934934760735827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12606026975207017346.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3102 rows 2552 cols 9619 entries
Finished phase 1 with 1624 SingleSign rule and 651 generalized
[2026-05-22 19:52:46] [INFO ] Computed 277 invariants in 23 ms
Computed 277 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-12606026975207017346.kers
Total runtime 27 ms.
[2026-05-22 19:52:48] [INFO ] Implicit Places using invariants in 2806 ms returned [2386, 2397, 2408, 2416, 2424, 2432, 2440, 2451, 2459, 2467, 2478]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2879 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2541/2826 places, 3102/3513 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2528 transition count 3089
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2528 transition count 3089
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 2517 transition count 3078
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 2517 transition count 3078
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 2508 transition count 3069
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 2508 transition count 3069
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 2505 transition count 3066
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 2505 transition count 3066
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 2503 transition count 3064
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 2503 transition count 3064
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 2501 transition count 3062
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 2501 transition count 3062
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 2500 transition count 3061
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 2500 transition count 3061
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2499 transition count 3060
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2499 transition count 3060
Applied a total of 84 rules in 1134 ms. Remains 2499 /2541 variables (removed 42) and now considering 3060/3102 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9459831853176008320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1851593304422929033.kers'
[2026-05-22 19:52:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9459831853176008320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1851593304422929033.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3060 rows 2499 cols 9483 entries
Finished phase 1 with 1615 SingleSign rule and 618 generalized
[2026-05-22 19:52:50] [INFO ] Computed 266 invariants in 37 ms
Computed 266 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-1851593304422929033.kers
Total runtime 46 ms.
[2026-05-22 19:52:51] [INFO ] Implicit Places using invariants in 1820 ms returned []
[2026-05-22 19:52:51] [INFO ] Invariant cache hit.
[2026-05-22 19:53:00] [INFO ] Implicit Places using invariants and state equation in 8348 ms returned []
Implicit Place search using SMT with State Equation took 10191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2499/2826 places, 3060/3513 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18659 ms. Remains : 2499/2826 places, 3060/3513 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Applied a total of 0 rules in 118 ms. Remains 2499 /2499 variables (removed 0) and now considering 3060/3060 (removed 0) transitions.
[2026-05-22 19:53:00] [INFO ] Invariant cache hit.
[2026-05-22 19:53:01] [INFO ] Implicit Places using invariants in 1628 ms returned []
[2026-05-22 19:53:01] [INFO ] Invariant cache hit.
[2026-05-22 19:53:10] [INFO ] Implicit Places using invariants and state equation in 8291 ms returned []
Implicit Place search using SMT with State Equation took 9941 ms to find 0 implicit places.
Running 3059 sub problems to find dead transitions.
[2026-05-22 19:53:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2498 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 3059 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2498/5559 variables, and 159 constraints, problems are : Problem set: 0 solved, 3059 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 159/212 constraints, State Equation: 0/2499 constraints, PredecessorRefiner: 3059/3059 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3059 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2498 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 3059 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2498/5559 variables, and 159 constraints, problems are : Problem set: 0 solved, 3059 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 159/212 constraints, State Equation: 0/2499 constraints, PredecessorRefiner: 0/3059 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61423ms problems are : Problem set: 0 solved, 3059 unsolved
Search for dead transitions found 0 dead transitions in 61464ms
Finished structural reductions in LTL mode , in 1 iterations and 71581 ms. Remains : 2499/2499 places, 3060/3060 transitions.
Support contains 30 out of 2499 places after structural reductions.
[2026-05-22 19:54:12] [INFO ] Flatten gal took : 216 ms
[2026-05-22 19:54:12] [INFO ] Flatten gal took : 120 ms
[2026-05-22 19:54:12] [INFO ] Input system was already deterministic with 3060 transitions.
RANDOM walk for 40000 steps (61 resets) in 1720 ms. (23 steps per ms) remains 15/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
[2026-05-22 19:54:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 353/376 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 546/922 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1455/2377 variables, 173/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2377 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 122/2499 variables, 39/266 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2499 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 3060/5559 variables, 2499/2765 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 5542ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 453 rules applied. Total rules applied 453 place count 2499 transition count 2607
Reduce places removed 453 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 456 rules applied. Total rules applied 909 place count 2046 transition count 2604
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 913 place count 2044 transition count 2602
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 915 place count 2042 transition count 2602
Performed 661 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 661 Pre rules applied. Total rules applied 915 place count 2042 transition count 1941
Deduced a syphon composed of 661 places in 3 ms
Ensure Unique test removed 62 places
Reduce places removed 723 places and 0 transitions.
Iterating global reduction 4 with 1384 rules applied. Total rules applied 2299 place count 1319 transition count 1941
Discarding 7 places :
Implicit places reduction removed 7 places
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 4 with 45 rules applied. Total rules applied 2344 place count 1312 transition count 1903
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 39 rules applied. Total rules applied 2383 place count 1274 transition count 1902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2384 place count 1273 transition count 1902
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 25 Pre rules applied. Total rules applied 2384 place count 1273 transition count 1877
Deduced a syphon composed of 25 places in 9 ms
Ensure Unique test removed 24 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 74 rules applied. Total rules applied 2458 place count 1224 transition count 1877
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2458 place count 1224 transition count 1854
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2504 place count 1201 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2505 place count 1200 transition count 1853
Iterating global reduction 7 with 1 rules applied. Total rules applied 2506 place count 1200 transition count 1853
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2507 place count 1199 transition count 1852
Iterating global reduction 7 with 1 rules applied. Total rules applied 2508 place count 1199 transition count 1852
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2509 place count 1198 transition count 1851
Iterating global reduction 7 with 1 rules applied. Total rules applied 2510 place count 1198 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2511 place count 1197 transition count 1850
Iterating global reduction 7 with 1 rules applied. Total rules applied 2512 place count 1197 transition count 1850
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 7 with 398 rules applied. Total rules applied 2910 place count 997 transition count 1652
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2914 place count 993 transition count 1648
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2919 place count 992 transition count 1648
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 2920 place count 992 transition count 1647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2921 place count 991 transition count 1647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2921 place count 991 transition count 1646
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2923 place count 990 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2925 place count 988 transition count 1644
Iterating global reduction 9 with 2 rules applied. Total rules applied 2927 place count 988 transition count 1644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2929 place count 988 transition count 1642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2930 place count 987 transition count 1642
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2932 place count 986 transition count 1647
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 2939 place count 986 transition count 1640
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 2946 place count 979 transition count 1640
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 2951 place count 979 transition count 1635
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2956 place count 974 transition count 1635
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 2962 place count 974 transition count 1635
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2963 place count 973 transition count 1634
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 13 with 16 rules applied. Total rules applied 2979 place count 962 transition count 1629
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2984 place count 957 transition count 1629
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 16 Pre rules applied. Total rules applied 2984 place count 957 transition count 1613
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 15 with 33 rules applied. Total rules applied 3017 place count 940 transition count 1613
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 15 with 6 rules applied. Total rules applied 3023 place count 934 transition count 1613
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 3023 place count 934 transition count 1612
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3025 place count 933 transition count 1612
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 22 rules applied. Total rules applied 3047 place count 922 transition count 1601
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3052 place count 917 transition count 1596
Iterating global reduction 16 with 5 rules applied. Total rules applied 3057 place count 917 transition count 1596
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 3062 place count 917 transition count 1591
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3067 place count 912 transition count 1591
Applied a total of 3067 rules in 982 ms. Remains 912 /2499 variables (removed 1587) and now considering 1591/3060 (removed 1469) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 983 ms. Remains : 912/2499 places, 1591/3060 transitions.
RANDOM walk for 40000 steps (439 resets) in 631 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 178399 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 15
Probabilistic random walk after 178399 steps, saw 40775 distinct states, run finished after 3007 ms. (steps per millisecond=59 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15488614649185820362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6960606885733213302.kers'
[2026-05-22 19:54:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15488614649185820362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6960606885733213302.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 1 ms.
// Phase 1: matrix 1591 rows 899 cols 6216 entries
Finished phase 1 with 213 SingleSign rule and 547 generalized
[2026-05-22 19:54:23] [INFO ] Computed 152 invariants in 25 ms
Computed 152 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-6960606885733213302.kers
Total runtime 27 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 163/186 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 70/256 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 4/260 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/262 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 335/597 variables, 47/72 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 82/679 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 5/684 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 112/796 variables, 31/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/796 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 50/846 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/846 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 3/849 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/849 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 53/902 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/902 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 10/912 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/912 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 1591/2503 variables, 912/1064 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2503 variables, 2/1066 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2503 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 0/2503 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2503/2503 variables, and 1066 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6189 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 912/912 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 163/186 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 70/256 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 4/260 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/262 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 335/597 variables, 47/72 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 82/679 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 5/684 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 112/796 variables, 31/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/796 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/796 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/796 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 50/846 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/846 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 3/849 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/849 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 53/902 variables, 10/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/902 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 10/912 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/912 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 27 (OVERLAPS) 1591/2503 variables, 912/1067 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2503 variables, 11/1078 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2503 variables, 0/1078 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 0/2503 variables, 0/1078 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2503/2503 variables, and 1078 constraints, problems are : Problem set: 4 solved, 11 unsolved in 13953 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 912/912 constraints, PredecessorRefiner: 11/15 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20201ms problems are : Problem set: 4 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 4 properties in 26075 ms.
Support contains 8 out of 912 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 912/912 places, 1591/1591 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 912 transition count 1589
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 910 transition count 1589
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4 place count 910 transition count 1581
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 902 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 901 transition count 1573
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 901 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 900 transition count 1565
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 900 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 899 transition count 1557
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 899 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 898 transition count 1549
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 898 transition count 1549
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 897 transition count 1541
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 897 transition count 1541
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 892 transition count 1536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 891 transition count 1535
Applied a total of 41 rules in 252 ms. Remains 891 /912 variables (removed 21) and now considering 1535/1591 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 891/912 places, 1535/1591 transitions.
RANDOM walk for 40000 steps (456 resets) in 420 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (74 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (73 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (69 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (73 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (68 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (73 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (71 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 240793 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 7
Probabilistic random walk after 240793 steps, saw 54508 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5618088379209129336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13027178846968335062.kers'
[2026-05-22 19:55:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5618088379209129336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13027178846968335062.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 2 ms.
// Phase 1: matrix 1535 rows 877 cols 6019 entries
Finished phase 1 with 206 SingleSign rule and 533 generalized
[2026-05-22 19:55:13] [INFO ] Computed 152 invariants in 26 ms
Computed 152 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-13027178846968335062.kers
Total runtime 30 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/106 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/107 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 175/283 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 45/328 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 27/355 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 88/443 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/443 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 48/491 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/493 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 54/547 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/547 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 14/561 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/561 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/562 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/562 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 22/584 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/584 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 39/623 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/623 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 2/625 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/625 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 53/678 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/678 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 12/690 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/690 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 52/742 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/742 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 41/783 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/783 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 1/784 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/784 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 34/818 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/818 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 12/830 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/830 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 7/837 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/837 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 46/883 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/883 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/883 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 2/885 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/885 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 1/886 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/886 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (OVERLAPS) 5/891 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/891 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (OVERLAPS) 1535/2426 variables, 891/1044 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2426 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 0/2426 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2426/2426 variables, and 1044 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6514 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 891/891 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 33/106 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/107 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 175/283 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 45/328 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 27/355 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 88/443 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/443 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 48/491 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/493 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 54/547 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/547 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 14/561 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/561 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/562 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/562 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 22/584 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/584 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 39/623 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/623 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 2/625 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/625 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 53/678 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/678 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 12/690 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/690 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 52/742 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/742 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 41/783 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/783 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 1/784 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/784 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 34/818 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/818 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 12/830 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/830 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 7/837 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/837 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (OVERLAPS) 46/883 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/883 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/883 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/883 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (OVERLAPS) 2/885 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/885 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 1/886 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/886 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (OVERLAPS) 5/891 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/891 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 1535/2426 variables, 891/1045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2426 variables, 7/1052 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2426 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (OVERLAPS) 0/2426 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2426/2426 variables, and 1052 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7059 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 891/891 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13664ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 10714 ms.
Support contains 7 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 1535/1535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 891 transition count 1534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 890 transition count 1534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 889 transition count 1533
Applied a total of 4 rules in 56 ms. Remains 889 /891 variables (removed 2) and now considering 1533/1535 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 889/891 places, 1533/1535 transitions.
RANDOM walk for 40000 steps (451 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (70 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (71 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (71 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (74 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 257155 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 6
Probabilistic random walk after 257155 steps, saw 57533 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12652322153925664342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8192375357803112423.kers'
[2026-05-22 19:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12652322153925664342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8192375357803112423.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 1533 rows 875 cols 6015 entries
Finished phase 1 with 204 SingleSign rule and 533 generalized
[2026-05-22 19:55:40] [INFO ] Computed 152 invariants in 13 ms
Computed 152 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8192375357803112423.kers
Total runtime 16 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/105 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 171/278 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 45/323 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 27/350 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 91/441 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 48/489 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/491 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/491 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 54/545 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/545 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 14/559 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/559 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 1/560 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/560 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 22/582 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/582 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 39/621 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/621 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 2/623 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/623 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 53/676 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/676 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 12/688 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/688 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 52/740 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/740 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 41/781 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/781 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 1/782 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/782 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 34/816 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/816 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 12/828 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/828 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 7/835 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/835 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (OVERLAPS) 46/881 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/881 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/881 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (OVERLAPS) 2/883 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/883 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (OVERLAPS) 1/884 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/884 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (OVERLAPS) 5/889 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/889 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 59 (OVERLAPS) 1533/2422 variables, 889/1043 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2422 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 61 (OVERLAPS) 0/2422 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2422/2422 variables, and 1043 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6108 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/105 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 171/278 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 45/323 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 27/350 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 91/441 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 48/489 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/491 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/491 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 54/545 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/545 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 14/559 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/559 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 1/560 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/560 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 22/582 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/582 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 39/621 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/621 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 2/623 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/623 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 53/676 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/676 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 12/688 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/688 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 52/740 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/740 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 41/781 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/781 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 1/782 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/782 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 34/816 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/816 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 12/828 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/828 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 7/835 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/835 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (OVERLAPS) 46/881 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/881 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/881 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/881 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (OVERLAPS) 2/883 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/883 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (OVERLAPS) 1/884 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/884 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 58 (OVERLAPS) 5/889 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/889 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 60 (OVERLAPS) 1533/2422 variables, 889/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2422 variables, 6/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2422 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 63 (OVERLAPS) 0/2422 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2422/2422 variables, and 1050 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7977 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14118ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 12917 ms.
Support contains 2 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 1533/1533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 889 transition count 1532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 888 transition count 1532
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 888 transition count 1529
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 884 transition count 1529
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 883 transition count 1528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 882 transition count 1528
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 19 place count 878 transition count 1525
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 878 transition count 1523
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 23 place count 876 transition count 1523
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 24 place count 875 transition count 1522
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 875 transition count 1522
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 874 transition count 1521
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 874 transition count 1520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 873 transition count 1520
Applied a total of 29 rules in 163 ms. Remains 873 /889 variables (removed 16) and now considering 1520/1533 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 873/889 places, 1520/1533 transitions.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA ASLink-PT-06b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 101 stabilizing places and 101 stable transitions
FORMULA ASLink-PT-06b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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||G(p1))))'
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2495 transition count 3049
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2495 transition count 3049
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 2492 transition count 3039
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 2492 transition count 3039
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 2490 transition count 3037
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 2490 transition count 3037
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 2488 transition count 3028
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 2488 transition count 3028
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 2486 transition count 3019
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2486 transition count 3019
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 2484 transition count 3017
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 2484 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 2482 transition count 3008
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 2482 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2481 transition count 3007
Applied a total of 36 rules in 1257 ms. Remains 2481 /2499 variables (removed 18) and now considering 3007/3060 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9451671714367724870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6565772365829483789.kers'
[2026-05-22 19:56:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9451671714367724870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6565772365829483789.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3007 rows 2481 cols 9289 entries
Finished phase 1 with 1611 SingleSign rule and 604 generalized
[2026-05-22 19:56:09] [INFO ] Computed 266 invariants in 22 ms
Computed 266 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-6565772365829483789.kers
Total runtime 24 ms.
[2026-05-22 19:56:11] [INFO ] Implicit Places using invariants in 2214 ms returned []
[2026-05-22 19:56:11] [INFO ] Invariant cache hit.
[2026-05-22 19:56:19] [INFO ] Implicit Places using invariants and state equation in 8184 ms returned []
Implicit Place search using SMT with State Equation took 10425 ms to find 0 implicit places.
Running 3006 sub problems to find dead transitions.
[2026-05-22 19:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2480/5488 variables, and 159 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 159/212 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 3006/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3006 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2480/5488 variables, and 159 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 159/212 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 0/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61213ms problems are : Problem set: 0 solved, 3006 unsolved
Search for dead transitions found 0 dead transitions in 61222ms
Starting structural reductions in LTL mode, iteration 1 : 2481/2499 places, 3007/3060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72930 ms. Remains : 2481/2499 places, 3007/3060 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||G(p1))))'
Stuttering acceptance computed with spot in 333 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 26141 steps with 43 reset in 141 ms.
FORMULA ASLink-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-01 finished in 73492 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||X((X(X(!p1)) U (p0&&X(X(!p1))))))))'
Support contains 1 out of 2499 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 464 transitions
Trivial Post-agglo rules discarded 464 transitions
Performed 464 trivial Post agglomeration. Transition count delta: 464
Iterating post reduction 0 with 464 rules applied. Total rules applied 464 place count 2498 transition count 2595
Reduce places removed 464 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 467 rules applied. Total rules applied 931 place count 2034 transition count 2592
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 933 place count 2032 transition count 2592
Performed 671 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 671 Pre rules applied. Total rules applied 933 place count 2032 transition count 1921
Deduced a syphon composed of 671 places in 3 ms
Ensure Unique test removed 63 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 3 with 1405 rules applied. Total rules applied 2338 place count 1298 transition count 1921
Discarding 6 places :
Implicit places reduction removed 6 places
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 3 with 45 rules applied. Total rules applied 2383 place count 1292 transition count 1882
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 2422 place count 1253 transition count 1882
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2422 place count 1253 transition count 1857
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 75 rules applied. Total rules applied 2497 place count 1203 transition count 1857
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2497 place count 1203 transition count 1833
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2545 place count 1179 transition count 1833
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2547 place count 1177 transition count 1824
Iterating global reduction 5 with 2 rules applied. Total rules applied 2549 place count 1177 transition count 1824
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2551 place count 1175 transition count 1815
Iterating global reduction 5 with 2 rules applied. Total rules applied 2553 place count 1175 transition count 1815
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2555 place count 1173 transition count 1806
Iterating global reduction 5 with 2 rules applied. Total rules applied 2557 place count 1173 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2559 place count 1171 transition count 1797
Iterating global reduction 5 with 2 rules applied. Total rules applied 2561 place count 1171 transition count 1797
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2562 place count 1170 transition count 1789
Iterating global reduction 5 with 1 rules applied. Total rules applied 2563 place count 1170 transition count 1789
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 2965 place count 968 transition count 1589
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2969 place count 964 transition count 1585
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2974 place count 963 transition count 1585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2975 place count 963 transition count 1584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2976 place count 962 transition count 1584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2976 place count 962 transition count 1583
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2978 place count 961 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2980 place count 959 transition count 1581
Iterating global reduction 7 with 2 rules applied. Total rules applied 2982 place count 959 transition count 1581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2984 place count 959 transition count 1579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2985 place count 958 transition count 1579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2987 place count 957 transition count 1584
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2989 place count 955 transition count 1582
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 18 rules applied. Total rules applied 3007 place count 943 transition count 1576
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3013 place count 937 transition count 1576
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 18 Pre rules applied. Total rules applied 3013 place count 937 transition count 1558
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 37 rules applied. Total rules applied 3050 place count 918 transition count 1558
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 11 with 12 rules applied. Total rules applied 3062 place count 906 transition count 1558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3062 place count 906 transition count 1557
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3064 place count 905 transition count 1557
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 36 rules applied. Total rules applied 3100 place count 887 transition count 1539
Discarding 11 places :
Symmetric choice reduction at 12 with 11 rule applications. Total rules 3111 place count 876 transition count 1528
Iterating global reduction 12 with 11 rules applied. Total rules applied 3122 place count 876 transition count 1528
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3128 place count 870 transition count 1522
Iterating global reduction 12 with 6 rules applied. Total rules applied 3134 place count 870 transition count 1522
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3140 place count 870 transition count 1516
Applied a total of 3140 rules in 799 ms. Remains 870 /2499 variables (removed 1629) and now considering 1516/3060 (removed 1544) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17784905817256238224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12982706870271652500.kers'
[2026-05-22 19:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17784905817256238224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12982706870271652500.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 1516 rows 851 cols 5907 entries
Finished phase 1 with 203 SingleSign rule and 523 generalized
[2026-05-22 19:57:22] [INFO ] Computed 144 invariants in 12 ms
Computed 144 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-12982706870271652500.kers
Total runtime 22 ms.
[2026-05-22 19:57:23] [INFO ] Implicit Places using invariants in 898 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 290, 308, 327, 377, 384, 385, 397, 400, 402, 419, 437, 457, 508, 509, 521, 522, 524, 541, 559, 579, 630, 631, 643, 644, 646, 663, 681, 701, 752, 753, 756, 767, 768, 769, 787, 808, 809, 810, 811]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 900 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 813/2499 places, 1516/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 813 transition count 1419
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 716 transition count 1419
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 194 place count 716 transition count 1387
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 65 rules applied. Total rules applied 259 place count 683 transition count 1387
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 271 place count 679 transition count 1379
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 279 place count 671 transition count 1379
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 282 place count 668 transition count 1376
Iterating global reduction 4 with 3 rules applied. Total rules applied 285 place count 668 transition count 1376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 288 place count 668 transition count 1373
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 386 place count 619 transition count 1324
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 387 place count 618 transition count 1323
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 618 transition count 1323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 392 place count 616 transition count 1324
Applied a total of 392 rules in 103 ms. Remains 616 /813 variables (removed 197) and now considering 1324/1516 (removed 192) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11461323613284187241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16680525856971160172.kers'
[2026-05-22 19:57:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11461323613284187241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16680525856971160172.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1324 rows 616 cols 5320 entries
Finished phase 1 with 185 SingleSign rule and 349 generalized
[2026-05-22 19:57:23] [INFO ] Computed 82 invariants in 13 ms
Computed 82 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-16680525856971160172.kers
Total runtime 25 ms.
[2026-05-22 19:57:24] [INFO ] Implicit Places using invariants in 639 ms returned [88, 94, 99, 174, 180, 185, 269, 275, 280, 361, 367, 372, 449, 455, 460, 537, 543, 548, 613]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 643 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 597/2499 places, 1324/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 597 transition count 1323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 596 transition count 1323
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 584 transition count 1311
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 584 transition count 1311
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 572 transition count 1299
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 572 transition count 1299
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 566 transition count 1293
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 566 transition count 1293
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 560 transition count 1287
Applied a total of 74 rules in 97 ms. Remains 560 /597 variables (removed 37) and now considering 1287/1324 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3660176184462559762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9598206207349763945.kers'
[2026-05-22 19:57:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3660176184462559762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9598206207349763945.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1287 rows 560 cols 5183 entries
Finished phase 1 with 173 SingleSign rule and 324 generalized
[2026-05-22 19:57:24] [INFO ] Computed 63 invariants in 29 ms
Computed 63 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-9598206207349763945.kers
Total runtime 32 ms.
[2026-05-22 19:57:24] [INFO ] Implicit Places using invariants in 530 ms returned []
[2026-05-22 19:57:24] [INFO ] Invariant cache hit.
[2026-05-22 19:57:25] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 560/2499 places, 1287/3060 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4269 ms. Remains : 560/2499 places, 1287/3060 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||X((X(X(!p1)) U (p0&&X(X(!p1))))))))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-06
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-06 finished in 4330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2495 transition count 3049
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2495 transition count 3049
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 2492 transition count 3039
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 2492 transition count 3039
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 2490 transition count 3037
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 2490 transition count 3037
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 2488 transition count 3028
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 2488 transition count 3028
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 2486 transition count 3019
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2486 transition count 3019
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 2484 transition count 3017
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 2484 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 2482 transition count 3008
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 2482 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2481 transition count 3007
Applied a total of 36 rules in 1170 ms. Remains 2481 /2499 variables (removed 18) and now considering 3007/3060 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12114117030447748848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3587055973632437017.kers'
[2026-05-22 19:57:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12114117030447748848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3587055973632437017.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3007 rows 2481 cols 9289 entries
Finished phase 1 with 1611 SingleSign rule and 604 generalized
[2026-05-22 19:57:27] [INFO ] Computed 266 invariants in 22 ms
Computed 266 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-3587055973632437017.kers
Total runtime 28 ms.
[2026-05-22 19:57:28] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2026-05-22 19:57:28] [INFO ] Invariant cache hit.
[2026-05-22 19:57:36] [INFO ] Implicit Places using invariants and state equation in 7676 ms returned []
Implicit Place search using SMT with State Equation took 9304 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 2481/2499 places, 3007/3060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10477 ms. Remains : 2481/2499 places, 3007/3060 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 800 ms.
Product exploration explored 100000 steps with 50000 reset in 716 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Detected a total of 101/2481 stabilizing places and 101/3007 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 15 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 58 ms.
FORMULA ASLink-PT-06b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06b-LTLFireability-09 finished in 12262 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((p0||X(F((G(p1)||(p0&&F(p2))))))))'
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 460 transitions
Trivial Post-agglo rules discarded 460 transitions
Performed 460 trivial Post agglomeration. Transition count delta: 460
Iterating post reduction 0 with 460 rules applied. Total rules applied 460 place count 2498 transition count 2599
Reduce places removed 460 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 463 rules applied. Total rules applied 923 place count 2038 transition count 2596
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 926 place count 2036 transition count 2595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 927 place count 2035 transition count 2595
Performed 674 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 674 Pre rules applied. Total rules applied 927 place count 2035 transition count 1921
Deduced a syphon composed of 674 places in 5 ms
Ensure Unique test removed 64 places
Reduce places removed 738 places and 0 transitions.
Iterating global reduction 4 with 1412 rules applied. Total rules applied 2339 place count 1297 transition count 1921
Discarding 6 places :
Implicit places reduction removed 6 places
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 4 with 46 rules applied. Total rules applied 2385 place count 1291 transition count 1881
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2425 place count 1251 transition count 1881
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2425 place count 1251 transition count 1856
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 75 rules applied. Total rules applied 2500 place count 1201 transition count 1856
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2500 place count 1201 transition count 1832
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2548 place count 1177 transition count 1832
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2550 place count 1175 transition count 1823
Iterating global reduction 6 with 2 rules applied. Total rules applied 2552 place count 1175 transition count 1823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2552 place count 1175 transition count 1822
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2554 place count 1174 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2555 place count 1173 transition count 1814
Iterating global reduction 6 with 1 rules applied. Total rules applied 2556 place count 1173 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2557 place count 1172 transition count 1806
Iterating global reduction 6 with 1 rules applied. Total rules applied 2558 place count 1172 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2559 place count 1171 transition count 1798
Iterating global reduction 6 with 1 rules applied. Total rules applied 2560 place count 1171 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2561 place count 1170 transition count 1790
Iterating global reduction 6 with 1 rules applied. Total rules applied 2562 place count 1170 transition count 1790
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 197
Deduced a syphon composed of 197 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 6 with 396 rules applied. Total rules applied 2958 place count 971 transition count 1593
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2962 place count 967 transition count 1589
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2967 place count 966 transition count 1589
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2968 place count 966 transition count 1588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2969 place count 965 transition count 1588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2969 place count 965 transition count 1587
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2971 place count 964 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2973 place count 962 transition count 1585
Iterating global reduction 8 with 2 rules applied. Total rules applied 2975 place count 962 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2977 place count 962 transition count 1583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2978 place count 961 transition count 1583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2980 place count 960 transition count 1590
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2982 place count 958 transition count 1588
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3000 place count 946 transition count 1582
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3006 place count 940 transition count 1582
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3006 place count 940 transition count 1564
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3043 place count 921 transition count 1564
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3056 place count 908 transition count 1564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3056 place count 908 transition count 1563
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3058 place count 907 transition count 1563
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 3096 place count 888 transition count 1544
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 3108 place count 876 transition count 1532
Iterating global reduction 13 with 12 rules applied. Total rules applied 3120 place count 876 transition count 1532
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3126 place count 870 transition count 1526
Iterating global reduction 13 with 6 rules applied. Total rules applied 3132 place count 870 transition count 1526
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3138 place count 870 transition count 1520
Applied a total of 3138 rules in 699 ms. Remains 870 /2499 variables (removed 1629) and now considering 1520/3060 (removed 1540) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2811863459520399385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14179357499777040458.kers'
[2026-05-22 19:57:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2811863459520399385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14179357499777040458.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 3 ms.
// Phase 1: matrix 1520 rows 850 cols 5911 entries
Finished phase 1 with 214 SingleSign rule and 514 generalized
[2026-05-22 19:57:39] [INFO ] Computed 142 invariants in 38 ms
Computed 142 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-14179357499777040458.kers
Total runtime 42 ms.
[2026-05-22 19:57:39] [INFO ] Implicit Places using invariants in 904 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 379, 380, 392, 393, 395, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 750, 761, 762, 804, 805, 806, 807]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 919 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 815/2499 places, 1520/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 815 transition count 1422
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 717 transition count 1422
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 196 place count 717 transition count 1391
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 259 place count 685 transition count 1391
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 263 place count 681 transition count 1391
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 266 place count 678 transition count 1388
Iterating global reduction 3 with 3 rules applied. Total rules applied 269 place count 678 transition count 1388
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 272 place count 675 transition count 1385
Iterating global reduction 3 with 3 rules applied. Total rules applied 275 place count 675 transition count 1385
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 672 transition count 1382
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 672 transition count 1382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 284 place count 672 transition count 1379
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 372 place count 628 transition count 1335
Applied a total of 372 rules in 89 ms. Remains 628 /815 variables (removed 187) and now considering 1335/1520 (removed 185) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3576767480176008027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16826721760654698174.kers'
[2026-05-22 19:57:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3576767480176008027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16826721760654698174.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1335 rows 628 cols 5361 entries
Finished phase 1 with 186 SingleSign rule and 360 generalized
[2026-05-22 19:57:39] [INFO ] Computed 82 invariants in 10 ms
Computed 82 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16826721760654698174.kers
Total runtime 13 ms.
[2026-05-22 19:57:40] [INFO ] Implicit Places using invariants in 775 ms returned [88, 94, 99, 174, 180, 185, 263, 269, 274, 352, 358, 363, 440, 446, 451, 528, 534, 539, 624]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 789 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 609/2499 places, 1335/3060 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 598 transition count 1324
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 598 transition count 1324
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 587 transition count 1313
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 587 transition count 1313
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 582 transition count 1308
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 582 transition count 1308
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 575 transition count 1301
Applied a total of 68 rules in 68 ms. Remains 575 /609 variables (removed 34) and now considering 1301/1335 (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-4920997535752775973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9688711316049263208.kers'
[2026-05-22 19:57:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4920997535752775973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9688711316049263208.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1301 rows 575 cols 5233 entries
Finished phase 1 with 180 SingleSign rule and 332 generalized
[2026-05-22 19:57:40] [INFO ] Computed 63 invariants in 27 ms
Computed 63 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-9688711316049263208.kers
Total runtime 42 ms.
[2026-05-22 19:57:41] [INFO ] Implicit Places using invariants in 473 ms returned []
[2026-05-22 19:57:41] [INFO ] Invariant cache hit.
[2026-05-22 19:57:42] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 575/2499 places, 1301/3060 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4112 ms. Remains : 575/2499 places, 1301/3060 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((p0||X(F((G(p1)||(p0&&F(p2))))))))'
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 1286 reset in 319 ms.
Product exploration explored 100000 steps with 1230 reset in 294 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 15 factoid took 72 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (521 resets) in 467 ms. (85 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (89 resets) in 143 ms. (277 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
[2026-05-22 19:57:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 82/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/136 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 270/457 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/476 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 87/563 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/568 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/575 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/575 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1301/1876 variables, 575/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1876 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1876 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1876/1876 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 575/575 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) 82/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/136 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/187 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 457/1876 variables, and 34 constraints, problems are : Problem set: 1 solved, 0 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 11/18 constraints, Generalized P Invariants (flows): 23/45 constraints, State Equation: 0/575 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 733ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 16 factoid took 128 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1286 ms.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 575/575 places, 1301/1301 transitions.
Applied a total of 0 rules in 21 ms. Remains 575 /575 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2026-05-22 19:57:44] [INFO ] Invariant cache hit.
[2026-05-22 19:57:45] [INFO ] Implicit Places using invariants in 508 ms returned []
[2026-05-22 19:57:45] [INFO ] Invariant cache hit.
[2026-05-22 19:57:46] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2026-05-22 19:57:46] [INFO ] Redundant transitions in 82 ms returned []
Running 1258 sub problems to find dead transitions.
[2026-05-22 19:57:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/1876 variables, and 45 constraints, problems are : Problem set: 0 solved, 1258 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/18 constraints, Generalized P Invariants (flows): 33/45 constraints, State Equation: 0/575 constraints, PredecessorRefiner: 1258/1258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/1876 variables, and 45 constraints, problems are : Problem set: 0 solved, 1258 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/18 constraints, Generalized P Invariants (flows): 33/45 constraints, State Equation: 0/575 constraints, PredecessorRefiner: 0/1258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 1258 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62318 ms. Remains : 575/575 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 9 factoid took 53 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 30178 steps (376 resets) in 166 ms. (180 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 293 ms.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1227 reset in 237 ms.
Product exploration explored 100000 steps with 1215 reset in 263 ms.
Built C files in :
/tmp/ltsmin9872603551466355680
[2026-05-22 19:58:47] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2026-05-22 19:58:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:58:47] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2026-05-22 19:58:47] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:58:48] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2026-05-22 19:58:48] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:58:48] [INFO ] Built C files in 362ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9872603551466355680
Running compilation step : cd /tmp/ltsmin9872603551466355680;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9872603551466355680;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9872603551466355680;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 575/575 places, 1301/1301 transitions.
Applied a total of 0 rules in 37 ms. Remains 575 /575 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2026-05-22 19:58:51] [INFO ] Invariant cache hit.
[2026-05-22 19:58:51] [INFO ] Implicit Places using invariants in 624 ms returned []
[2026-05-22 19:58:51] [INFO ] Invariant cache hit.
[2026-05-22 19:58:53] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
[2026-05-22 19:58:53] [INFO ] Redundant transitions in 21 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1906 ms. Remains : 575/575 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin1116430147520710477
[2026-05-22 19:58:53] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2026-05-22 19:58:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:58:53] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2026-05-22 19:58:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:58:53] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2026-05-22 19:58:53] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:58:53] [INFO ] Built C files in 353ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1116430147520710477
Running compilation step : cd /tmp/ltsmin1116430147520710477;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1116430147520710477;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1116430147520710477;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 19:58:56] [INFO ] Flatten gal took : 39 ms
[2026-05-22 19:58:56] [INFO ] Flatten gal took : 57 ms
[2026-05-22 19:58:56] [INFO ] Time to serialize gal into /tmp/LTL13862113917466387827.gal : 16 ms
[2026-05-22 19:58:56] [INFO ] Time to serialize properties into /tmp/LTL16269067040888507858.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13862113917466387827.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2559847915544000489.hoa' '-atoms' '/tmp/LTL16269067040888507858.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16269067040888507858.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2559847915544000489.hoa
Detected timeout of ITS tools.
[2026-05-22 19:59:12] [INFO ] Flatten gal took : 37 ms
[2026-05-22 19:59:12] [INFO ] Flatten gal took : 39 ms
[2026-05-22 19:59:12] [INFO ] Time to serialize gal into /tmp/LTL7590152174080816935.gal : 10 ms
[2026-05-22 19:59:12] [INFO ] Time to serialize properties into /tmp/LTL5697816913010297759.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7590152174080816935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5697816913010297759.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(p1301==1)")||(X(F((G("(((p984==1)||(p2511==0))||(p2669==0))"))||(("(p1301==1)")&&(F("((p2511==1)&&(p2669==1))")))))))))
Formula 0 simplified : F(!"(p1301==1)" & XG(F!"(((p984==1)||(p2511==0))||(p2669==0))" & (!"(p1301==1)" | G!"((p2511==1)&&(p2669==1))")))
Detected timeout of ITS tools.
[2026-05-22 19:59:27] [INFO ] Flatten gal took : 63 ms
[2026-05-22 19:59:27] [INFO ] Applying decomposition
[2026-05-22 19:59:27] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1500417254783127853.txt' '-o' '/tmp/graph1500417254783127853.bin' '-w' '/tmp/graph1500417254783127853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1500417254783127853.bin' '-l' '-1' '-v' '-w' '/tmp/graph1500417254783127853.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:59:27] [INFO ] Decomposing Gal with order
[2026-05-22 19:59:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:59:27] [INFO ] Removed a total of 2522 redundant transitions.
[2026-05-22 19:59:27] [INFO ] Flatten gal took : 150 ms
[2026-05-22 19:59:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 40 ms.
[2026-05-22 19:59:27] [INFO ] Time to serialize gal into /tmp/LTL16258989429961919284.gal : 14 ms
[2026-05-22 19:59:27] [INFO ] Time to serialize properties into /tmp/LTL14765216644875669831.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16258989429961919284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14765216644875669831.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("(i10.u70.p1301==1)")||(X(F((G("(((i5.u64.p984==1)||(i12.i1.u129.p2511==0))||(i12.i1.u129.p2669==0))"))||(("(i10.u70.p1301==1)")...219
Formula 0 simplified : F(!"(i10.u70.p1301==1)" & XG(F!"(((i5.u64.p984==1)||(i12.i1.u129.p2511==0))||(i12.i1.u129.p2669==0))" & (!"(i10.u70.p1301==1)" | G!"...207
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06b-LTLFireability-11 finished in 124618 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)&&F(G(p1)))))'
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 2498 transition count 2597
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 465 rules applied. Total rules applied 927 place count 2036 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 929 place count 2034 transition count 2594
Performed 671 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 671 Pre rules applied. Total rules applied 929 place count 2034 transition count 1923
Deduced a syphon composed of 671 places in 5 ms
Ensure Unique test removed 64 places
Reduce places removed 735 places and 0 transitions.
Iterating global reduction 3 with 1406 rules applied. Total rules applied 2335 place count 1299 transition count 1923
Discarding 6 places :
Implicit places reduction removed 6 places
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 3 with 46 rules applied. Total rules applied 2381 place count 1293 transition count 1883
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2421 place count 1253 transition count 1883
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2421 place count 1253 transition count 1858
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 75 rules applied. Total rules applied 2496 place count 1203 transition count 1858
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2496 place count 1203 transition count 1834
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2544 place count 1179 transition count 1834
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2547 place count 1176 transition count 1824
Iterating global reduction 5 with 3 rules applied. Total rules applied 2550 place count 1176 transition count 1824
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2550 place count 1176 transition count 1823
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2552 place count 1175 transition count 1823
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2554 place count 1173 transition count 1814
Iterating global reduction 5 with 2 rules applied. Total rules applied 2556 place count 1173 transition count 1814
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2558 place count 1171 transition count 1805
Iterating global reduction 5 with 2 rules applied. Total rules applied 2560 place count 1171 transition count 1805
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2562 place count 1169 transition count 1796
Iterating global reduction 5 with 2 rules applied. Total rules applied 2564 place count 1169 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2565 place count 1168 transition count 1788
Iterating global reduction 5 with 1 rules applied. Total rules applied 2566 place count 1168 transition count 1788
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 400 rules applied. Total rules applied 2966 place count 967 transition count 1589
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2970 place count 963 transition count 1585
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2975 place count 962 transition count 1585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2976 place count 962 transition count 1584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2977 place count 961 transition count 1584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2977 place count 961 transition count 1583
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2979 place count 960 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2981 place count 958 transition count 1581
Iterating global reduction 7 with 2 rules applied. Total rules applied 2983 place count 958 transition count 1581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2985 place count 958 transition count 1579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2986 place count 957 transition count 1579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2988 place count 956 transition count 1584
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2990 place count 954 transition count 1582
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 18 rules applied. Total rules applied 3008 place count 942 transition count 1576
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3014 place count 936 transition count 1576
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 18 Pre rules applied. Total rules applied 3014 place count 936 transition count 1558
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 37 rules applied. Total rules applied 3051 place count 917 transition count 1558
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 11 with 13 rules applied. Total rules applied 3064 place count 904 transition count 1558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3064 place count 904 transition count 1557
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3066 place count 903 transition count 1557
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 3104 place count 884 transition count 1538
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 3116 place count 872 transition count 1526
Iterating global reduction 12 with 12 rules applied. Total rules applied 3128 place count 872 transition count 1526
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3134 place count 866 transition count 1520
Iterating global reduction 12 with 6 rules applied. Total rules applied 3140 place count 866 transition count 1520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3146 place count 866 transition count 1514
Applied a total of 3146 rules in 678 ms. Remains 866 /2499 variables (removed 1633) and now considering 1514/3060 (removed 1546) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17720314198362242909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4885288368843835202.kers'
[2026-05-22 19:59:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17720314198362242909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4885288368843835202.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 1514 rows 846 cols 5887 entries
Finished phase 1 with 207 SingleSign rule and 517 generalized
[2026-05-22 19:59:43] [INFO ] Computed 142 invariants in 12 ms
Computed 142 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-4885288368843835202.kers
Total runtime 14 ms.
[2026-05-22 19:59:44] [INFO ] Implicit Places using invariants in 1000 ms returned [1, 20, 21, 33, 50, 68, 88, 139, 149, 150, 152, 171, 189, 209, 260, 261, 273, 274, 276, 293, 311, 330, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 752, 763, 764, 765, 783, 804, 805, 806, 807]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 809/2499 places, 1514/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 809 transition count 1411
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 206 place count 706 transition count 1411
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 206 place count 706 transition count 1380
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 269 place count 674 transition count 1380
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 281 place count 670 transition count 1372
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 289 place count 662 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 292 place count 659 transition count 1369
Iterating global reduction 4 with 3 rules applied. Total rules applied 295 place count 659 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 298 place count 659 transition count 1366
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 394 place count 611 transition count 1318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 398 place count 609 transition count 1319
Applied a total of 398 rules in 73 ms. Remains 609 /809 variables (removed 200) and now considering 1319/1514 (removed 195) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16786026223339862821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5267418035499842864.kers'
[2026-05-22 19:59:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16786026223339862821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5267418035499842864.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1319 rows 609 cols 5305 entries
Finished phase 1 with 182 SingleSign rule and 347 generalized
[2026-05-22 19:59:44] [INFO ] Computed 80 invariants in 22 ms
Computed 80 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-5267418035499842864.kers
Total runtime 25 ms.
[2026-05-22 19:59:45] [INFO ] Implicit Places using invariants in 572 ms returned [90, 96, 101, 178, 184, 189, 266, 272, 277, 354, 360, 365, 442, 448, 453, 530, 536, 541, 606]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 585 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 590/2499 places, 1319/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 590 transition count 1318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 589 transition count 1318
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 577 transition count 1306
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 577 transition count 1306
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 565 transition count 1294
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 565 transition count 1294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 559 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 559 transition count 1288
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 553 transition count 1282
Applied a total of 74 rules in 93 ms. Remains 553 /590 variables (removed 37) and now considering 1282/1319 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9306756515749420540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16268532266106129559.kers'
[2026-05-22 19:59:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9306756515749420540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16268532266106129559.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1282 rows 553 cols 5168 entries
Finished phase 1 with 170 SingleSign rule and 322 generalized
[2026-05-22 19:59:45] [INFO ] Computed 61 invariants in 9 ms
Computed 61 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16268532266106129559.kers
Total runtime 14 ms.
[2026-05-22 19:59:45] [INFO ] Implicit Places using invariants in 463 ms returned []
[2026-05-22 19:59:45] [INFO ] Invariant cache hit.
[2026-05-22 19:59:47] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 553/2499 places, 1282/3060 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4339 ms. Remains : 553/2499 places, 1282/3060 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-12
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-12 finished in 4536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X((G(!p1) U X(p2))))))))'
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2495 transition count 3049
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2495 transition count 3049
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 2492 transition count 3039
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 2492 transition count 3039
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 2490 transition count 3037
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 2490 transition count 3037
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 2488 transition count 3028
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 2488 transition count 3028
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 2486 transition count 3019
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2486 transition count 3019
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 2484 transition count 3017
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 2484 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 2482 transition count 3008
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 2482 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2481 transition count 3007
Applied a total of 36 rules in 1251 ms. Remains 2481 /2499 variables (removed 18) and now considering 3007/3060 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11518833753465627831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16070342685952107004.kers'
[2026-05-22 19:59:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11518833753465627831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16070342685952107004.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3007 rows 2481 cols 9289 entries
Finished phase 1 with 1611 SingleSign rule and 604 generalized
[2026-05-22 19:59:48] [INFO ] Computed 266 invariants in 22 ms
Computed 266 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-16070342685952107004.kers
Total runtime 25 ms.
[2026-05-22 19:59:50] [INFO ] Implicit Places using invariants in 2060 ms returned []
[2026-05-22 19:59:50] [INFO ] Invariant cache hit.
[2026-05-22 19:59:59] [INFO ] Implicit Places using invariants and state equation in 8278 ms returned []
Implicit Place search using SMT with State Equation took 10379 ms to find 0 implicit places.
Running 3006 sub problems to find dead transitions.
[2026-05-22 19:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2480/5488 variables, and 159 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 159/212 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 3006/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3006 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2480/5488 variables, and 159 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 159/212 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 0/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61420ms problems are : Problem set: 0 solved, 3006 unsolved
Search for dead transitions found 0 dead transitions in 61433ms
Starting structural reductions in LTL mode, iteration 1 : 2481/2499 places, 3007/3060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73080 ms. Remains : 2481/2499 places, 3007/3060 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((p0||X((G(!p1) U X(p2))))))))'
Stuttering acceptance computed with spot in 525 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, p1]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 75500 steps with 124 reset in 393 ms.
FORMULA ASLink-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-14 finished in 74086 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 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 3060/3060 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 463 rules applied. Total rules applied 463 place count 2498 transition count 2596
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 466 rules applied. Total rules applied 929 place count 2035 transition count 2593
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 931 place count 2033 transition count 2593
Performed 673 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 673 Pre rules applied. Total rules applied 931 place count 2033 transition count 1920
Deduced a syphon composed of 673 places in 5 ms
Ensure Unique test removed 64 places
Reduce places removed 737 places and 0 transitions.
Iterating global reduction 3 with 1410 rules applied. Total rules applied 2341 place count 1296 transition count 1920
Discarding 6 places :
Implicit places reduction removed 6 places
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 3 with 46 rules applied. Total rules applied 2387 place count 1290 transition count 1880
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2427 place count 1250 transition count 1880
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2427 place count 1250 transition count 1855
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 75 rules applied. Total rules applied 2502 place count 1200 transition count 1855
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2502 place count 1200 transition count 1831
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2550 place count 1176 transition count 1831
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2553 place count 1173 transition count 1821
Iterating global reduction 5 with 3 rules applied. Total rules applied 2556 place count 1173 transition count 1821
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2556 place count 1173 transition count 1820
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2558 place count 1172 transition count 1820
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2560 place count 1170 transition count 1811
Iterating global reduction 5 with 2 rules applied. Total rules applied 2562 place count 1170 transition count 1811
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2564 place count 1168 transition count 1802
Iterating global reduction 5 with 2 rules applied. Total rules applied 2566 place count 1168 transition count 1802
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2568 place count 1166 transition count 1793
Iterating global reduction 5 with 2 rules applied. Total rules applied 2570 place count 1166 transition count 1793
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2571 place count 1165 transition count 1785
Iterating global reduction 5 with 1 rules applied. Total rules applied 2572 place count 1165 transition count 1785
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 5 with 398 rules applied. Total rules applied 2970 place count 965 transition count 1587
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2974 place count 961 transition count 1583
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2979 place count 960 transition count 1583
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2980 place count 960 transition count 1582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2981 place count 959 transition count 1582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2981 place count 959 transition count 1581
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2983 place count 958 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2985 place count 956 transition count 1579
Iterating global reduction 7 with 2 rules applied. Total rules applied 2987 place count 956 transition count 1579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2989 place count 956 transition count 1577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2990 place count 955 transition count 1577
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2992 place count 954 transition count 1582
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2994 place count 952 transition count 1580
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 18 rules applied. Total rules applied 3012 place count 940 transition count 1574
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3018 place count 934 transition count 1574
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 18 Pre rules applied. Total rules applied 3018 place count 934 transition count 1556
Deduced a syphon composed of 18 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 37 rules applied. Total rules applied 3055 place count 915 transition count 1556
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 11 with 13 rules applied. Total rules applied 3068 place count 902 transition count 1556
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3068 place count 902 transition count 1555
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3070 place count 901 transition count 1555
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 3108 place count 882 transition count 1536
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 3120 place count 870 transition count 1524
Iterating global reduction 12 with 12 rules applied. Total rules applied 3132 place count 870 transition count 1524
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3138 place count 864 transition count 1518
Iterating global reduction 12 with 6 rules applied. Total rules applied 3144 place count 864 transition count 1518
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3150 place count 864 transition count 1512
Applied a total of 3150 rules in 676 ms. Remains 864 /2499 variables (removed 1635) and now considering 1512/3060 (removed 1548) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3993368197964945297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16898759178778029683.kers'
[2026-05-22 20:01:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3993368197964945297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16898759178778029683.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 1512 rows 844 cols 5883 entries
Finished phase 1 with 212 SingleSign rule and 510 generalized
[2026-05-22 20:01:02] [INFO ] Computed 142 invariants in 14 ms
Computed 142 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-16898759178778029683.kers
Total runtime 21 ms.
[2026-05-22 20:01:02] [INFO ] Implicit Places using invariants in 721 ms returned [1, 18, 19, 31, 48, 66, 86, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 328, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 750, 761, 762, 763, 781, 802, 803, 804, 805]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 723 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 807/2499 places, 1512/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 807 transition count 1409
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 206 place count 704 transition count 1409
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 206 place count 704 transition count 1378
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 269 place count 672 transition count 1378
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 281 place count 668 transition count 1370
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 289 place count 660 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 292 place count 657 transition count 1367
Iterating global reduction 4 with 3 rules applied. Total rules applied 295 place count 657 transition count 1367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 298 place count 657 transition count 1364
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 394 place count 609 transition count 1316
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 398 place count 607 transition count 1317
Applied a total of 398 rules in 75 ms. Remains 607 /807 variables (removed 200) and now considering 1317/1512 (removed 195) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9156495673679939656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5469121077549635278.kers'
[2026-05-22 20:01:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9156495673679939656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5469121077549635278.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1317 rows 607 cols 5301 entries
Finished phase 1 with 187 SingleSign rule and 340 generalized
[2026-05-22 20:01:03] [INFO ] Computed 80 invariants in 41 ms
Computed 80 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-5469121077549635278.kers
Total runtime 43 ms.
[2026-05-22 20:01:03] [INFO ] Implicit Places using invariants in 597 ms returned [90, 96, 101, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 604]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 613 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 588/2499 places, 1317/3060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 1316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 587 transition count 1316
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 575 transition count 1304
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 575 transition count 1304
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 37 place count 564 transition count 1293
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 564 transition count 1293
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 559 transition count 1288
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 559 transition count 1288
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 553 transition count 1282
Applied a total of 70 rules in 74 ms. Remains 553 /588 variables (removed 35) and now considering 1282/1317 (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-6716012884833051214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1390682156498079193.kers'
[2026-05-22 20:01:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6716012884833051214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1390682156498079193.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1282 rows 553 cols 5171 entries
Finished phase 1 with 175 SingleSign rule and 317 generalized
[2026-05-22 20:01:03] [INFO ] Computed 61 invariants in 9 ms
Computed 61 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-1390682156498079193.kers
Total runtime 11 ms.
[2026-05-22 20:01:04] [INFO ] Implicit Places using invariants in 456 ms returned []
[2026-05-22 20:01:04] [INFO ] Invariant cache hit.
[2026-05-22 20:01:05] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 553/2499 places, 1282/3060 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4024 ms. Remains : 553/2499 places, 1282/3060 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 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-15
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-15 finished in 4146 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((p0||X(F((G(p1)||(p0&&F(p2))))))))'
Spot run failed in 117 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 20:01:05] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1985687030829951962
[2026-05-22 20:01:05] [INFO ] Too many transitions (3060) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:01:05] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1985687030829951962
Running compilation step : cd /tmp/ltsmin1985687030829951962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-22 20:01:05] [INFO ] Applying decomposition
[2026-05-22 20:01:06] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16838921548469882617.txt' '-o' '/tmp/graph16838921548469882617.bin' '-w' '/tmp/graph16838921548469882617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16838921548469882617.bin' '-l' '-1' '-v' '-w' '/tmp/graph16838921548469882617.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:01:06] [INFO ] Decomposing Gal with order
[2026-05-22 20:01:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:01:06] [INFO ] Removed a total of 2313 redundant transitions.
[2026-05-22 20:01:06] [INFO ] Flatten gal took : 130 ms
[2026-05-22 20:01:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 29 ms.
[2026-05-22 20:01:07] [INFO ] Time to serialize gal into /tmp/LTLFireability17091260921682313266.gal : 28 ms
[2026-05-22 20:01:07] [INFO ] Time to serialize properties into /tmp/LTLFireability3090389310401773604.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17091260921682313266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3090389310401773604.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(i15.u453.p1301==1)")||(X(F((G("(((i18.i2.i2.u339.p984==1)||(i28.u883.p2511==0))||(i28.u917.p2669==0))"))||(("(i15.u453.p1301==...217
Formula 0 simplified : F(!"(i15.u453.p1301==1)" & XG(F!"(((i18.i2.i2.u339.p984==1)||(i28.u883.p2511==0))||(i28.u917.p2669==0))" & (!"(i15.u453.p1301==1)" |...205
Compilation finished in 7556 ms.
Running link step : cd /tmp/ltsmin1985687030829951962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin1985687030829951962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true)||X(<>(([]((LTLAPp1==true))||((LTLAPp0==true)&&<>((LTLAPp2==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 20:23:55] [INFO ] Applying decomposition
[2026-05-22 20:23:55] [INFO ] Flatten gal took : 61 ms
[2026-05-22 20:23:55] [INFO ] Decomposing Gal with order
[2026-05-22 20:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:23:55] [INFO ] Removed a total of 2119 redundant transitions.
[2026-05-22 20:23:55] [INFO ] Flatten gal took : 146 ms
[2026-05-22 20:23:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 3417 labels/synchronizations in 158 ms.
[2026-05-22 20:23:56] [INFO ] Time to serialize gal into /tmp/LTLFireability15837882128925522950.gal : 30 ms
[2026-05-22 20:23:56] [INFO ] Time to serialize properties into /tmp/LTLFireability2838704173726822757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15837882128925522950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2838704173726822757.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u161.p1301==1)")||(X(F((G("(((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u442.p984==1)||(i1.i0.i0.i0.u2...318
Formula 0 simplified : F(!"(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u161.p1301==1)" & XG(F!"(((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u442.p984==1)||(i1.i0.i0.i0.u299.p...306
Detected timeout of ITS tools.
[2026-05-22 20:46:47] [INFO ] Flatten gal took : 723 ms
[2026-05-22 20:46:55] [INFO ] Input system was already deterministic with 3060 transitions.
[2026-05-22 20:46:56] [INFO ] Transformed 2499 places.
[2026-05-22 20:46:56] [INFO ] Transformed 3060 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-22 20:47:26] [INFO ] Time to serialize gal into /tmp/LTLFireability893658484157926609.gal : 78 ms
[2026-05-22 20:47:26] [INFO ] Time to serialize properties into /tmp/LTLFireability3729669488227871423.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability893658484157926609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3729669488227871423.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(p1301==1)")||(X(F((G("(((p984==1)||(p2511==0))||(p2669==0))"))||(("(p1301==1)")&&(F("((p2511==1)&&(p2669==1))")))))))))
Formula 0 simplified : F(!"(p1301==1)" & XG(F!"(((p984==1)||(p2511==0))||(p2669==0))" & (!"(p1301==1)" | G!"((p2511==1)&&(p2669==1))")))
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ASLink-PT-06b"
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 ASLink-PT-06b, 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 r002-oct2-177944366200372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06b.tgz
mv ASLink-PT-06b 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 ;
