About the Execution of ITS-Tools for FireWire-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 930144.00 | 0.00 | 0.00 | FTFFFFFFFFFTFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200268.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-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K 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 89K 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-04-LTLFireability-00
FORMULA_NAME FireWire-PT-04-LTLFireability-01
FORMULA_NAME FireWire-PT-04-LTLFireability-02
FORMULA_NAME FireWire-PT-04-LTLFireability-03
FORMULA_NAME FireWire-PT-04-LTLFireability-04
FORMULA_NAME FireWire-PT-04-LTLFireability-05
FORMULA_NAME FireWire-PT-04-LTLFireability-06
FORMULA_NAME FireWire-PT-04-LTLFireability-07
FORMULA_NAME FireWire-PT-04-LTLFireability-08
FORMULA_NAME FireWire-PT-04-LTLFireability-09
FORMULA_NAME FireWire-PT-04-LTLFireability-10
FORMULA_NAME FireWire-PT-04-LTLFireability-11
FORMULA_NAME FireWire-PT-04-LTLFireability-12
FORMULA_NAME FireWire-PT-04-LTLFireability-13
FORMULA_NAME FireWire-PT-04-LTLFireability-14
FORMULA_NAME FireWire-PT-04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748847374664
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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 06:56:17] [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 06:56:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:56:17] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-06-02 06:56:17] [INFO ] Transformed 113 places.
[2025-06-02 06:56:17] [INFO ] Transformed 364 transitions.
[2025-06-02 06:56:17] [INFO ] Found NUPN structural information;
[2025-06-02 06:56:17] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 308/308 transitions.
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 6 place count 113 transition count 302
Applied a total of 6 rules in 56 ms. Remains 113 /113 variables (removed 0) and now considering 302/308 (removed 6) transitions.
[2025-06-02 06:56:18] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 113 cols
[2025-06-02 06:56:18] [INFO ] Computed 8 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:56:18] [INFO ] Implicit Places using invariants in 546 ms returned []
[2025-06-02 06:56:18] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2025-06-02 06:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:56:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 06:56:20] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned [36, 61, 106, 111]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 2023 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/113 places, 302/308 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2138 ms. Remains : 109/113 places, 302/308 transitions.
Support contains 22 out of 109 places after structural reductions.
[2025-06-02 06:56:20] [INFO ] Flatten gal took : 112 ms
[2025-06-02 06:56:20] [INFO ] Flatten gal took : 58 ms
[2025-06-02 06:56:20] [INFO ] Input system was already deterministic with 302 transitions.
Reduction of identical properties reduced properties to check from 25 to 20
RANDOM walk for 40000 steps (2268 resets) in 2146 ms. (18 steps per ms) remains 8/20 properties
BEST_FIRST walk for 40004 steps (12 resets) in 555 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (20 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (23 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (574 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (580 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1269 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
[2025-06-02 06:56:22] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 109 cols
[2025-06-02 06:56:22] [INFO ] Computed 4 invariants in 12 ms
[2025-06-02 06:56:22] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 2 (OVERLAPS) 88/103 variables, 4/19 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 88/107 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 272/375 variables, 103/210 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 38/248 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/248 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/381 variables, 4/252 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 4/256 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 1/257 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/384 variables, 2/259 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 2/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/385 variables, 1/262 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/385 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 262 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1830 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 47/57 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 47/59 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 46/103 variables, 2/61 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 46/107 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 272/375 variables, 103/210 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 38/248 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 5/253 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:24] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 1/254 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/254 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/381 variables, 4/258 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/381 variables, 4/262 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 1/263 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/381 variables, 1/264 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/381 variables, 0/264 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 3/384 variables, 2/266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 2/268 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/385 variables, 1/269 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/385 variables, 0/269 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/385 variables, 0/269 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 269 constraints, problems are : Problem set: 2 solved, 6 unsolved in 4421 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6339ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 0 properties in 2080 ms.
Support contains 10 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 302/302 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 108 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 107 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 105 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 105 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 105 transition count 295
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 105 transition count 295
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 30 place count 100 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 100 transition count 290
Applied a total of 32 rules in 113 ms. Remains 100 /109 variables (removed 9) and now considering 290/302 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 100/109 places, 290/302 transitions.
RANDOM walk for 40000 steps (2436 resets) in 584 ms. (68 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (563 resets) in 155 ms. (256 steps per ms) remains 3/5 properties
[2025-06-02 06:56:31] [INFO ] Flow matrix only has 263 transitions (discarded 27 similar events)
// Phase 1: matrix 263 rows 100 cols
[2025-06-02 06:56:31] [INFO ] Computed 4 invariants in 5 ms
[2025-06-02 06:56:31] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 47/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 42/95 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 262/357 variables, 95/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 40/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/363 variables, 5/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/363 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 245 constraints, problems are : Problem set: 0 solved, 3 unsolved in 575 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 47/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 42/95 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 262/357 variables, 95/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 40/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/363 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/363 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 248 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1141 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1749ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 460 ms.
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 290/290 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 288
Applied a total of 3 rules in 54 ms. Remains 98 /100 variables (removed 2) and now considering 288/290 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 98/100 places, 288/290 transitions.
RANDOM walk for 40000 steps (2516 resets) in 251 ms. (158 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1816 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2025-06-02 06:56:33] [INFO ] Flow matrix only has 261 transitions (discarded 27 similar events)
// Phase 1: matrix 261 rows 98 cols
[2025-06-02 06:56:33] [INFO ] Computed 4 invariants in 4 ms
[2025-06-02 06:56:33] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 47/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 216/267 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 18/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/358 variables, 46/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 46/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 22/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/359 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/359 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 334 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 47/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 216/267 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 18/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/358 variables, 46/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 46/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 22/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:34] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:34] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/359 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/359 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 808 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1162ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 288/288 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 97 transition count 290
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 97 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 97 transition count 287
Applied a total of 5 rules in 41 ms. Remains 97 /98 variables (removed 1) and now considering 287/288 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 97/98 places, 287/288 transitions.
RANDOM walk for 40000 steps (2522 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1828 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3220 steps, run visited all 2 properties in 50 ms. (steps per millisecond=64 )
Probabilistic random walk after 3220 steps, saw 1846 distinct states, run finished after 57 ms. (steps per millisecond=56 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 9 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' '!(G(F(p0)))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 105 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 105 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 102 transition count 304
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 18 place count 102 transition count 298
Applied a total of 18 rules in 74 ms. Remains 102 /109 variables (removed 7) and now considering 298/302 (removed 4) transitions.
[2025-06-02 06:56:35] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2025-06-02 06:56:35] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:56:36] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-02 06:56:36] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:56:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:56:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 06:56:36] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:56:36] [INFO ] Redundant transitions in 33 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 06:56:36] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:56:36] [INFO ] Invariant cache hit.
[2025-06-02 06:56:36] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:38] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:39] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:46] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/367 variables, and 150 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/444 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:13] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:23] [INFO ] Deduced a trap along path composed of 2 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:23] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:23] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/109 places, 298/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61229 ms. Remains : 102/109 places, 298/302 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 385 ms.
Product exploration explored 100000 steps with 4 reset in 187 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12171 steps (793 resets) in 80 ms. (150 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 16 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2025-06-02 06:57:38] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:57:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:57:38] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 06:57:38] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:57:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:57:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 06:57:39] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:57:39] [INFO ] Redundant transitions in 8 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 06:57:39] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:57:39] [INFO ] Invariant cache hit.
[2025-06-02 06:57:39] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:41] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:41] [INFO ] Deduced a trap composed of 21 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 06:57:41] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:48] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/367 variables, and 150 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/444 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:17] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:18] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:30] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:30] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:30] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60922 ms. Remains : 102/102 places, 298/298 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2315 steps (140 resets) in 14 ms. (154 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 114 ms.
Built C files in :
/tmp/ltsmin16888125791131258506
[2025-06-02 06:58:40] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2025-06-02 06:58:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:58:40] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2025-06-02 06:58:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:58:40] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2025-06-02 06:58:40] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:58:40] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16888125791131258506
Running compilation step : cd /tmp/ltsmin16888125791131258506;'/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 1300 ms.
Running link step : cd /tmp/ltsmin16888125791131258506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16888125791131258506;'/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/stateBased13269876281712329624.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2025-06-02 06:58:55] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:58:55] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-02 06:58:55] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:58:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 06:58:55] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:58:55] [INFO ] Redundant transitions in 12 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 06:58:55] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 06:58:55] [INFO ] Invariant cache hit.
[2025-06-02 06:58:55] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:58] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:06] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/367 variables, and 150 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/444 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:34] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:35] [INFO ] Deduced a trap composed of 15 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 06:59:37] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:46] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:46] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:46] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60761 ms. Remains : 102/102 places, 298/298 transitions.
Built C files in :
/tmp/ltsmin6145970890424398451
[2025-06-02 06:59:56] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2025-06-02 06:59:56] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:59:56] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2025-06-02 06:59:56] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:59:56] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2025-06-02 06:59:56] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:59:56] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6145970890424398451
Running compilation step : cd /tmp/ltsmin6145970890424398451;'/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 1131 ms.
Running link step : cd /tmp/ltsmin6145970890424398451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6145970890424398451;'/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/stateBased3603744528212921548.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 07:00:11] [INFO ] Flatten gal took : 37 ms
[2025-06-02 07:00:11] [INFO ] Flatten gal took : 34 ms
[2025-06-02 07:00:11] [INFO ] Time to serialize gal into /tmp/LTL9049470094384417662.gal : 9 ms
[2025-06-02 07:00:11] [INFO ] Time to serialize properties into /tmp/LTL8212094910924407324.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/LTL9049470094384417662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10412101093237537406.hoa' '-atoms' '/tmp/LTL8212094910924407324.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/LTL8212094910924407324.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10412101093237537406.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t12, t17, t18, t19, t22, t24, t29, t30, t31, t34, t36, t41, t42, t43, t44, t46, ...588
Computing Next relation with stutter on 15301 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1293 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.9971,203756,1,0,505,617899,620,271,6208,712253,624
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FireWire-PT-04-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FireWire-PT-04-LTLFireability-01 finished in 229958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(X(F(p1)))))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Applied a total of 2 rules in 4 ms. Remains 108 /109 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2025-06-02 07:00:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2025-06-02 07:00:25] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:00:25] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 07:00:25] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:00:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:00:26] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-02 07:00:26] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:00:26] [INFO ] Invariant cache hit.
[2025-06-02 07:00:26] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:00:30] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:00:31] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:00:31] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 0.0)
(t3 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 299/453 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:05] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 455 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60741 ms. Remains : 108/109 places, 300/302 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FireWire-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 4 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 283 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 40000 steps (2148 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1291 steps, run visited all 4 properties in 26 ms. (steps per millisecond=49 )
Probabilistic random walk after 1291 steps, saw 701 distinct states, run finished after 26 ms. (steps per millisecond=49 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-04-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-04-LTLFireability-02 finished in 62337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)&&X(X(p2))))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Applied a total of 2 rules in 3 ms. Remains 108 /109 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2025-06-02 07:01:27] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:01:28] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-02 07:01:28] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:01:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:01:28] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-02 07:01:28] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:01:28] [INFO ] Invariant cache hit.
[2025-06-02 07:01:28] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:31] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:31] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:31] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 299/453 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:06] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:18] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 455 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 108/109 places, 300/302 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-03 finished in 61014 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(X(G((p0||X(X(X(X(G(p1)))))))))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Applied a total of 2 rules in 6 ms. Remains 108 /109 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2025-06-02 07:02:28] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:02:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:02:29] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-02 07:02:29] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:02:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:02:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:02:29] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-02 07:02:29] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:02:29] [INFO ] Invariant cache hit.
[2025-06-02 07:02:29] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:33] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 299/453 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:07] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:19] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 455 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60681 ms. Remains : 108/109 places, 300/302 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-05 finished in 60993 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 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 105 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 105 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 102 transition count 304
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 18 place count 102 transition count 298
Applied a total of 18 rules in 37 ms. Remains 102 /109 variables (removed 7) and now considering 298/302 (removed 4) transitions.
[2025-06-02 07:03:29] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2025-06-02 07:03:29] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:03:30] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-02 07:03:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:03:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:03:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:03:30] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:03:30] [INFO ] Redundant transitions in 4 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 07:03:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:03:30] [INFO ] Invariant cache hit.
[2025-06-02 07:03:30] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:32] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:32] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:32] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:38] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 150 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/444 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:08] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:09] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:10] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:21] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:21] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:21] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/109 places, 298/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60668 ms. Remains : 102/109 places, 298/302 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-06
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-06 finished in 60728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0 U X(p1)))) U (X(X(p1))&&F(p0))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Applied a total of 2 rules in 3 ms. Remains 108 /109 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2025-06-02 07:04:30] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2025-06-02 07:04:30] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:30] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-02 07:04:30] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:04:30] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-02 07:04:30] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:04:30] [INFO ] Invariant cache hit.
[2025-06-02 07:04:30] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:34] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:34] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:35] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 299 unsolved in 29226 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 299/453 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:19] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 455 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59376ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 59377ms
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59737 ms. Remains : 108/109 places, 300/302 transitions.
Stuttering acceptance computed with spot in 533 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-08 finished in 60296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 105 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 105 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 102 transition count 304
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 18 place count 102 transition count 298
Applied a total of 18 rules in 25 ms. Remains 102 /109 variables (removed 7) and now considering 298/302 (removed 4) transitions.
[2025-06-02 07:05:30] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 102 cols
[2025-06-02 07:05:30] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:05:31] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 07:05:31] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:05:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:05:31] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:05:31] [INFO ] Redundant transitions in 3 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 07:05:31] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:05:31] [INFO ] Invariant cache hit.
[2025-06-02 07:05:31] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:32] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:33] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:33] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:39] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 150 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/444 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:08] [INFO ] Deduced a trap composed of 34 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 07:06:09] [INFO ] Deduced a trap composed of 15 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 07:06:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:19] [INFO ] Deduced a trap along path composed of 2 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:19] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:19] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/109 places, 298/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60667 ms. Remains : 102/109 places, 298/302 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FireWire-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 146 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 248 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (2501 resets) in 188 ms. (211 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (13 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (17 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2025-06-02 07:06:32] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:06:32] [INFO ] Invariant cache hit.
[2025-06-02 07:06:32] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/75 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 240/315 variables, 75/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 28/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/364 variables, 25/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 12/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/366 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/366 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 146 constraints, problems are : Problem set: 1 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/270 variables, 53/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 18/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/363 variables, 46/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 22/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/366 variables, 3/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/366 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 147 constraints, problems are : Problem set: 1 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 440ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 298/298 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 102 transition count 292
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 292
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 97 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 97 transition count 287
Applied a total of 21 rules in 23 ms. Remains 97 /102 variables (removed 5) and now considering 287/298 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 40000 steps (2540 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (17 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1640 steps, run visited all 1 properties in 11 ms. (steps per millisecond=149 )
Probabilistic random walk after 1640 steps, saw 987 distinct states, run finished after 12 ms. (steps per millisecond=136 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND (OR p2 p0) (OR p2 p1))))]
Knowledge based reduction with 14 factoid took 469 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 298/298 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2025-06-02 07:06:33] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:06:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-02 07:06:33] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:06:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:06:34] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:06:34] [INFO ] Redundant transitions in 3 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 07:06:34] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:06:34] [INFO ] Invariant cache hit.
[2025-06-02 07:06:34] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:35] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:36] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:36] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:43] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 295 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 366/367 variables, and 150 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 264/365 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 295/444 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:13] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:24] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:24] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:24] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/367 variables, and 450 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60635 ms. Remains : 102/102 places, 298/298 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (2536 resets) in 352 ms. (113 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (17 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2025-06-02 07:07:34] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
[2025-06-02 07:07:34] [INFO ] Invariant cache hit.
[2025-06-02 07:07:34] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/270 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/363 variables, 46/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/366 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/366 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/367 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/270 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/363 variables, 46/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/366 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/366 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/367 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 298/298 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 102 transition count 292
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 292
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 97 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 97 transition count 287
Applied a total of 21 rules in 27 ms. Remains 97 /102 variables (removed 5) and now considering 287/298 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 97/102 places, 287/298 transitions.
RANDOM walk for 40000 steps (2554 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (14 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1640 steps, run visited all 1 properties in 12 ms. (steps per millisecond=136 )
Probabilistic random walk after 1640 steps, saw 987 distinct states, run finished after 13 ms. (steps per millisecond=126 ) properties seen :1
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 1 reset in 139 ms.
Built C files in :
/tmp/ltsmin13014404565142310732
[2025-06-02 07:07:36] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2025-06-02 07:07:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 07:07:36] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2025-06-02 07:07:36] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 07:07:36] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2025-06-02 07:07:36] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 07:07:36] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13014404565142310732
Running compilation step : cd /tmp/ltsmin13014404565142310732;'/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 1240 ms.
Running link step : cd /tmp/ltsmin13014404565142310732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13014404565142310732;'/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/stateBased3025929601041100148.hoa' '--buchi-type=spotba'
LTSmin run took 842 ms.
FORMULA FireWire-PT-04-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-04-LTLFireability-10 finished in 127773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p0)&&F(p1))))))'
Support contains 1 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2025-06-02 07:07:38] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 109 cols
[2025-06-02 07:07:38] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:38] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 07:07:38] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2025-06-02 07:07:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:07:39] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2025-06-02 07:07:39] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2025-06-02 07:07:39] [INFO ] Invariant cache hit.
[2025-06-02 07:07:39] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:46] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:46] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:46] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 275/384 variables, 109/225 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 39/264 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 1/385 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/385 variables, and 265 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30019 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:12] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 275/384 variables, 109/226 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 39/265 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 301/566 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:32] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/385 variables, and 568 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30015 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Finished structural reductions in LTL mode , in 1 iterations and 61370 ms. Remains : 109/109 places, 302/302 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-12 finished in 61466 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 ((X(!p0)&&(p1 U !p2))||X(G(!p0)))))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 300
Applied a total of 2 rules in 2 ms. Remains 108 /109 variables (removed 1) and now considering 300/302 (removed 2) transitions.
[2025-06-02 07:08:40] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
// Phase 1: matrix 274 rows 108 cols
[2025-06-02 07:08:40] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 07:08:40] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:08:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:08:40] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-02 07:08:40] [INFO ] Flow matrix only has 274 transitions (discarded 26 similar events)
[2025-06-02 07:08:40] [INFO ] Invariant cache hit.
[2025-06-02 07:08:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:45] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:45] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:45] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 299 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 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 299/453 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:19] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:32] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 455 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 300/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 108/109 places, 300/302 transitions.
Stuttering acceptance computed with spot in 319 ms :[p0, p0, (AND p0 p2), true, (AND p0 p2), p2]
Running random walk in product with property : FireWire-PT-04-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 363 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 28 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-04-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-04-LTLFireability-13 finished in 61737 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)))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 104 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 104 transition count 299
Applied a total of 14 rules in 35 ms. Remains 104 /109 variables (removed 5) and now considering 299/302 (removed 3) transitions.
[2025-06-02 07:09:41] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
// Phase 1: matrix 269 rows 104 cols
[2025-06-02 07:09:41] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:42] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 07:09:42] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2025-06-02 07:09:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 07:09:42] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:09:42] [INFO ] Redundant transitions in 3 ms returned []
Running 298 sub problems to find dead transitions.
[2025-06-02 07:09:42] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2025-06-02 07:09:42] [INFO ] Invariant cache hit.
[2025-06-02 07:09:42] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:47] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:47] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:47] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 153 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 298/450 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:21] [INFO ] Deduced a trap composed of 17 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 07:10:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:24] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:41] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:41] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/109 places, 299/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60819 ms. Remains : 104/109 places, 299/302 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 131 steps (9 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 299/299 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2025-06-02 07:10:43] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2025-06-02 07:10:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:10:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-02 07:10:43] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2025-06-02 07:10:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:10:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 07:10:43] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:10:43] [INFO ] Redundant transitions in 1 ms returned []
Running 298 sub problems to find dead transitions.
[2025-06-02 07:10:43] [INFO ] Flow matrix only has 269 transitions (discarded 30 similar events)
[2025-06-02 07:10:43] [INFO ] Invariant cache hit.
[2025-06-02 07:10:43] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:47] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:47] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:47] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 153 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 268/372 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 298/450 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:20] [INFO ] Deduced a trap composed of 17 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 07:11:21] [INFO ] Deduced a trap composed of 16 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 07:11:23] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:41] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:41] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60455 ms. Remains : 104/104 places, 299/299 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 213 steps (20 resets) in 6 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 90 ms.
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-04-LTLFireability-15 finished in 122855 ms.
All properties solved by simple procedures.
Total runtime 927468 ms.
BK_STOP 1748848304808
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-04"
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-04, 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-174860102200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-04.tgz
mv FireWire-PT-04 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 ;