About the Execution of ITS-Tools for FireWire-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFFFFFFTFF?FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102300340.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-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102300340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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 153K 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-13-LTLFireability-00
FORMULA_NAME FireWire-PT-13-LTLFireability-01
FORMULA_NAME FireWire-PT-13-LTLFireability-02
FORMULA_NAME FireWire-PT-13-LTLFireability-03
FORMULA_NAME FireWire-PT-13-LTLFireability-04
FORMULA_NAME FireWire-PT-13-LTLFireability-05
FORMULA_NAME FireWire-PT-13-LTLFireability-06
FORMULA_NAME FireWire-PT-13-LTLFireability-07
FORMULA_NAME FireWire-PT-13-LTLFireability-08
FORMULA_NAME FireWire-PT-13-LTLFireability-09
FORMULA_NAME FireWire-PT-13-LTLFireability-10
FORMULA_NAME FireWire-PT-13-LTLFireability-11
FORMULA_NAME FireWire-PT-13-LTLFireability-12
FORMULA_NAME FireWire-PT-13-LTLFireability-13
FORMULA_NAME FireWire-PT-13-LTLFireability-14
FORMULA_NAME FireWire-PT-13-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748874013392
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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 14:20:15] [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 14:20:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 14:20:15] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2025-06-02 14:20:15] [INFO ] Transformed 205 places.
[2025-06-02 14:20:15] [INFO ] Transformed 610 transitions.
[2025-06-02 14:20:15] [INFO ] Found NUPN structural information;
[2025-06-02 14:20:15] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-13-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 199 transition count 530
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 199 transition count 530
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 199 transition count 527
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 196 transition count 518
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 196 transition count 518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 194 transition count 514
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 194 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 193 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 193 transition count 511
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 193 transition count 505
Applied a total of 33 rules in 123 ms. Remains 193 /205 variables (removed 12) and now considering 505/542 (removed 37) transitions.
[2025-06-02 14:20:16] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
// Phase 1: matrix 473 rows 193 cols
[2025-06-02 14:20:16] [INFO ] Computed 10 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:20:16] [INFO ] Implicit Places using invariants in 606 ms returned []
[2025-06-02 14:20:16] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
[2025-06-02 14:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:20:17] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-02 14:20:17] [INFO ] Implicit Places using invariants and state equation in 892 ms returned [21, 81, 142]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1555 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/205 places, 505/542 transitions.
Applied a total of 0 rules in 16 ms. Remains 190 /190 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1718 ms. Remains : 190/205 places, 505/542 transitions.
Support contains 45 out of 190 places after structural reductions.
[2025-06-02 14:20:18] [INFO ] Flatten gal took : 100 ms
[2025-06-02 14:20:18] [INFO ] Flatten gal took : 56 ms
[2025-06-02 14:20:18] [INFO ] Input system was already deterministic with 505 transitions.
RANDOM walk for 40000 steps (1183 resets) in 3902 ms. (10 steps per ms) remains 12/36 properties
BEST_FIRST walk for 40004 steps (15 resets) in 448 ms. (89 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (61 resets) in 336 ms. (118 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (229 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (240 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (209 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (244 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (225 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (251 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (262 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (255 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (246 resets) in 113 ms. (350 steps per ms) remains 10/11 properties
[2025-06-02 14:20:20] [INFO ] Flow matrix only has 473 transitions (discarded 32 similar events)
// Phase 1: matrix 473 rows 190 cols
[2025-06-02 14:20:20] [INFO ] Computed 7 invariants in 11 ms
[2025-06-02 14:20:20] [INFO ] State equation strengthened by 69 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 157/171 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 6/177 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 463/640 variables, 177/184 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 65/249 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 22/662 variables, 13/262 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 3/265 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:21] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 1/266 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/663 variables, 1/267 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/663 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 267 constraints, problems are : Problem set: 1 solved, 9 unsolved in 2058 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 160/171 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:23] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6/177 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:23] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 463/640 variables, 177/187 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 65/252 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 6/258 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 22/662 variables, 13/271 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 3/274 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 3/277 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/662 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 1/663 variables, 1/278 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 278 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7190ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 505/505 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 190 transition count 502
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 190 transition count 500
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 188 transition count 500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 186 transition count 496
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 186 transition count 496
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 184 transition count 490
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 184 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 182 transition count 486
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 182 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 181 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 181 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 180 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 180 transition count 481
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 178 transition count 479
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 33 place count 175 transition count 485
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 39 place count 175 transition count 479
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 42 place count 175 transition count 476
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 175 transition count 482
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 172 transition count 476
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 172 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 171 transition count 469
Applied a total of 61 rules in 176 ms. Remains 171 /190 variables (removed 19) and now considering 469/505 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 171/190 places, 469/505 transitions.
RANDOM walk for 40000 steps (1250 resets) in 1453 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (38 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (275 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (245 resets) in 125 ms. (317 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (257 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (269 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (269 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (259 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (266 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (273 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
[2025-06-02 14:20:28] [INFO ] Flow matrix only has 432 transitions (discarded 37 similar events)
// Phase 1: matrix 432 rows 171 cols
[2025-06-02 14:20:28] [INFO ] Computed 7 invariants in 4 ms
[2025-06-02 14:20:28] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 143/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 420/572 variables, 152/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 64/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 27/599 variables, 16/236 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 3/602 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/603 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/603 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 242 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 143/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:29] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 420/572 variables, 152/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 64/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 27/599 variables, 16/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:32] [INFO ] Deduced a trap composed of 32 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 14:20:32] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:32] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 3/602 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/603 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/603 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 254 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6095 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7271ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6371 ms.
Support contains 9 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 469/469 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 468
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 2 place count 170 transition count 468
Applied a total of 2 rules in 24 ms. Remains 170 /171 variables (removed 1) and now considering 468/469 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 170/171 places, 468/469 transitions.
RANDOM walk for 40000 steps (1247 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (54 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (285 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (280 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (292 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (262 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (275 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (292 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (259 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 422486 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :3 out of 8
Probabilistic random walk after 422486 steps, saw 112729 distinct states, run finished after 3010 ms. (steps per millisecond=140 ) properties seen :3
[2025-06-02 14:20:45] [INFO ] Flow matrix only has 431 transitions (discarded 37 similar events)
// Phase 1: matrix 431 rows 170 cols
[2025-06-02 14:20:45] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 14:20:45] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 420/572 variables, 152/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 64/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 27/599 variables, 16/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/601 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 241 constraints, problems are : Problem set: 0 solved, 5 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 420/572 variables, 152/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 64/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 27/599 variables, 16/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:47] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/601 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/601 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 247 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2840ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1394 ms.
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 468/468 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 170/170 places, 468/468 transitions.
RANDOM walk for 40000 steps (1303 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (40 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (297 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (262 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (274 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (283 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 409732 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 5
Probabilistic random walk after 409732 steps, saw 109513 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2025-06-02 14:20:52] [INFO ] Flow matrix only has 431 transitions (discarded 37 similar events)
[2025-06-02 14:20:52] [INFO ] Invariant cache hit.
[2025-06-02 14:20:52] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 420/572 variables, 152/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 64/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 27/599 variables, 16/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/601 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 241 constraints, problems are : Problem set: 0 solved, 5 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 420/572 variables, 152/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 64/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 27/599 variables, 16/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:54] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/601 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:20:55] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 248 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3760ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1011 ms.
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 468/468 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 170/170 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 468/468 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2025-06-02 14:20:57] [INFO ] Flow matrix only has 431 transitions (discarded 37 similar events)
[2025-06-02 14:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:20:57] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-02 14:20:57] [INFO ] Flow matrix only has 431 transitions (discarded 37 similar events)
[2025-06-02 14:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:20:58] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-02 14:20:58] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:20:58] [INFO ] Redundant transitions in 41 ms returned []
Running 462 sub problems to find dead transitions.
[2025-06-02 14:20:58] [INFO ] Flow matrix only has 431 transitions (discarded 37 similar events)
[2025-06-02 14:20:58] [INFO ] Invariant cache hit.
[2025-06-02 14:20:58] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:02] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:02] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:02] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:02] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:04] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:04] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:04] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:05] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:05] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:06] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:06] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 23 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 431/601 variables, 170/188 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 64/252 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:20] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:23] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:24] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:25] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:25] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:25] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:21:25] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 7/259 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/601 variables, and 259 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 431/601 variables, 170/195 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 64/259 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 462/721 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 721 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61545 ms. Remains : 170/170 places, 468/468 transitions.
FORMULA FireWire-PT-13-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA FireWire-PT-13-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 49 stabilizing places and 114 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' '!(X((G(p0)&&X(G((p1&&X(p2)))))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 185 transition count 493
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 185 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 183 transition count 488
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 183 transition count 488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 181 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 181 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 179 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 179 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 177 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 177 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 175 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 175 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 173 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 173 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 171 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 171 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 169 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 169 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 168 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 168 transition count 453
Applied a total of 44 rules in 27 ms. Remains 168 /190 variables (removed 22) and now considering 453/505 (removed 52) transitions.
[2025-06-02 14:21:59] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
// Phase 1: matrix 421 rows 168 cols
[2025-06-02 14:21:59] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:22:00] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-02 14:22:00] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2025-06-02 14:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:22:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-02 14:22:00] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2025-06-02 14:22:00] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2025-06-02 14:22:00] [INFO ] Invariant cache hit.
[2025-06-02 14:22:00] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:07] [INFO ] Deduced a trap composed of 57 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:07] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:07] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:07] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:07] [INFO ] Deduced a trap composed of 35 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 14:22:09] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:09] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:09] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 420/588 variables, 168/183 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/589 variables, and 243 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 420/588 variables, 168/183 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 452/695 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:22:52] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/589 variables, and 696 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 168/190 places, 453/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61074 ms. Remains : 168/190 places, 453/505 transitions.
Stuttering acceptance computed with spot in 433 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-00 finished in 61600 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(p1)&&F(G(p2)))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 189 transition count 501
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 6 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 184 transition count 497
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 182 transition count 491
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 180 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 481
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 167 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 167 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 166 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 166 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 52 place count 163 transition count 451
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 58 place count 160 transition count 457
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 64 place count 160 transition count 451
Applied a total of 64 rules in 101 ms. Remains 160 /190 variables (removed 30) and now considering 451/505 (removed 54) transitions.
[2025-06-02 14:23:01] [INFO ] Flow matrix only has 412 transitions (discarded 39 similar events)
// Phase 1: matrix 412 rows 160 cols
[2025-06-02 14:23:01] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:23:01] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 14:23:01] [INFO ] Flow matrix only has 412 transitions (discarded 39 similar events)
[2025-06-02 14:23:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:23:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:23:02] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:23:02] [INFO ] Redundant transitions in 10 ms returned []
Running 444 sub problems to find dead transitions.
[2025-06-02 14:23:02] [INFO ] Flow matrix only has 412 transitions (discarded 39 similar events)
[2025-06-02 14:23:02] [INFO ] Invariant cache hit.
[2025-06-02 14:23:02] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:04] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:05] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:05] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:05] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:06] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:06] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:07] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:07] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 411/571 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:21] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:21] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:26] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/572 variables, and 238 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 411/571 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 444/682 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:23:48] [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 14:23:57] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/572 variables, and 684 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/190 places, 451/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61168 ms. Remains : 160/190 places, 451/505 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-01 finished in 61441 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((X(X(p0))&&(X(X(p1)) U (G(!p0)||(!p0&&F(!p2))))))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 186 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 184 transition count 490
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 184 transition count 490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 182 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 180 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 180 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 178 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 176 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 176 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 174 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 174 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 172 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 171 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 171 transition count 460
Applied a total of 38 rules in 28 ms. Remains 171 /190 variables (removed 19) and now considering 460/505 (removed 45) transitions.
[2025-06-02 14:24:02] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
// Phase 1: matrix 428 rows 171 cols
[2025-06-02 14:24:02] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:24:03] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-02 14:24:03] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2025-06-02 14:24:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:24:03] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-02 14:24:04] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 14:24:04] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2025-06-02 14:24:04] [INFO ] Invariant cache hit.
[2025-06-02 14:24:04] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:13] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:13] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:13] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:13] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:14] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:14] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:15] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:15] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 427/598 variables, 171/186 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 61/247 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:24] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:24:25] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/599 variables, and 249 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 427/598 variables, 171/188 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 61/249 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 459/708 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 708 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 171/190 places, 460/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61739 ms. Remains : 171/190 places, 460/505 transitions.
Stuttering acceptance computed with spot in 934 ms :[true, (NOT p0), (AND p0 p2 (NOT p1)), (AND p0 p2), (OR (NOT p1) p0), (NOT p0), false, false, (AND (NOT p0) (NOT p1)), false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-02 finished in 62771 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 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 189 transition count 501
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 494
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 479
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 471
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 464
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 464
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 456
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 456
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 442
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 442
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 156 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 72 place count 153 transition count 427
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 78 place count 150 transition count 433
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 84 place count 150 transition count 427
Applied a total of 84 rules in 108 ms. Remains 150 /190 variables (removed 40) and now considering 427/505 (removed 78) transitions.
[2025-06-02 14:25:05] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 150 cols
[2025-06-02 14:25:05] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:25:05] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-02 14:25:05] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2025-06-02 14:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:25:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 14:25:06] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:25:06] [INFO ] Redundant transitions in 8 ms returned []
Running 420 sub problems to find dead transitions.
[2025-06-02 14:25:06] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2025-06-02 14:25:06] [INFO ] Invariant cache hit.
[2025-06-02 14:25:06] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:09] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:10] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:10] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:10] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:10] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:11] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:11] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:12] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:28] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:29] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/538 variables, and 223 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/167 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/643 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:25:52] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 644 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in SI_LTL mode, iteration 1 : 150/190 places, 427/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61289 ms. Remains : 150/190 places, 427/505 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-05 finished in 61356 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))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 189 transition count 501
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 6 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 494
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 484
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 166 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 166 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 163 transition count 451
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 58 place count 160 transition count 457
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 64 place count 160 transition count 451
Applied a total of 64 rules in 63 ms. Remains 160 /190 variables (removed 30) and now considering 451/505 (removed 54) transitions.
[2025-06-02 14:26:07] [INFO ] Flow matrix only has 412 transitions (discarded 39 similar events)
// Phase 1: matrix 412 rows 160 cols
[2025-06-02 14:26:07] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:26:07] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-06-02 14:26:07] [INFO ] Flow matrix only has 412 transitions (discarded 39 similar events)
[2025-06-02 14:26:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:26:07] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:26:07] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:26:07] [INFO ] Redundant transitions in 5 ms returned []
Running 444 sub problems to find dead transitions.
[2025-06-02 14:26:07] [INFO ] Flow matrix only has 412 transitions (discarded 39 similar events)
[2025-06-02 14:26:07] [INFO ] Invariant cache hit.
[2025-06-02 14:26:07] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:11] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:11] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:11] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:12] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:12] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:12] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:12] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:14] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 411/571 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:28] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:26:29] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/572 variables, and 237 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 411/571 variables, 160/177 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 444/681 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/572 variables, and 681 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/190 places, 451/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61124 ms. Remains : 160/190 places, 451/505 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-07 finished in 61189 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) U (F(p0) U G(p1))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 184 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 184 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 181 transition count 483
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 181 transition count 483
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 178 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 178 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 175 transition count 468
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 175 transition count 468
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 172 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 172 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 169 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 169 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 166 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 166 transition count 446
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 163 transition count 440
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 163 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 161 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 161 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 160 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 160 transition count 434
Applied a total of 60 rules in 28 ms. Remains 160 /190 variables (removed 30) and now considering 434/505 (removed 71) transitions.
[2025-06-02 14:27:08] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 160 cols
[2025-06-02 14:27:08] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:27:08] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-02 14:27:08] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:27:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 14:27:09] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2025-06-02 14:27:09] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:27:09] [INFO ] Invariant cache hit.
[2025-06-02 14:27:09] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:27:16] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:27:16] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:27:16] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:27:17] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:27:17] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:27:18] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:27: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/160 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/231 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/562 variables, and 231 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 57/58 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/231 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 433/664 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/562 variables, and 664 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 57/58 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Starting structural reductions in LTL mode, iteration 1 : 160/190 places, 434/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61238 ms. Remains : 160/190 places, 434/505 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-08 finished in 61485 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(X(p0))) U p1)&&(!(G(p0)&&!p2) U p3)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 184 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 184 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 181 transition count 483
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 181 transition count 483
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 178 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 178 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 175 transition count 468
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 175 transition count 468
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 172 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 172 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 169 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 169 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 166 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 166 transition count 446
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 163 transition count 440
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 163 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 161 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 161 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 160 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 160 transition count 434
Applied a total of 60 rules in 32 ms. Remains 160 /190 variables (removed 30) and now considering 434/505 (removed 71) transitions.
[2025-06-02 14:28:09] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:28:09] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-02 14:28:09] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:28:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 14:28:10] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2025-06-02 14:28:10] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:28:10] [INFO ] Invariant cache hit.
[2025-06-02 14:28:10] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:15] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:16] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:16] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:16] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:16] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:17] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:17] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/231 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 433 unsolved
SMT process timed out in 30177ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 30178ms
Starting structural reductions in LTL mode, iteration 1 : 160/190 places, 434/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31025 ms. Remains : 160/190 places, 434/505 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p3) (NOT p1)), p0, (NOT p3), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : FireWire-PT-13-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-09 finished in 31356 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(p0)&&(!p1 U (G(!p1)||(!p1&&(!p2||G(!p3))))))))'
Support contains 8 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 184 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 184 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 181 transition count 483
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 181 transition count 483
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 178 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 178 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 175 transition count 468
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 175 transition count 468
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 172 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 172 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 169 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 169 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 166 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 166 transition count 446
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 163 transition count 440
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 163 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 161 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 161 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 160 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 160 transition count 434
Applied a total of 60 rules in 23 ms. Remains 160 /190 variables (removed 30) and now considering 434/505 (removed 71) transitions.
[2025-06-02 14:28:41] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:28:41] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 14:28:41] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:28:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 14:28:41] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2025-06-02 14:28:41] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2025-06-02 14:28:41] [INFO ] Invariant cache hit.
[2025-06-02 14:28:41] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:48] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:48] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:49] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:49] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:49] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:50] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:28:50] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/231 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 433 unsolved
SMT process timed out in 30232ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 30235ms
Starting structural reductions in LTL mode, iteration 1 : 160/190 places, 434/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30898 ms. Remains : 160/190 places, 434/505 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 p3), p3]
Running random walk in product with property : FireWire-PT-13-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 585 ms.
Product exploration explored 100000 steps with 33333 reset in 317 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 23 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-13-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-13-LTLFireability-10 finished in 32205 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((X(p1)&&p0))&&X((F(p2) U (p3 U X(!p3))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 186 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 184 transition count 490
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 184 transition count 490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 182 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 180 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 180 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 178 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 176 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 176 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 174 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 174 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 172 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 170 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 170 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 169 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 169 transition count 455
Applied a total of 42 rules in 25 ms. Remains 169 /190 variables (removed 21) and now considering 455/505 (removed 50) transitions.
[2025-06-02 14:29:13] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
// Phase 1: matrix 423 rows 169 cols
[2025-06-02 14:29:13] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:29:13] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-02 14:29:13] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
[2025-06-02 14:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:29:13] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-02 14:29:13] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 454 sub problems to find dead transitions.
[2025-06-02 14:29:13] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
[2025-06-02 14:29:13] [INFO ] Invariant cache hit.
[2025-06-02 14:29:13] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:22] [INFO ] Deduced a trap composed of 58 places in 262 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:22] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:22] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:22] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:24] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:24] [INFO ] Deduced a trap composed of 35 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 14:29:25] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:25] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 422/591 variables, 169/184 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 454 unsolved
SMT process timed out in 30267ms, After SMT, problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 30268ms
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 455/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30949 ms. Remains : 169/190 places, 455/505 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1)), p3, (NOT p1), p3, (AND (NOT p2) p3), (NOT p2)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-11
Stuttering criterion allowed to conclude after 10 steps with 3 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-11 finished in 31401 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 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 189 transition count 501
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 6 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 494
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 479
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 471
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 464
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 464
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 456
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 456
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 158 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 158 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 68 place count 155 transition count 431
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 0 with 6 rules applied. Total rules applied 74 place count 152 transition count 437
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 80 place count 152 transition count 431
Applied a total of 80 rules in 87 ms. Remains 152 /190 variables (removed 38) and now considering 431/505 (removed 74) transitions.
[2025-06-02 14:29:44] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
// Phase 1: matrix 392 rows 152 cols
[2025-06-02 14:29:44] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:29:44] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-06-02 14:29:44] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2025-06-02 14:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:29:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 14:29:45] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:29:45] [INFO ] Redundant transitions in 4 ms returned []
Running 424 sub problems to find dead transitions.
[2025-06-02 14:29:45] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2025-06-02 14:29:45] [INFO ] Invariant cache hit.
[2025-06-02 14:29:45] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:48] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:49] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:49] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:49] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:49] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:50] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:29:50] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 391/543 variables, 152/166 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:06] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:06] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 7.0 4.0))
(t1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/544 variables, and 224 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 391/543 variables, 152/168 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 424/648 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:28] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:29] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/544 variables, and 650 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in SI_LTL mode, iteration 1 : 152/190 places, 431/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61027 ms. Remains : 152/190 places, 431/505 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-12 finished in 61093 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((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 184 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 184 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 181 transition count 483
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 181 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 179 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 179 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 177 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 177 transition count 473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 176 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 176 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 175 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 175 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 174 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 174 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 173 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 173 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 172 transition count 462
Applied a total of 36 rules in 24 ms. Remains 172 /190 variables (removed 18) and now considering 462/505 (removed 43) transitions.
[2025-06-02 14:30:45] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
// Phase 1: matrix 430 rows 172 cols
[2025-06-02 14:30:45] [INFO ] Computed 7 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:30:45] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 14:30:45] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2025-06-02 14:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:30:46] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-02 14:30:46] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-02 14:30:46] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2025-06-02 14:30:46] [INFO ] Invariant cache hit.
[2025-06-02 14:30:46] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:54] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:54] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:54] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:55] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:56] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:56] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:57] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:30:57] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/601 variables, 172/187 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/248 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:31:06] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/602 variables, and 249 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/601 variables, 172/188 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 461/710 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/602 variables, and 710 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 172/190 places, 462/505 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60857 ms. Remains : 172/190 places, 462/505 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-13
Product exploration explored 100000 steps with 3 reset in 147 ms.
Product exploration explored 100000 steps with 1 reset in 606 ms.
Computed a total of 31 stabilizing places and 71 stable transitions
Computed a total of 31 stabilizing places and 71 stable transitions
Detected a total of 31/172 stabilizing places and 71/462 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p0 p1 p3 p2))), (X (AND p3 p2)), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 148 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (1152 resets) in 1342 ms. (29 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (21 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 68 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (18 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (22 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (25 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (25 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 270335 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 23
Probabilistic random walk after 270335 steps, saw 65424 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-02 14:31:51] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2025-06-02 14:31:51] [INFO ] Invariant cache hit.
[2025-06-02 14:31:51] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf17 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 50/158 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:31:52] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 418/576 variables, 158/166 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 58/224 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/224 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 25/601 variables, 14/238 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 3/241 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1/602 variables, 1/242 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 242 constraints, problems are : Problem set: 4 solved, 19 unsolved in 3703 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 19 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: 4 solved, 19 unsolved
Problem apf2 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 50/158 variables, 4/7 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:31:55] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:31:55] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/10 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 418/576 variables, 158/168 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 58/226 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 8/234 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:31:57] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 1/235 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/235 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem apf18 is UNSAT
At refinement iteration 12 (OVERLAPS) 25/601 variables, 14/249 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 3/252 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 8/260 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/601 variables, 0/260 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 1/602 variables, 1/261 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/602 variables, 0/261 constraints. Problems are: Problem set: 7 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 261 constraints, problems are : Problem set: 7 solved, 16 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 16/23 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8777ms problems are : Problem set: 7 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 462/462 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 172 transition count 459
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 172 transition count 456
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 9 place count 169 transition count 456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 167 transition count 454
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 19 place count 164 transition count 460
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 25 place count 164 transition count 454
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 28 place count 164 transition count 451
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 164 transition count 457
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 40 place count 161 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 161 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 160 transition count 444
Applied a total of 47 rules in 111 ms. Remains 160 /172 variables (removed 12) and now considering 444/462 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 160/172 places, 444/462 transitions.
RANDOM walk for 40000 steps (1266 resets) in 701 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (23 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (24 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (26 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (24 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (29 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 320272 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 16
Probabilistic random walk after 320272 steps, saw 85951 distinct states, run finished after 3005 ms. (steps per millisecond=106 ) properties seen :0
[2025-06-02 14:32:04] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2025-06-02 14:32:04] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 14:32:04] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/566 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/567 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 227 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2699 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/566 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:08] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/567 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:10] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 4 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/567 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:11] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 23 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/567 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 0/567 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 246 constraints, problems are : Problem set: 0 solved, 16 unsolved in 6441 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9158ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2025-06-02 14:32:13] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-06-02 14:32:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:32:13] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-06-02 14:32:13] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-06-02 14:32:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:32:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:32:14] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:32:14] [INFO ] Redundant transitions in 7 ms returned []
Running 438 sub problems to find dead transitions.
[2025-06-02 14:32:14] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-06-02 14:32:14] [INFO ] Invariant cache hit.
[2025-06-02 14:32:14] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:17] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:17] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:17] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:17] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:18] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:19] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:19] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:20] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 33 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/567 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:32] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:36] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:37] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:37] [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 14:32:37] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:40] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:41] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:44] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 18 ms to minimize.
SMT process timed out in 30345ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 30347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31340 ms. Remains : 160/160 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 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 134 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
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 14 place count 133 transition count 289
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 15 place count 133 transition count 288
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 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 53 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 16 properties.
[2025-06-02 14:32:44] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2025-06-02 14:32:44] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:32:45] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 14:32:45] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:32:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 14:32:46] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:46] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2025-06-02 14:32:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:46] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:46] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:46] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:47] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 11 ms to minimize.
[2025-06-02 14:32:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 593 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:47] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
[2025-06-02 14:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:48] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 18 ms to minimize.
[2025-06-02 14:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
TRAPS : Iteration 3
[2025-06-02 14:32:49] [INFO ] After 3463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2025-06-02 14:32:49] [INFO ] After 4093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 4660 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p0 p1 p3 p2))), (X (AND p3 p2)), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR p1 p3 (NOT p0)) (OR p1 p2 (NOT p0)))), (G (OR (NOT p1) (NOT p3) (NOT p2))), (G (OR p1 p2)), (G (OR p1 p2 (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p3) (NOT p2) (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 48 factoid took 234 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[false, false, false]
Stuttering acceptance computed with spot in 117 ms :[false, false, false]
Support contains 3 out of 172 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 : 172/172 places, 462/462 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 171 transition count 458
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 166 transition count 456
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 0 with 6 rules applied. Total rules applied 16 place count 163 transition count 462
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 22 place count 163 transition count 456
Applied a total of 22 rules in 31 ms. Remains 163 /172 variables (removed 9) and now considering 456/462 (removed 6) transitions.
[2025-06-02 14:32:50] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2025-06-02 14:32:50] [INFO ] Computed 7 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:32:50] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-02 14:32:50] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2025-06-02 14:32:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:32:50] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:32:50] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:32:50] [INFO ] Redundant transitions in 7 ms returned []
Running 449 sub problems to find dead transitions.
[2025-06-02 14:32:50] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2025-06-02 14:32:50] [INFO ] Invariant cache hit.
[2025-06-02 14:32:50] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:54] [INFO ] Deduced a trap composed of 57 places in 258 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:54] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:54] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:54] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:55] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:55] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:56] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:56] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:32:56] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:33:13] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:33:14] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:33:16] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/580 variables, and 242 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 449/691 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 691 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/172 places, 456/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61023 ms. Remains : 163/172 places, 456/462 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[false, false, false]
RANDOM walk for 40000 steps (1295 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (270 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (290 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (290 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (285 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 426933 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 4
Probabilistic random walk after 426933 steps, saw 101039 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2025-06-02 14:33:54] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2025-06-02 14:33:54] [INFO ] Invariant cache hit.
[2025-06-02 14:33:54] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/578 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/578 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/579 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:33:56] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/579 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:33:56] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 4 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/579 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/579 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/580 variables, and 236 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1826 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2483ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 21 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 159/163 places, 443/456 transitions.
RANDOM walk for 40000 steps (1265 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (272 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (279 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (266 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 417827 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 4
Probabilistic random walk after 417827 steps, saw 111472 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2025-06-02 14:34:00] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2025-06-02 14:34:00] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 14:34:00] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/564 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 226 constraints, problems are : Problem set: 0 solved, 4 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:01] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 11/564 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/565 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/565 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 231 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 368 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2025-06-02 14:34:02] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2025-06-02 14:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:34:02] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-02 14:34:02] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2025-06-02 14:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:34:03] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:34:03] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:34:03] [INFO ] Redundant transitions in 7 ms returned []
Running 437 sub problems to find dead transitions.
[2025-06-02 14:34:03] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2025-06-02 14:34:03] [INFO ] Invariant cache hit.
[2025-06-02 14:34:03] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:07] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:07] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:07] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:07] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:07] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:09] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:09] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:10] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:10] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (OVERLAPS) 406/565 variables, 159/175 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:20] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:21] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:23] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:24] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:24] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:24] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:29] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 242 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:34:37] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/183 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 437/680 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:01] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:02] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61195 ms. Remains : 159/159 places, 443/443 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 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 133 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
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 14 place count 132 transition count 288
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 15 place count 132 transition count 287
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 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 49 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2025-06-02 14:35:03] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2025-06-02 14:35:03] [INFO ] Computed 7 invariants in 11 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:35:04] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 14:35:04] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:35:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 14:35:04] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:04] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
[2025-06-02 14:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2025-06-02 14:35:04] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-02 14:35:04] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 974 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[false, false, false]
Stuttering acceptance computed with spot in 146 ms :[false, false, false]
Stuttering acceptance computed with spot in 145 ms :[false, false, false]
Product exploration explored 100000 steps with 1 reset in 120 ms.
Product exploration explored 100000 steps with 1 reset in 562 ms.
Built C files in :
/tmp/ltsmin7109372518212626958
[2025-06-02 14:35:06] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2025-06-02 14:35:06] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:35:06] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2025-06-02 14:35:06] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:35:06] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2025-06-02 14:35:06] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:35:06] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7109372518212626958
Running compilation step : cd /tmp/ltsmin7109372518212626958;'/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 2227 ms.
Running link step : cd /tmp/ltsmin7109372518212626958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 291 ms.
Running LTSmin : cd /tmp/ltsmin7109372518212626958;'/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/stateBased10270565952383020955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 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 162 transition count 455
Applied a total of 2 rules in 16 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2025-06-02 14:35:21] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2025-06-02 14:35:21] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:35:21] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-02 14:35:21] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2025-06-02 14:35:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:35:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:35:22] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:35:22] [INFO ] Redundant transitions in 5 ms returned []
Running 448 sub problems to find dead transitions.
[2025-06-02 14:35:22] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2025-06-02 14:35:22] [INFO ] Invariant cache hit.
[2025-06-02 14:35:22] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:25] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:25] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:25] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:26] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:27] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:27] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:28] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:28] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/177 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:40] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:42] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:35:43] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/578 variables, and 240 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/180 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 448/688 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:36:06] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 689 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60909 ms. Remains : 162/163 places, 455/456 transitions.
Built C files in :
/tmp/ltsmin12305334035434077062
[2025-06-02 14:36:22] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2025-06-02 14:36:22] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:36:22] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2025-06-02 14:36:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:36:22] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2025-06-02 14:36:22] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:36:22] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12305334035434077062
Running compilation step : cd /tmp/ltsmin12305334035434077062;'/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 1672 ms.
Running link step : cd /tmp/ltsmin12305334035434077062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12305334035434077062;'/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/stateBased16724400021902645009.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 14:36:37] [INFO ] Flatten gal took : 37 ms
[2025-06-02 14:36:37] [INFO ] Flatten gal took : 34 ms
[2025-06-02 14:36:37] [INFO ] Time to serialize gal into /tmp/LTL5394936450765446803.gal : 7 ms
[2025-06-02 14:36:37] [INFO ] Time to serialize properties into /tmp/LTL11849643523996328703.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5394936450765446803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2793893892264869144.hoa' '-atoms' '/tmp/LTL11849643523996328703.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11849643523996328703.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2793893892264869144.hoa
Detected timeout of ITS tools.
[2025-06-02 14:36:52] [INFO ] Flatten gal took : 29 ms
[2025-06-02 14:36:52] [INFO ] Flatten gal took : 42 ms
[2025-06-02 14:36:52] [INFO ] Time to serialize gal into /tmp/LTL10858497236166125176.gal : 9 ms
[2025-06-02 14:36:52] [INFO ] Time to serialize properties into /tmp/LTL11401091213811459774.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10858497236166125176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11401091213811459774.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((p3==1)&&(p93==1))")))U(!("((p3==1)&&(p161==1))"))))||(F(X((G("((p3==0)||(p161==0))"))&&("(p83==0)")))))))
Formula 0 simplified : G((FG"((p3==1)&&(p93==1))" U !"((p3==1)&&(p161==1))") & XG(!"(p83==0)" | F!"((p3==0)||(p161==0))"))
Detected timeout of ITS tools.
[2025-06-02 14:37:07] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:37:07] [INFO ] Applying decomposition
[2025-06-02 14:37:07] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10353474100779116886.txt' '-o' '/tmp/graph10353474100779116886.bin' '-w' '/tmp/graph10353474100779116886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10353474100779116886.bin' '-l' '-1' '-v' '-w' '/tmp/graph10353474100779116886.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:37:07] [INFO ] Decomposing Gal with order
[2025-06-02 14:37:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:37:08] [INFO ] Removed a total of 675 redundant transitions.
[2025-06-02 14:37:08] [INFO ] Flatten gal took : 115 ms
[2025-06-02 14:37:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 28 ms.
[2025-06-02 14:37:08] [INFO ] Time to serialize gal into /tmp/LTL11606461525132764326.gal : 11 ms
[2025-06-02 14:37:08] [INFO ] Time to serialize properties into /tmp/LTL17360335061710432748.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11606461525132764326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17360335061710432748.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i0.u0.p3==1)&&(i0.u1.p93==1))")))U(!("((i0.u0.p3==1)&&(i0.u0.p161==1))"))))||(F(X((G("((i0.u0.p3==0)||(i0.u0.p161==0))...185
Formula 0 simplified : G((FG"((i0.u0.p3==1)&&(i0.u1.p93==1))" U !"((i0.u0.p3==1)&&(i0.u0.p161==1))") & XG(!"(i4.u22.p83==0)" | F!"((i0.u0.p3==0)||(i0.u0.p1...165
Detected timeout of ITS tools.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 397587 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 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 189 transition count 501
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 494
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 479
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 471
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 471
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 464
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 464
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 456
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 456
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 442
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 442
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 156 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 72 place count 153 transition count 427
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 0 with 6 rules applied. Total rules applied 78 place count 150 transition count 433
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 84 place count 150 transition count 427
Applied a total of 84 rules in 83 ms. Remains 150 /190 variables (removed 40) and now considering 427/505 (removed 78) transitions.
[2025-06-02 14:37:23] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 150 cols
[2025-06-02 14:37:23] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:37:23] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-02 14:37:23] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2025-06-02 14:37:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:37:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 14:37:24] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:37:24] [INFO ] Redundant transitions in 6 ms returned []
Running 420 sub problems to find dead transitions.
[2025-06-02 14:37:24] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2025-06-02 14:37:24] [INFO ] Invariant cache hit.
[2025-06-02 14:37:24] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:27] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:27] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:28] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:28] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:28] [INFO ] Deduced a trap composed of 33 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 14:37:29] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:29] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:30] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:44] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:37:44] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/538 variables, and 223 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/167 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/643 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:09] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 644 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 150/190 places, 427/505 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61296 ms. Remains : 150/190 places, 427/505 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : FireWire-PT-13-LTLFireability-15
Product exploration explored 100000 steps with 3 reset in 388 ms.
Product exploration explored 100000 steps with 2 reset in 119 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 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 :[p0]
RANDOM walk for 31531 steps (992 resets) in 289 ms. (108 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F 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 46 ms :[p0]
Stuttering acceptance computed with spot in 46 ms :[p0]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 427/427 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2025-06-02 14:38:25] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2025-06-02 14:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:38:25] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-02 14:38:25] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2025-06-02 14:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:38:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 14:38:26] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:38:26] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2025-06-02 14:38:26] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2025-06-02 14:38:26] [INFO ] Invariant cache hit.
[2025-06-02 14:38:26] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:28] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:29] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:29] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:29] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:29] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:30] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:30] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:31] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:43] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:44] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/538 variables, and 223 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/167 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/643 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:11] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 644 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60983 ms. Remains : 150/150 places, 427/427 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 53 ms :[p0]
RANDOM walk for 40000 steps (1277 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 250 steps, run visited all 1 properties in 12 ms. (steps per millisecond=20 )
Probabilistic random walk after 250 steps, saw 192 distinct states, run finished after 21 ms. (steps per millisecond=11 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 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 44 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
Product exploration explored 100000 steps with 1 reset in 103 ms.
Product exploration explored 100000 steps with 5 reset in 124 ms.
Built C files in :
/tmp/ltsmin1313689130264218186
[2025-06-02 14:39:27] [INFO ] Computing symmetric may disable matrix : 427 transitions.
[2025-06-02 14:39:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:39:27] [INFO ] Computing symmetric may enable matrix : 427 transitions.
[2025-06-02 14:39:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:39:27] [INFO ] Computing Do-Not-Accords matrix : 427 transitions.
[2025-06-02 14:39:27] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:39:27] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1313689130264218186
Running compilation step : cd /tmp/ltsmin1313689130264218186;'/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 1570 ms.
Running link step : cd /tmp/ltsmin1313689130264218186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1313689130264218186;'/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/stateBased7254380299702652428.hoa' '--buchi-type=spotba'
LTSmin run took 1692 ms.
FORMULA FireWire-PT-13-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-13-LTLFireability-15 finished in 127556 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((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Found a Shortening insensitive property : FireWire-PT-13-LTLFireability-13
Stuttering acceptance computed with spot in 369 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 505/505 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 189 transition count 501
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 494
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 486
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 479
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 172 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 172 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 171 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 171 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 170 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 170 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 169 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 169 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 168 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 166 transition count 456
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 0 with 6 rules applied. Total rules applied 52 place count 163 transition count 462
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 55 place count 163 transition count 459
Applied a total of 55 rules in 68 ms. Remains 163 /190 variables (removed 27) and now considering 459/505 (removed 46) transitions.
[2025-06-02 14:39:31] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
// Phase 1: matrix 420 rows 163 cols
[2025-06-02 14:39:31] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:39:31] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-02 14:39:31] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2025-06-02 14:39:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:39:32] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:39:32] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2025-06-02 14:39:32] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2025-06-02 14:39:32] [INFO ] Invariant cache hit.
[2025-06-02 14:39:32] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:35] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:35] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:36] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:36] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:37] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:37] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:38] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:38] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:41] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 419/582 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:54] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:54] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 452 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 Real declared 582/583 variables, and 241 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:06] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 419/582 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 60/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 452/694 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:22] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:23] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 696 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in LI_LTL mode, iteration 1 : 163/190 places, 459/505 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61178 ms. Remains : 163/190 places, 459/505 transitions.
Running random walk in product with property : FireWire-PT-13-LTLFireability-13
Product exploration explored 100000 steps with 1 reset in 184 ms.
Product exploration explored 100000 steps with 1 reset in 217 ms.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Detected a total of 25/163 stabilizing places and 65/459 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p0 p1 p3 p2))), (X (AND p3 p2)), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 266 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 458 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (1263 resets) in 825 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (29 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (22 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (26 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (29 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (35 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 289001 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 23
Probabilistic random walk after 289001 steps, saw 70310 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-06-02 14:40:37] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2025-06-02 14:40:37] [INFO ] Invariant cache hit.
[2025-06-02 14:40:37] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf17 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 366/471 variables, 105/108 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 40/148 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/148 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 100/571 variables, 51/199 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 3/202 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/222 constraints. Problems are: Problem set: 4 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/222 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 10/581 variables, 6/228 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/229 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 1/582 variables, 1/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/582 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/583 variables, and 230 constraints, problems are : Problem set: 4 solved, 19 unsolved in 2129 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 19 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: 4 solved, 19 unsolved
Problem apf2 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 366/471 variables, 105/108 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 40/148 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/148 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem apf18 is UNSAT
At refinement iteration 6 (OVERLAPS) 100/571 variables, 51/199 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 3/202 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/222 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 16/238 constraints. Problems are: Problem set: 7 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:40] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 1/239 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/239 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 10/581 variables, 6/245 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 1/246 constraints. Problems are: Problem set: 7 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:42] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 1/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 0/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 1/582 variables, 1/248 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/582 variables, 0/248 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 0/582 variables, 0/248 constraints. Problems are: Problem set: 7 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/583 variables, and 248 constraints, problems are : Problem set: 7 solved, 16 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/23 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7159ms problems are : Problem set: 7 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 459/459 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 163 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 160 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 160 transition count 444
Applied a total of 27 rules in 48 ms. Remains 160 /163 variables (removed 3) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 160/163 places, 444/459 transitions.
RANDOM walk for 40000 steps (1273 resets) in 505 ms. (79 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (26 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 247416 steps, run timeout after 3003 ms. (steps per millisecond=82 ) properties seen :0 out of 16
Probabilistic random walk after 247416 steps, saw 69585 distinct states, run finished after 3003 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-02 14:40:47] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2025-06-02 14:40:47] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 14:40:47] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/566 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/567 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 227 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/566 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:53] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/567 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:55] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 3 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/567 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 0/567 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 245 constraints, problems are : Problem set: 0 solved, 16 unsolved in 7669 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10754ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2025-06-02 14:40:58] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-06-02 14:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:40:58] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-02 14:40:58] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-06-02 14:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:40:59] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:40:59] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:40:59] [INFO ] Redundant transitions in 4 ms returned []
Running 438 sub problems to find dead transitions.
[2025-06-02 14:40:59] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2025-06-02 14:40:59] [INFO ] Invariant cache hit.
[2025-06-02 14:40:59] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:02] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:02] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:03] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:03] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:03] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:04] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:04] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:06] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 33 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/567 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:15] [INFO ] Deduced a trap composed of 40 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 14:41:17] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:18] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:18] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:18] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:21] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:21] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:24] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 243 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/567 variables, 160/183 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 438/681 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 681 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61160 ms. Remains : 160/160 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 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 3 place count 134 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
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 14 place count 133 transition count 289
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 15 place count 133 transition count 288
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 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 42 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 16 properties.
[2025-06-02 14:41:59] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2025-06-02 14:41:59] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:42:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 14:42:00] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:42:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 14:42:00] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:01] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:01] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
[2025-06-02 14:42:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:01] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:01] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:01] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:01] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 7 ms to minimize.
[2025-06-02 14:42:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 574 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2025-06-02 14:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:02] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 11 ms to minimize.
[2025-06-02 14:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
TRAPS : Iteration 3
[2025-06-02 14:42:03] [INFO ] After 3188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2025-06-02 14:42:03] [INFO ] After 3711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 4028 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p0 p1 p3 p2))), (X (AND p3 p2)), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR p1 p3 (NOT p0)) (OR p1 p2 (NOT p0)))), (G (OR (NOT p1) (NOT p3) (NOT p2))), (G (OR p1 p2)), (G (OR p1 p2 (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p3) (NOT p2) (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 48 factoid took 211 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[false, false, false]
Stuttering acceptance computed with spot in 115 ms :[false, false, false]
Support contains 3 out of 163 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 : 163/163 places, 459/459 transitions.
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 3 place count 163 transition count 456
Applied a total of 3 rules in 17 ms. Remains 163 /163 variables (removed 0) and now considering 456/459 (removed 3) transitions.
[2025-06-02 14:42:04] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2025-06-02 14:42:04] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:42:04] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-02 14:42:04] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2025-06-02 14:42:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:42:04] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:42:05] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:42:05] [INFO ] Redundant transitions in 7 ms returned []
Running 449 sub problems to find dead transitions.
[2025-06-02 14:42:05] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2025-06-02 14:42:05] [INFO ] Invariant cache hit.
[2025-06-02 14:42:05] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:08] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:08] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:08] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:09] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:10] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:10] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:10] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:11] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:11] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:28] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:28] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:32] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/580 variables, and 242 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 449/691 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:05] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 692 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/163 places, 456/459 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61203 ms. Remains : 163/163 places, 456/459 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[false, false, false]
RANDOM walk for 40000 steps (1284 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (265 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (282 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (270 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (284 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 427104 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 4
Probabilistic random walk after 427104 steps, saw 101076 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2025-06-02 14:43:09] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2025-06-02 14:43:09] [INFO ] Invariant cache hit.
[2025-06-02 14:43:09] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/578 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/578 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/579 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:10] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/579 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:10] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 5 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/579 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/579 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/580 variables, and 236 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1819 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 335 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 35 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 159/163 places, 443/456 transitions.
RANDOM walk for 40000 steps (1300 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (290 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (298 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (288 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (269 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 388701 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 4
Probabilistic random walk after 388701 steps, saw 104057 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2025-06-02 14:43:14] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2025-06-02 14:43:14] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 14:43:14] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/564 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 226 constraints, problems are : Problem set: 0 solved, 4 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:15] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 11/564 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/565 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/565 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 231 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2025-06-02 14:43:16] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2025-06-02 14:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:17] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-02 14:43:17] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2025-06-02 14:43:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:43:17] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:43:17] [INFO ] Redundant transitions in 4 ms returned []
Running 437 sub problems to find dead transitions.
[2025-06-02 14:43:17] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2025-06-02 14:43:17] [INFO ] Invariant cache hit.
[2025-06-02 14:43:17] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:20] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:20] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:21] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:21] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:21] [INFO ] Deduced a trap composed of 32 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 14:43:23] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:23] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:23] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:24] [INFO ] Deduced a trap composed of 50 places in 264 ms of which 32 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (OVERLAPS) 406/565 variables, 159/175 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:34] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:35] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:37] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:38] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:38] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:38] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:44] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 242 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:50] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/183 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 437/680 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:08] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:08] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61019 ms. Remains : 159/159 places, 443/443 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 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 133 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
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 14 place count 132 transition count 288
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 15 place count 132 transition count 287
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 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 32 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2025-06-02 14:44:17] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2025-06-02 14:44:17] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:44:17] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 14:44:18] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 14:44:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 14:44:18] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
[2025-06-02 14:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 1
[2025-06-02 14:44:18] [INFO ] After 456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-02 14:44:18] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 901 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 168 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[false, false, false]
Stuttering acceptance computed with spot in 121 ms :[false, false, false]
Stuttering acceptance computed with spot in 117 ms :[false, false, false]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 2 reset in 129 ms.
Built C files in :
/tmp/ltsmin8232791496523834914
[2025-06-02 14:44:19] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2025-06-02 14:44:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:44:19] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2025-06-02 14:44:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:44:19] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2025-06-02 14:44:19] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:44:19] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8232791496523834914
Running compilation step : cd /tmp/ltsmin8232791496523834914;'/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 1555 ms.
Running link step : cd /tmp/ltsmin8232791496523834914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin8232791496523834914;'/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/stateBased9464383811051445790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 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 2 place count 162 transition count 455
Applied a total of 2 rules in 13 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2025-06-02 14:44:34] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2025-06-02 14:44:34] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:44:34] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 14:44:34] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2025-06-02 14:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:44:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 14:44:35] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:44:35] [INFO ] Redundant transitions in 7 ms returned []
Running 448 sub problems to find dead transitions.
[2025-06-02 14:44:35] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2025-06-02 14:44:35] [INFO ] Invariant cache hit.
[2025-06-02 14:44:35] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:38] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:38] [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 14:44:38] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:39] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:40] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:40] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:41] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:41] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/177 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:53] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:55] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:56] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 3.0 4.0))
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 1.0)
(t9 0.0)
(t10 1.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 1.0)
(t19 0.0)
(t20 0.0)
(t21 4.0)
(t22 0.0)
(t23 0.0)
(t24 (/ 3.0 2.0))
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 1.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 1.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 7.0)
(t40 1.0)
(t41 1.0)
(t42 1.0)
(t44 1.0)
(t45 0.0)
(t46 1.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 (/ 3.0 4.0))
(t103 (/ 1.0 4.0))
(t104 0.0)
(t105 0.0)
(t106 1.0)
(t107 0.0)
(t108 (/ 3.0 4.0))
(t109 (/ 1.0 4.0))
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 2.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 2.0)
(t118 (/ 3.0 4.0))
(t119 (/ 5.0 4.0))
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 (/ 3.0 4.0))
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 1.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 (/ 3.0 4.0))
(t175 (/ 5.0 4.0))
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 2.0)
(t180 (/ 3.0 4.0))
(t181 0.0)
(t182 (/ 1.0 4.0))
(t183 0.0)
(t184 (/ 3.0 4.0))
(t185 0.0)
(t186 (/ 1.0 4.0))
(t187 0.0)
(t188 0.0)
(t189 1.0)
(t190 0.0)
(t191 1.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 (/ 3.0 4.0))
(t290 (/ 23.0 4.0))
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 5.0)
(t295 (/ 3.0 4.0))
(t296 0.0)
(t297 (/ 17.0 4.0))
(t298 1.0)
(t299 (/ 3.0 4.0))
(t300 (/ 17.0 4.0))timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/578 variables, and 240 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/180 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 448/688 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:21] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 689 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60333ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61014 ms. Remains : 162/163 places, 455/456 transitions.
Built C files in :
/tmp/ltsmin15227883347369598668
[2025-06-02 14:45:35] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2025-06-02 14:45:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:45:35] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2025-06-02 14:45:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:45:35] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2025-06-02 14:45:35] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:45:35] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15227883347369598668
Running compilation step : cd /tmp/ltsmin15227883347369598668;'/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 1596 ms.
Running link step : cd /tmp/ltsmin15227883347369598668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin15227883347369598668;'/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/stateBased14792567076656567871.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 14:45:50] [INFO ] Flatten gal took : 21 ms
[2025-06-02 14:45:50] [INFO ] Flatten gal took : 20 ms
[2025-06-02 14:45:50] [INFO ] Time to serialize gal into /tmp/LTL17488881077955568777.gal : 4 ms
[2025-06-02 14:45:50] [INFO ] Time to serialize properties into /tmp/LTL9438982650419656026.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17488881077955568777.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7343916791508179151.hoa' '-atoms' '/tmp/LTL9438982650419656026.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9438982650419656026.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7343916791508179151.hoa
Detected timeout of ITS tools.
[2025-06-02 14:46:06] [INFO ] Flatten gal took : 28 ms
[2025-06-02 14:46:06] [INFO ] Flatten gal took : 20 ms
[2025-06-02 14:46:06] [INFO ] Time to serialize gal into /tmp/LTL3920016202243020116.gal : 4 ms
[2025-06-02 14:46:06] [INFO ] Time to serialize properties into /tmp/LTL35352993078685846.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3920016202243020116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL35352993078685846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((p3==1)&&(p93==1))")))U(!("((p3==1)&&(p161==1))"))))||(F(X((G("((p3==0)||(p161==0))"))&&("(p83==0)")))))))
Formula 0 simplified : G((FG"((p3==1)&&(p93==1))" U !"((p3==1)&&(p161==1))") & XG(!"(p83==0)" | F!"((p3==0)||(p161==0))"))
Detected timeout of ITS tools.
[2025-06-02 14:46:21] [INFO ] Flatten gal took : 18 ms
[2025-06-02 14:46:21] [INFO ] Applying decomposition
[2025-06-02 14:46:21] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14684974965648283953.txt' '-o' '/tmp/graph14684974965648283953.bin' '-w' '/tmp/graph14684974965648283953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14684974965648283953.bin' '-l' '-1' '-v' '-w' '/tmp/graph14684974965648283953.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:46:21] [INFO ] Decomposing Gal with order
[2025-06-02 14:46:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:46:21] [INFO ] Removed a total of 718 redundant transitions.
[2025-06-02 14:46:21] [INFO ] Flatten gal took : 48 ms
[2025-06-02 14:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 21 ms.
[2025-06-02 14:46:21] [INFO ] Time to serialize gal into /tmp/LTL5472756417482843660.gal : 5 ms
[2025-06-02 14:46:21] [INFO ] Time to serialize properties into /tmp/LTL15376292392905349476.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5472756417482843660.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15376292392905349476.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i3.u0.p3==1)&&(i3.u29.p93==1))")))U(!("((i3.u0.p3==1)&&(i3.u1.p161==1))"))))||(F(X((G("((i3.u0.p3==0)||(i3.u1.p161==0)...186
Formula 0 simplified : G((FG"((i3.u0.p3==1)&&(i3.u29.p93==1))" U !"((i3.u0.p3==1)&&(i3.u1.p161==1))") & XG(!"(i5.u25.p83==0)" | F!"((i3.u0.p3==0)||(i3.u1.p...166
Detected timeout of ITS tools.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 425520 ms.
[2025-06-02 14:46:36] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1531559778958062478
[2025-06-02 14:46:36] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2025-06-02 14:46:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:46:36] [INFO ] Applying decomposition
[2025-06-02 14:46:36] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2025-06-02 14:46:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:46:36] [INFO ] Flatten gal took : 17 ms
[2025-06-02 14:46:36] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2025-06-02 14:46:36] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 14:46:36] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1531559778958062478
Running compilation step : cd /tmp/ltsmin1531559778958062478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18298973861166261218.txt' '-o' '/tmp/graph18298973861166261218.bin' '-w' '/tmp/graph18298973861166261218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18298973861166261218.bin' '-l' '-1' '-v' '-w' '/tmp/graph18298973861166261218.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:46:36] [INFO ] Decomposing Gal with order
[2025-06-02 14:46:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:46:36] [INFO ] Removed a total of 802 redundant transitions.
[2025-06-02 14:46:36] [INFO ] Flatten gal took : 44 ms
[2025-06-02 14:46:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 17 ms.
[2025-06-02 14:46:36] [INFO ] Time to serialize gal into /tmp/LTLFireability7571979015238503813.gal : 5 ms
[2025-06-02 14:46:36] [INFO ] Time to serialize properties into /tmp/LTLFireability6906242786764053310.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7571979015238503813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6906242786764053310.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i8.i0.u0.p3==1)&&(i8.i1.u30.p93==1))")))U(!("((i8.i0.u0.p3==1)&&(i8.i3.u51.p161==1))"))))||(F(X((G("((i8.i0.u0.p3==0)|...206
Formula 0 simplified : G((FG"((i8.i0.u0.p3==1)&&(i8.i1.u30.p93==1))" U !"((i8.i0.u0.p3==1)&&(i8.i3.u51.p161==1))") & XG(!"(i4.u26.p83==0)" | F!"((i8.i0.u0....186
Compilation finished in 1829 ms.
Running link step : cd /tmp/ltsmin1531559778958062478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1531559778958062478;'/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' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t36, t46, t49, t52, t53, t55, t61, t63, t68, t69, t73, t78, t83, t87, t95, t96, t97, t98, t10...1360
Computing Next relation with stutter on 1.34749e+06 deadlock states
Detected timeout of ITS tools.
[2025-06-02 15:15:24] [INFO ] Applying decomposition
[2025-06-02 15:15:24] [INFO ] Flatten gal took : 56 ms
[2025-06-02 15:15:24] [INFO ] Decomposing Gal with order
[2025-06-02 15:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:15:24] [INFO ] Removed a total of 655 redundant transitions.
[2025-06-02 15:15:24] [INFO ] Flatten gal took : 183 ms
[2025-06-02 15:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 23 ms.
[2025-06-02 15:15:24] [INFO ] Time to serialize gal into /tmp/LTLFireability4510931413961458235.gal : 10 ms
[2025-06-02 15:15:24] [INFO ] Time to serialize properties into /tmp/LTLFireability11722524580344372737.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4510931413961458235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11722524580344372737.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((u1.p3==1)&&(u9.p93==1))")))U(!("((u1.p3==1)&&(u13.p161==1))"))))||(F(X((G("((u1.p3==0)||(u13.p161==0))"))&&("(u8.p83==...165
Formula 0 simplified : G((FG"((u1.p3==1)&&(u9.p93==1))" U !"((u1.p3==1)&&(u13.p161==1))") & XG(!"(u8.p83==0)" | F!"((u1.p3==0)||(u13.p161==0))"))
Reverse transition relation is NOT exact ! Due to transitions t63, t85, t161, t162, t180, t194, t195, t271, t280, t315, t359, t411, t417, t423, t424, t455,...619
Computing Next relation with stutter on 1.34749e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: LTL layer: formula: <>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))
pins2lts-mc-linux64( 0/ 8), 0.047: "<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.047: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: buchi has 10 states
pins2lts-mc-linux64( 0/ 8), 0.137: There are 510 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.137: State length is 191, there are 552 groups
pins2lts-mc-linux64( 0/ 8), 0.137: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.137: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.137: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.137: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.179: [Blue] ~82 levels ~960 states ~2920 transitions
pins2lts-mc-linux64( 6/ 8), 0.207: [Blue] ~199 levels ~1920 states ~6368 transitions
pins2lts-mc-linux64( 1/ 8), 0.260: [Blue] ~188 levels ~3840 states ~10208 transitions
pins2lts-mc-linux64( 6/ 8), 0.355: [Blue] ~358 levels ~7680 states ~23448 transitions
pins2lts-mc-linux64( 6/ 8), 0.521: [Blue] ~400 levels ~15360 states ~50904 transitions
pins2lts-mc-linux64( 6/ 8), 0.849: [Blue] ~400 levels ~30720 states ~93856 transitions
pins2lts-mc-linux64( 6/ 8), 1.583: [Blue] ~424 levels ~61440 states ~213072 transitions
pins2lts-mc-linux64( 6/ 8), 3.006: [Blue] ~1464 levels ~122880 states ~449936 transitions
pins2lts-mc-linux64( 6/ 8), 5.369: [Blue] ~1720 levels ~245760 states ~957800 transitions
pins2lts-mc-linux64( 6/ 8), 9.618: [Blue] ~1720 levels ~491520 states ~2066616 transitions
pins2lts-mc-linux64( 0/ 8), 16.466: [Blue] ~1417 levels ~983040 states ~3763224 transitions
pins2lts-mc-linux64( 0/ 8), 28.546: [Blue] ~2637 levels ~1966080 states ~8096216 transitions
pins2lts-mc-linux64( 7/ 8), 52.501: [Blue] ~3324 levels ~3932160 states ~14895656 transitions
pins2lts-mc-linux64( 0/ 8), 100.135: [Blue] ~2637 levels ~7864320 states ~33423816 transitions
pins2lts-mc-linux64( 7/ 8), 195.141: [Blue] ~3324 levels ~15728640 states ~61827392 transitions
pins2lts-mc-linux64( 0/ 8), 385.547: [Blue] ~2637 levels ~31457280 states ~126064112 transitions
pins2lts-mc-linux64( 5/ 8), 771.725: [Blue] ~3076 levels ~62914560 states ~264147016 transitions
pins2lts-mc-linux64( 7/ 8), 1558.468: [Blue] ~3878 levels ~125829120 states ~558527072 transitions
pins2lts-mc-linux64( 4/ 8), 1779.594: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1779.614:
pins2lts-mc-linux64( 0/ 8), 1779.614: Explored 139853720 states 654993503 transitions, fanout: 4.683
pins2lts-mc-linux64( 0/ 8), 1779.614: Total exploration time 1779.470 sec (1779.440 sec minimum, 1779.454 sec on average)
pins2lts-mc-linux64( 0/ 8), 1779.614: States per second: 78593, Transitions per second: 368083
pins2lts-mc-linux64( 0/ 8), 1779.614:
pins2lts-mc-linux64( 0/ 8), 1779.614: State space has 134217151 states, 27 are accepting
pins2lts-mc-linux64( 0/ 8), 1779.614: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1779.614: blue states: 139853720 (104.20%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1779.614: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1779.614: all-red states: 2461 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1779.614:
pins2lts-mc-linux64( 0/ 8), 1779.614: Total memory used for local state coloring: 6.2MB
pins2lts-mc-linux64( 0/ 8), 1779.614:
pins2lts-mc-linux64( 0/ 8), 1779.614: Queue width: 8B, total height: 407554, memory: 3.11MB
pins2lts-mc-linux64( 0/ 8), 1779.614: Tree memory: 1031.8MB, 8.1 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 1779.614: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 1779.614: Stored 572 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1779.614: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1779.614: Est. total memory use: 1034.9MB (~1027.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1531559778958062478;'/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' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1531559778958062478;'/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' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-13"
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-13, 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-174860102300340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 ;