About the Execution of ITS-Tools for FireWire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1247213.00 | 0.00 | 0.00 | FFFFFTFFFFFFFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102300308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FireWire-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102300308
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 100K May 29 14:32 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 FireWire-PT-09-LTLFireability-00
FORMULA_NAME FireWire-PT-09-LTLFireability-01
FORMULA_NAME FireWire-PT-09-LTLFireability-02
FORMULA_NAME FireWire-PT-09-LTLFireability-03
FORMULA_NAME FireWire-PT-09-LTLFireability-04
FORMULA_NAME FireWire-PT-09-LTLFireability-05
FORMULA_NAME FireWire-PT-09-LTLFireability-06
FORMULA_NAME FireWire-PT-09-LTLFireability-07
FORMULA_NAME FireWire-PT-09-LTLFireability-08
FORMULA_NAME FireWire-PT-09-LTLFireability-09
FORMULA_NAME FireWire-PT-09-LTLFireability-10
FORMULA_NAME FireWire-PT-09-LTLFireability-11
FORMULA_NAME FireWire-PT-09-LTLFireability-12
FORMULA_NAME FireWire-PT-09-LTLFireability-13
FORMULA_NAME FireWire-PT-09-LTLFireability-14
FORMULA_NAME FireWire-PT-09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748857883693
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 09:51:26] [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]
[2025-06-02 09:51:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:51:26] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2025-06-02 09:51:26] [INFO ] Transformed 130 places.
[2025-06-02 09:51:26] [INFO ] Transformed 408 transitions.
[2025-06-02 09:51:26] [INFO ] Found NUPN structural information;
[2025-06-02 09:51:26] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 352/352 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 346
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 341
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 339
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 123 transition count 328
Applied a total of 22 rules in 109 ms. Remains 123 /130 variables (removed 7) and now considering 328/352 (removed 24) transitions.
[2025-06-02 09:51:27] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
// Phase 1: matrix 302 rows 123 cols
[2025-06-02 09:51:27] [INFO ] Computed 8 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:51:27] [INFO ] Implicit Places using invariants in 473 ms returned []
[2025-06-02 09:51:27] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2025-06-02 09:51:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:51:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 09:51:28] [INFO ] Implicit Places using invariants and state equation in 653 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1202 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/130 places, 328/352 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1343 ms. Remains : 121/130 places, 328/352 transitions.
Support contains 37 out of 121 places after structural reductions.
[2025-06-02 09:51:29] [INFO ] Flatten gal took : 120 ms
[2025-06-02 09:51:29] [INFO ] Flatten gal took : 62 ms
[2025-06-02 09:51:29] [INFO ] Input system was already deterministic with 328 transitions.
Support contains 36 out of 121 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (2248 resets) in 2104 ms. (19 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40002 steps (9 resets) in 270 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (618 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (586 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (66 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (558 resets) in 132 ms. (300 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (1060 resets) in 214 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1083 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (605 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (616 resets) in 175 ms. (227 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (514 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (567 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
[2025-06-02 09:51:30] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
// Phase 1: matrix 302 rows 121 cols
[2025-06-02 09:51:30] [INFO ] Computed 6 invariants in 7 ms
[2025-06-02 09:51:30] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 96/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:31] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:31] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:31] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:31] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 301/418 variables, 117/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 42/169 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 4/422 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 174 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2731 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 96/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 301/418 variables, 117/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 42/169 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 9/178 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 4/422 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:34] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/423 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 185 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2747 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5568ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 2226 ms.
Support contains 14 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 328/328 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 325
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 119 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 119 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 118 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 117 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 116 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 115 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 112 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 112 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 111 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 108 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 36 place count 108 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 108 transition count 299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 108 transition count 299
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 47 place count 105 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 105 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 104 transition count 294
Applied a total of 50 rules in 156 ms. Remains 104 /121 variables (removed 17) and now considering 294/328 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 104/121 places, 294/328 transitions.
RANDOM walk for 40000 steps (2310 resets) in 922 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (558 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (545 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1102 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (611 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (562 resets) in 214 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (526 resets) in 267 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (512 resets) in 339 ms. (117 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 1135553 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :8 out of 9
Probabilistic random walk after 1135553 steps, saw 249648 distinct states, run finished after 3011 ms. (steps per millisecond=377 ) properties seen :8
[2025-06-02 09:51:42] [INFO ] Flow matrix only has 265 transitions (discarded 29 similar events)
// Phase 1: matrix 265 rows 104 cols
[2025-06-02 09:51:42] [INFO ] Computed 6 invariants in 3 ms
[2025-06-02 09:51:42] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/162 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/278 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 90/369 variables, 46/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 22/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/162 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/278 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/279 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/369 variables, 46/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 22/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:43] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 5 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/369 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/369 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 104 /104 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 104/104 places, 294/294 transitions.
RANDOM walk for 40000 steps (2404 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (589 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1229985 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1229985 steps, saw 273182 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2025-06-02 09:51:46] [INFO ] Flow matrix only has 265 transitions (discarded 29 similar events)
[2025-06-02 09:51:46] [INFO ] Invariant cache hit.
[2025-06-02 09:51:46] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/162 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/278 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 90/369 variables, 46/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 22/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 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
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/162 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/278 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/279 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/369 variables, 46/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 22/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/369 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 104/104 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 294/294 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-02 09:51:46] [INFO ] Flow matrix only has 265 transitions (discarded 29 similar events)
[2025-06-02 09:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:51:47] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-02 09:51:47] [INFO ] Flow matrix only has 265 transitions (discarded 29 similar events)
[2025-06-02 09:51:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:51:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:51:47] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:51:47] [INFO ] Redundant transitions in 36 ms returned []
Running 292 sub problems to find dead transitions.
[2025-06-02 09:51:47] [INFO ] Flow matrix only has 265 transitions (discarded 29 similar events)
[2025-06-02 09:51:47] [INFO ] Invariant cache hit.
[2025-06-02 09:51:47] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:49] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:49] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:49] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:50] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:51] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 21 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 265/368 variables, 103/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 40/154 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:58] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:58] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 157 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 265/368 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 40/156 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 292/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:25] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:28] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:29] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:41] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:41] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61088 ms. Remains : 104/104 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 104 vertex of which 29 / 104 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 78 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 78 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 77 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 77 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 76 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 75 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 75 transition count 134
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 75 transition count 129
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 72 transition count 128
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 72 transition count 128
Applied a total of 22 rules in 55 ms. Remains 72 /104 variables (removed 32) and now considering 128/294 (removed 166) transitions.
Running SMT prover for 1 properties.
[2025-06-02 09:52:48] [INFO ] Flow matrix only has 126 transitions (discarded 2 similar events)
// Phase 1: matrix 126 rows 72 cols
[2025-06-02 09:52:48] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:52:48] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2025-06-02 09:52:48] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 09:52:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 09:52:48] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 09:52:48] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 09:52:48] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 499 ms.
Computed a total of 17 stabilizing places and 35 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((p0 U p1)) U (X(X(p1))&&(p2||G(p3)))))))'
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 306
Applied a total of 19 rules in 26 ms. Remains 112 /121 variables (removed 9) and now considering 306/328 (removed 22) transitions.
[2025-06-02 09:52:49] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 112 cols
[2025-06-02 09:52:49] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:52:49] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-02 09:52:49] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:52:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:52:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:52:49] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 09:52:49] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:52:49] [INFO ] Invariant cache hit.
[2025-06-02 09:52:49] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:54] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:54] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:54] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:54] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 26090 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:27] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56241ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 56244ms
Starting structural reductions in LTL mode, iteration 1 : 112/121 places, 306/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56818 ms. Remains : 112/121 places, 306/328 transitions.
Stuttering acceptance computed with spot in 3193 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p1), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-09-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLFireability-00 finished in 60296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G((p1||(p2 U p3))))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Applied a total of 13 rules in 15 ms. Remains 115 /121 variables (removed 6) and now considering 312/328 (removed 16) transitions.
[2025-06-02 09:53:49] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
// Phase 1: matrix 286 rows 115 cols
[2025-06-02 09:53:49] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:53:49] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-02 09:53:49] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2025-06-02 09:53:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:53:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:53:49] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 09:53:49] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2025-06-02 09:53:49] [INFO ] Invariant cache hit.
[2025-06-02 09:53:49] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:54] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:54] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:55] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:55] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:55] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/400 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 166 constraints, problems are : Problem set: 0 solved, 311 unsolved in 25331 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/400 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 311/476 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:31] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:34] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/401 variables, and 479 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55537ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 55540ms
Starting structural reductions in LTL mode, iteration 1 : 115/121 places, 312/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56041 ms. Remains : 115/121 places, 312/328 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-09-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 226 ms.
Product exploration explored 100000 steps with 1 reset in 152 ms.
Computed a total of 12 stabilizing places and 22 stable transitions
Computed a total of 12 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR p1 p3 p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR p1 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 148 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 2870 steps (146 resets) in 20 ms. (136 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR p1 p3 p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR p1 p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 17 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 115 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 : 115/115 places, 312/312 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 110 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 110 transition count 310
Applied a total of 14 rules in 27 ms. Remains 110 /115 variables (removed 5) and now considering 310/312 (removed 2) transitions.
[2025-06-02 09:54:46] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
// Phase 1: matrix 277 rows 110 cols
[2025-06-02 09:54:46] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:54:46] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-02 09:54:46] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
[2025-06-02 09:54:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:54:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:54:47] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:54:47] [INFO ] Redundant transitions in 6 ms returned []
Running 307 sub problems to find dead transitions.
[2025-06-02 09:54:47] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
[2025-06-02 09:54:47] [INFO ] Invariant cache hit.
[2025-06-02 09:54:47] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:48] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:49] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:49] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:49] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:49] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:50] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:51] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 276/385 variables, 109/122 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 40/162 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:59] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/387 variables, and 164 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 276/385 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 307/470 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/387 variables, and 472 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/115 places, 310/312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60723 ms. Remains : 110/115 places, 310/312 transitions.
Computed a total of 10 stabilizing places and 20 stable transitions
Computed a total of 10 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 2657 steps (159 resets) in 19 ms. (132 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 239 ms.
Built C files in :
/tmp/ltsmin14366837697979233288
[2025-06-02 09:55:48] [INFO ] Computing symmetric may disable matrix : 310 transitions.
[2025-06-02 09:55:48] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:55:48] [INFO ] Computing symmetric may enable matrix : 310 transitions.
[2025-06-02 09:55:48] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:55:48] [INFO ] Computing Do-Not-Accords matrix : 310 transitions.
[2025-06-02 09:55:48] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 09:55:48] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14366837697979233288
Running compilation step : cd /tmp/ltsmin14366837697979233288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1483 ms.
Running link step : cd /tmp/ltsmin14366837697979233288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin14366837697979233288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10827661554630561979.hoa' '--buchi-type=spotba'
LTSmin run took 1020 ms.
FORMULA FireWire-PT-09-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-09-LTLFireability-01 finished in 121550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 322
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 118 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 117 transition count 320
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 114 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 114 transition count 320
Applied a total of 19 rules in 33 ms. Remains 114 /121 variables (removed 7) and now considering 320/328 (removed 8) transitions.
[2025-06-02 09:55:50] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
// Phase 1: matrix 287 rows 114 cols
[2025-06-02 09:55:50] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:55:51] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 09:55:51] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
[2025-06-02 09:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:55:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 09:55:51] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:55:51] [INFO ] Redundant transitions in 8 ms returned []
Running 317 sub problems to find dead transitions.
[2025-06-02 09:55:51] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
[2025-06-02 09:55:51] [INFO ] Invariant cache hit.
[2025-06-02 09:55:51] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:53] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:53] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:54] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:54] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:54] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:54] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:56] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 286/399 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 42/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/401 variables, and 169 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:23] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 286/399 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 42/169 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 317/486 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:34] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:34] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:49] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/401 variables, and 489 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/121 places, 320/328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60684 ms. Remains : 114/121 places, 320/328 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLFireability-02 finished in 60734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(X((p1||(G(!p1)&&p2))))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 306
Applied a total of 19 rules in 10 ms. Remains 112 /121 variables (removed 9) and now considering 306/328 (removed 22) transitions.
[2025-06-02 09:56:51] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 112 cols
[2025-06-02 09:56:51] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:56:51] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 09:56:51] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:56:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:56:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:56:52] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 09:56:52] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:56:52] [INFO ] Invariant cache hit.
[2025-06-02 09:56:52] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:56] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:57] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:57] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:57] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 25225 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:57:28] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55362ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 55363ms
Starting structural reductions in LTL mode, iteration 1 : 112/121 places, 306/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55831 ms. Remains : 112/121 places, 306/328 transitions.
Stuttering acceptance computed with spot in 675 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false]
Running random walk in product with property : FireWire-PT-09-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLFireability-03 finished in 56538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 306
Applied a total of 19 rules in 23 ms. Remains 112 /121 variables (removed 9) and now considering 306/328 (removed 22) transitions.
[2025-06-02 09:57:48] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:57:48] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-02 09:57:48] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:57:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:57:48] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 09:57:48] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:57:48] [INFO ] Invariant cache hit.
[2025-06-02 09:57:48] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:57:53] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:57:53] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:57:53] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:57:54] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 23345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:24] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53501ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 53502ms
Starting structural reductions in LTL mode, iteration 1 : 112/121 places, 306/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54082 ms. Remains : 112/121 places, 306/328 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : FireWire-PT-09-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLFireability-04 finished in 54277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(!p1)) U X(X(X(!p2)))))'
Support contains 8 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 306
Applied a total of 19 rules in 16 ms. Remains 112 /121 variables (removed 9) and now considering 306/328 (removed 22) transitions.
[2025-06-02 09:58:42] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:58:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:58:42] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-02 09:58:42] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:58:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:58:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:58:42] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 09:58:42] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:58:42] [INFO ] Invariant cache hit.
[2025-06-02 09:58:42] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:47] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:47] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:47] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:48] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 25456 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55602ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 55603ms
Starting structural reductions in LTL mode, iteration 1 : 112/121 places, 306/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56115 ms. Remains : 112/121 places, 306/328 transitions.
Stuttering acceptance computed with spot in 534 ms :[p2, p2, (AND p1 p2), p2, (AND p1 p2), (AND p1 p2), p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Running random walk in product with property : FireWire-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 212 ms.
Product exploration explored 100000 steps with 25000 reset in 257 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 11 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 448 ms :[p2, p2, p2, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
RANDOM walk for 40000 steps (2222 resets) in 341 ms. (116 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (1058 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (778 resets) in 574 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (813 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (558 resets) in 115 ms. (344 steps per ms) remains 3/4 properties
[2025-06-02 09:59:40] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:59:40] [INFO ] Invariant cache hit.
[2025-06-02 09:59:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 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, 3 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/82 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/108 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/387 variables, 108/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 39/153 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/391 variables, 4/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 158 constraints, problems are : Problem set: 2 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/77 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/108 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/387 variables, 108/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 39/153 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/154 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/391 variables, 4/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/392 variables, 1/159 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/159 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/392 variables, 0/159 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 159 constraints, problems are : Problem set: 2 solved, 1 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 833ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 108 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 108 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 108 transition count 299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 108 transition count 299
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 28 place count 105 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 105 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 104 transition count 294
Applied a total of 31 rules in 34 ms. Remains 104 /112 variables (removed 8) and now considering 294/306 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 104/112 places, 294/306 transitions.
RANDOM walk for 40000 steps (2304 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1112 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 316 steps, run visited all 1 properties in 5 ms. (steps per millisecond=63 )
Probabilistic random walk after 316 steps, saw 260 distinct states, run finished after 11 ms. (steps per millisecond=28 ) properties seen :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2)]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 138 ms :[p2, p2, p2, p2]
Support contains 6 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2025-06-02 09:59:42] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:59:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 09:59:42] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:59:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 09:59:42] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 09:59:42] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 09:59:42] [INFO ] Invariant cache hit.
[2025-06-02 09:59:42] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:48] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:48] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 25317 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55510ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 55512ms
Finished structural reductions in LTL mode , in 1 iterations and 56050 ms. Remains : 112/112 places, 306/306 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p2, p2, p2, p2]
RANDOM walk for 40000 steps (2147 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1061 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 304 steps, run visited all 1 properties in 5 ms. (steps per millisecond=60 )
Probabilistic random walk after 304 steps, saw 233 distinct states, run finished after 5 ms. (steps per millisecond=60 ) properties seen :1
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 181 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 180 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 237 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[p2, p2, p2, p2]
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 306/306 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 306
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 112 transition count 318
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 112 transition count 312
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 22 ms. Remains 112 /112 variables (removed 0) and now considering 312/306 (removed -6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:00:40] [INFO ] Redundant transitions in 3 ms returned []
Running 311 sub problems to find dead transitions.
[2025-06-02 10:00:40] [INFO ] Flow matrix only has 279 transitions (discarded 33 similar events)
// Phase 1: matrix 279 rows 112 cols
[2025-06-02 10:00:40] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 10:00:40] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:44] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:44] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:44] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:44] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:44] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:45] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:45] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:45] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:45] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:46] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Problem TDEAD291 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/390 variables, 112/128 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 41/169 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/169 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/170 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/170 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/170 constraints. Problems are: Problem set: 7 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 170 constraints, problems are : Problem set: 7 solved, 304 unsolved in 26592 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 5/112 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/390 variables, 112/128 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 41/169 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 304/473 constraints. Problems are: Problem set: 7 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:01:19] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/474 constraints. Problems are: Problem set: 7 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:01:31] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/391 variables, and 475 constraints, problems are : Problem set: 7 solved, 304 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 304/311 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56710ms problems are : Problem set: 7 solved, 304 unsolved
Search for dead transitions found 7 dead transitions in 56712ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 112/112 places, 305/306 transitions.
Graph (complete) has 594 edges and 112 vertex of which 108 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 108 /112 variables (removed 4) and now considering 305/305 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/112 places, 305/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56777 ms. Remains : 108/112 places, 305/306 transitions.
Built C files in :
/tmp/ltsmin17614490329205998377
[2025-06-02 10:01:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17614490329205998377
Running compilation step : cd /tmp/ltsmin17614490329205998377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1030 ms.
Running link step : cd /tmp/ltsmin17614490329205998377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17614490329205998377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15020962280813112920.hoa' '--buchi-type=spotba'
LTSmin run took 118 ms.
FORMULA FireWire-PT-09-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-09-LTLFireability-05 finished in 175637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U X(X(X(!p1))))))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 120 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 119 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 119 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 118 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 117 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 117 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 116 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 115 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 115 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 309
Applied a total of 16 rules in 11 ms. Remains 113 /121 variables (removed 8) and now considering 309/328 (removed 19) transitions.
[2025-06-02 10:01:38] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 113 cols
[2025-06-02 10:01:38] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:01:38] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 10:01:38] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2025-06-02 10:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:01:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:01:38] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2025-06-02 10:01:38] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2025-06-02 10:01:38] [INFO ] Invariant cache hit.
[2025-06-02 10:01:38] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:01:42] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:01:43] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:01:43] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:01:43] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 163 constraints, problems are : Problem set: 0 solved, 308 unsolved in 25253 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 308/470 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:14] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/396 variables, and 472 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55411ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 55413ms
Starting structural reductions in LTL mode, iteration 1 : 113/121 places, 309/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55866 ms. Remains : 113/121 places, 309/328 transitions.
Stuttering acceptance computed with spot in 621 ms :[p1, p1, p1, p1, p1, p1, p1, true, p1, p1, p1, p1, p1]
Running random walk in product with property : FireWire-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 14306 reset in 212 ms.
Product exploration explored 100000 steps with 14306 reset in 239 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 13 states, 18 edges and 2 AP (stutter sensitive) to 13 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 633 ms :[p1, p1, p1, p1, p1, p1, p1, true, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (2173 resets) in 171 ms. (232 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (1099 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1865 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1091 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
[2025-06-02 10:02:36] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2025-06-02 10:02:36] [INFO ] Invariant cache hit.
[2025-06-02 10:02:36] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/37 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/109 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 282/391 variables, 109/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 39/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/395 variables, 4/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 159 constraints, problems are : Problem set: 1 solved, 2 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/109 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 282/391 variables, 109/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 39/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/395 variables, 4/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 2/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 161 constraints, problems are : Problem set: 1 solved, 2 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1172ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 109 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 109 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 109 transition count 302
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 109 transition count 302
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 28 place count 106 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 106 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 105 transition count 297
Applied a total of 31 rules in 60 ms. Remains 105 /113 variables (removed 8) and now considering 297/309 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 105/113 places, 297/309 transitions.
RANDOM walk for 40000 steps (2304 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1108 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1109 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 24058 steps, run visited all 2 properties in 182 ms. (steps per millisecond=132 )
Probabilistic random walk after 24058 steps, saw 7135 distinct states, run finished after 182 ms. (steps per millisecond=132 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 13 states, 18 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 309/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2025-06-02 10:02:38] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2025-06-02 10:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:02:38] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-02 10:02:38] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2025-06-02 10:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:02:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:02:38] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2025-06-02 10:02:38] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2025-06-02 10:02:38] [INFO ] Invariant cache hit.
[2025-06-02 10:02:38] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:43] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:43] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:43] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:43] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 163 constraints, problems are : Problem set: 0 solved, 308 unsolved in 26546 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 308/470 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:17] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/396 variables, and 472 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56644ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 56645ms
Finished structural reductions in LTL mode , in 1 iterations and 57209 ms. Remains : 113/113 places, 309/309 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
RANDOM walk for 40000 steps (2217 resets) in 209 ms. (190 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (1080 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2025-06-02 10:03:36] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2025-06-02 10:03:36] [INFO ] Invariant cache hit.
[2025-06-02 10:03:36] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/109 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/391 variables, 109/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/395 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/109 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/391 variables, 109/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/395 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 112 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 112 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 112 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 111 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 108 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 108 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 108 transition count 299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 108 transition count 299
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 31 place count 105 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 105 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 104 transition count 294
Applied a total of 34 rules in 49 ms. Remains 104 /113 variables (removed 9) and now considering 294/309 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 104/113 places, 294/309 transitions.
RANDOM walk for 40000 steps (2291 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1084 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 24078 steps, run visited all 1 properties in 89 ms. (steps per millisecond=270 )
Probabilistic random walk after 24078 steps, saw 7122 distinct states, run finished after 89 ms. (steps per millisecond=270 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
Product exploration explored 100000 steps with 14304 reset in 228 ms.
Product exploration explored 100000 steps with 14349 reset in 382 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, p1, true]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 309/309 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 113 transition count 321
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 113 transition count 315
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 19 ms. Remains 113 /113 variables (removed 0) and now considering 315/309 (removed -6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:03:39] [INFO ] Redundant transitions in 4 ms returned []
Running 314 sub problems to find dead transitions.
[2025-06-02 10:03:39] [INFO ] Flow matrix only has 282 transitions (discarded 33 similar events)
// Phase 1: matrix 282 rows 113 cols
[2025-06-02 10:03:39] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 10:03:39] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:43] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:43] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:43] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:43] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:44] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:44] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:44] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:45] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:46] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Problem TDEAD294 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/15 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/394 variables, 113/128 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 41/169 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/169 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/170 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/170 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/170 constraints. Problems are: Problem set: 7 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 170 constraints, problems are : Problem set: 7 solved, 307 unsolved in 26485 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 5/113 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/15 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/394 variables, 113/128 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 41/169 constraints. Problems are: Problem set: 7 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 307/476 constraints. Problems are: Problem set: 7 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:19] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 1/477 constraints. Problems are: Problem set: 7 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:28] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/395 variables, and 478 constraints, problems are : Problem set: 7 solved, 307 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 307/314 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56614ms problems are : Problem set: 7 solved, 307 unsolved
Search for dead transitions found 7 dead transitions in 56616ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/113 places, 308/309 transitions.
Graph (complete) has 599 edges and 113 vertex of which 109 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 109 /113 variables (removed 4) and now considering 308/308 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/113 places, 308/309 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56655 ms. Remains : 109/113 places, 308/309 transitions.
Built C files in :
/tmp/ltsmin7524935484640862327
[2025-06-02 10:04:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7524935484640862327
Running compilation step : cd /tmp/ltsmin7524935484640862327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 677 ms.
Running link step : cd /tmp/ltsmin7524935484640862327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7524935484640862327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2356412332706335041.hoa' '--buchi-type=spotba'
LTSmin run took 216 ms.
FORMULA FireWire-PT-09-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-09-LTLFireability-07 finished in 178713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 306
Applied a total of 19 rules in 11 ms. Remains 112 /121 variables (removed 9) and now considering 306/328 (removed 22) transitions.
[2025-06-02 10:04:36] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 112 cols
[2025-06-02 10:04:36] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:04:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 10:04:36] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:04:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:04:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:04:37] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 10:04:37] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:04:37] [INFO ] Invariant cache hit.
[2025-06-02 10:04:37] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:41] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:42] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:42] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:42] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 27575 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:17] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57683ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 57684ms
Starting structural reductions in LTL mode, iteration 1 : 112/121 places, 306/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58088 ms. Remains : 112/121 places, 306/328 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLFireability-08
Product exploration explored 100000 steps with 4 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 471 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2137 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2329 steps, run visited all 1 properties in 9 ms. (steps per millisecond=258 )
Probabilistic random walk after 2329 steps, saw 1384 distinct states, run finished after 9 ms. (steps per millisecond=258 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2025-06-02 10:05:36] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:05:36] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 10:05:36] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:05:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:05:36] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 10:05:36] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:05:36] [INFO ] Invariant cache hit.
[2025-06-02 10:05:36] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:41] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:41] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:41] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 24933 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:14] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55071ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 55073ms
Finished structural reductions in LTL mode , in 1 iterations and 55664 ms. Remains : 112/112 places, 306/306 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2217 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (13 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2329 steps, run visited all 1 properties in 9 ms. (steps per millisecond=258 )
Probabilistic random walk after 2329 steps, saw 1384 distinct states, run finished after 9 ms. (steps per millisecond=258 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 306/306 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 306
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 112 transition count 318
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 112 transition count 312
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 27 ms. Remains 112 /112 variables (removed 0) and now considering 312/306 (removed -6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:06:33] [INFO ] Redundant transitions in 3 ms returned []
Running 311 sub problems to find dead transitions.
[2025-06-02 10:06:33] [INFO ] Flow matrix only has 279 transitions (discarded 33 similar events)
// Phase 1: matrix 279 rows 112 cols
[2025-06-02 10:06:33] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 10:06:33] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:36] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:36] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:36] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:36] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:36] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:37] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:37] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:37] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:37] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:38] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD291 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/390 variables, 112/128 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 41/169 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/169 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/170 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/170 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/170 constraints. Problems are: Problem set: 7 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 170 constraints, problems are : Problem set: 7 solved, 304 unsolved in 24530 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 5/112 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/390 variables, 112/128 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 41/169 constraints. Problems are: Problem set: 7 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 304/473 constraints. Problems are: Problem set: 7 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:11] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/474 constraints. Problems are: Problem set: 7 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:21] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:24] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/391 variables, and 476 constraints, problems are : Problem set: 7 solved, 304 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 304/311 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54663ms problems are : Problem set: 7 solved, 304 unsolved
Search for dead transitions found 7 dead transitions in 54666ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 112/112 places, 305/306 transitions.
Graph (complete) has 594 edges and 112 vertex of which 108 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 108 /112 variables (removed 4) and now considering 305/305 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/112 places, 305/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54711 ms. Remains : 108/112 places, 305/306 transitions.
Built C files in :
/tmp/ltsmin16072208527150965504
[2025-06-02 10:07:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16072208527150965504
Running compilation step : cd /tmp/ltsmin16072208527150965504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 695 ms.
Running link step : cd /tmp/ltsmin16072208527150965504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16072208527150965504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased624084007821835213.hoa' '--buchi-type=spotba'
LTSmin run took 2626 ms.
FORMULA FireWire-PT-09-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-09-LTLFireability-08 finished in 174369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 306
Applied a total of 19 rules in 9 ms. Remains 112 /121 variables (removed 9) and now considering 306/328 (removed 22) transitions.
[2025-06-02 10:07:31] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 112 cols
[2025-06-02 10:07:31] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:31] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 10:07:31] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:07:31] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 10:07:31] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:07:31] [INFO ] Invariant cache hit.
[2025-06-02 10:07:31] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:35] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:35] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:35] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:35] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 18244 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:01] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:18] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 468 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48347ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 48348ms
Starting structural reductions in LTL mode, iteration 1 : 112/121 places, 306/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48777 ms. Remains : 112/121 places, 306/328 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FireWire-PT-09-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLFireability-09 finished in 48913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1)))||G(p2))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 120 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 120 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 120 transition count 325
Applied a total of 3 rules in 2 ms. Remains 120 /121 variables (removed 1) and now considering 325/328 (removed 3) transitions.
[2025-06-02 10:08:20] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
// Phase 1: matrix 299 rows 120 cols
[2025-06-02 10:08:20] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:08:20] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 10:08:20] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2025-06-02 10:08:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:08:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 10:08:20] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 10:08:20] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2025-06-02 10:08:20] [INFO ] Invariant cache hit.
[2025-06-02 10:08:20] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:23] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:23] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:23] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:24] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:24] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 298/418 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 1/419 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (OVERLAPS) 0/419 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 174 constraints, problems are : Problem set: 0 solved, 324 unsolved in 21208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 298/418 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 324/497 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:01] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/419 variables, and 498 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51307ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 51308ms
Starting structural reductions in LTL mode, iteration 1 : 120/121 places, 325/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51696 ms. Remains : 120/121 places, 325/328 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-09-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLFireability-10 finished in 51965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 111 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 109 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 109 transition count 305
Applied a total of 29 rules in 27 ms. Remains 109 /121 variables (removed 12) and now considering 305/328 (removed 23) transitions.
[2025-06-02 10:09:12] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
// Phase 1: matrix 275 rows 109 cols
[2025-06-02 10:09:12] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:09:12] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 10:09:12] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
[2025-06-02 10:09:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:09:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:09:12] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:09:12] [INFO ] Redundant transitions in 3 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-02 10:09:12] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
[2025-06-02 10:09:12] [INFO ] Invariant cache hit.
[2025-06-02 10:09:12] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:17] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:17] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:17] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:18] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:18] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 274/383 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 41/161 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 162 constraints, problems are : Problem set: 0 solved, 304 unsolved in 22951 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 274/383 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 41/161 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 304/465 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:47] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:03] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/384 variables, and 467 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/109 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53089ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 53091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/121 places, 305/328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53859 ms. Remains : 109/121 places, 305/328 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-09-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLFireability-11 finished in 53984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 322
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 118 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 117 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 117 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 116 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 116 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 115 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 115 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 114 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 114 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 113 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 113 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 112 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 112 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 111 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 111 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 110 transition count 304
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 107 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 107 transition count 304
Applied a total of 33 rules in 23 ms. Remains 107 /121 variables (removed 14) and now considering 304/328 (removed 24) transitions.
[2025-06-02 10:10:06] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
// Phase 1: matrix 271 rows 107 cols
[2025-06-02 10:10:06] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:10:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 10:10:06] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
[2025-06-02 10:10:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:10:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:10:06] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:10:06] [INFO ] Redundant transitions in 2 ms returned []
Running 301 sub problems to find dead transitions.
[2025-06-02 10:10:06] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
[2025-06-02 10:10:06] [INFO ] Invariant cache hit.
[2025-06-02 10:10:06] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:08] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:08] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:08] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:08] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:09] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:10] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 270/376 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:16] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/377 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/378 variables, and 160 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 270/376 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 301/460 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:46] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:47] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/378 variables, and 463 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/121 places, 304/328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60541 ms. Remains : 107/121 places, 304/328 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 67 ms.
Product exploration explored 100000 steps with 1 reset in 82 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2359 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (545 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17646 steps, run visited all 1 properties in 41 ms. (steps per millisecond=430 )
Probabilistic random walk after 17646 steps, saw 5216 distinct states, run finished after 41 ms. (steps per millisecond=430 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 304/304 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-06-02 10:11:07] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
[2025-06-02 10:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 10:11:07] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
[2025-06-02 10:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:11:07] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:11:07] [INFO ] Redundant transitions in 3 ms returned []
Running 301 sub problems to find dead transitions.
[2025-06-02 10:11:07] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
[2025-06-02 10:11:07] [INFO ] Invariant cache hit.
[2025-06-02 10:11:07] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:09] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:09] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:09] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:09] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:09] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:10] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 270/376 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:17] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/377 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/378 variables, and 160 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 270/376 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 301/460 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:49] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:49] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:59] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/378 variables, and 463 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60635 ms. Remains : 107/107 places, 304/304 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 36740 steps (2120 resets) in 124 ms. (293 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 3 reset in 129 ms.
Built C files in :
/tmp/ltsmin16747928472012624857
[2025-06-02 10:12:08] [INFO ] Computing symmetric may disable matrix : 304 transitions.
[2025-06-02 10:12:08] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 10:12:08] [INFO ] Computing symmetric may enable matrix : 304 transitions.
[2025-06-02 10:12:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 10:12:08] [INFO ] Computing Do-Not-Accords matrix : 304 transitions.
[2025-06-02 10:12:08] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 10:12:08] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16747928472012624857
Running compilation step : cd /tmp/ltsmin16747928472012624857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1331 ms.
Running link step : cd /tmp/ltsmin16747928472012624857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16747928472012624857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2328583580775524277.hoa' '--buchi-type=spotba'
LTSmin run took 901 ms.
FORMULA FireWire-PT-09-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-09-LTLFireability-12 finished in 124844 ms.
All properties solved by simple procedures.
Total runtime 1244426 ms.
BK_STOP 1748859130906
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="FireWire-PT-09"
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-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-09, 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 r086-smll-174860102300308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 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 ;