About the Execution of ITS-Tools for LamportFastMutEx-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 282224.00 | 0.00 | 0.00 | FFFFFFFFTTFFTFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423100635.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 LamportFastMutEx-COL-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423100635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K 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 LamportFastMutEx-COL-7-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-7-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748876956325
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-02 15:09:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 15:09:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:09:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 15:09:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 15:09:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2025-06-02 15:09:18] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 15:09:18] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 6 ms.
[2025-06-02 15:09:18] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40016 steps (8 resets) in 339 ms. (117 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
// Phase 1: matrix 17 rows 15 cols
[2025-06-02 15:09:19] [INFO ] Computed 2 invariants in 3 ms
[2025-06-02 15:09:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2025-06-02 15:09:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-02 15:09:19] [INFO ] Flatten gal took : 16 ms
FORMULA LamportFastMutEx-COL-7-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 15:09:19] [INFO ] Flatten gal took : 4 ms
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 15:09:19] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 25 ms.
[2025-06-02 15:09:19] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 74 transitions.
Support contains 189 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 10 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 15:09:19] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2025-06-02 15:09:19] [INFO ] Computed 65 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:19] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-02 15:09:19] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 15:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:19] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-02 15:09:19] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 15:09:19] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 15:09:19] [INFO ] Invariant cache hit.
[2025-06-02 15:09:20] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:22] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 16 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:22] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 10 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:22] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 7 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:22] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 7 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:22] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 9 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:23] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 9 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:23] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 7 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:23] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:23] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:23] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:23] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:23] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 9 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 5 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 5 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:24] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 25 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:25] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:25] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:25] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:25] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:25] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:25] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 3 ms to minimize.
Problem TDEAD122 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 5 ms to minimize.
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 3 ms to minimize.
Problem TDEAD124 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:26] [INFO ] Deduced a trap composed of 20 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 15:09:27] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:27] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:27] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:27] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 41 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:27] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:28] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 3 ms to minimize.
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:28] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:28] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 16 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 15:09:30] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:31] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:31] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 8 ms to minimize.
Problem TDEAD203 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:34] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:34] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:34] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:34] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:35] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:35] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:35] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:35] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 8/133 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:36] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:36] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:37] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:37] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:37] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:37] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/153 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:41] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:42] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:42] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:42] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:42] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:42] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 6/159 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:44] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:44] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:44] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:45] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:45] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:45] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:46] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:47] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:47] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:47] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:47] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:47] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 12/171 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:49] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:50] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:50] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 14 ms to minimize.
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 42 solved, 413 unsolved
Search for dead transitions found 42 dead transitions in 30327ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 219/219 places, 420/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30987 ms. Remains : 219/219 places, 420/462 transitions.
Support contains 189 out of 219 places after structural reductions.
[2025-06-02 15:09:50] [INFO ] Flatten gal took : 37 ms
[2025-06-02 15:09:50] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:09:50] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 40000 steps (8 resets) in 923 ms. (43 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
[2025-06-02 15:09:50] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2025-06-02 15:09:50] [INFO ] Computed 65 invariants in 4 ms
[2025-06-02 15:09:50] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/497 variables, 189/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 84/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 30/527 variables, 30/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/527 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 368 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 84/84 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/497 variables, 189/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 84/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/527 variables, 30/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/527 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 547ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 406
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 406
Applied a total of 28 rules in 55 ms. Remains 205 /219 variables (removed 14) and now considering 406/420 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 205/219 places, 406/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1126895 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :0 out of 1
Probabilistic random walk after 1126895 steps, saw 481722 distinct states, run finished after 3004 ms. (steps per millisecond=375 ) properties seen :0
[2025-06-02 15:09:54] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 205 cols
[2025-06-02 15:09:54] [INFO ] Computed 65 invariants in 7 ms
[2025-06-02 15:09:54] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/175 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/469 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 84/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 30/499 variables, 30/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 9/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 354 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 205/205 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/175 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/469 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 84/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/499 variables, 30/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 9/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:55] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:55] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 10 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/499 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/499 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 205/205 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 406/406 transitions.
Applied a total of 0 rules in 23 ms. Remains 205 /205 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 205/205 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 406/406 transitions.
Applied a total of 0 rules in 27 ms. Remains 205 /205 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 15:09:55] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:09:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:55] [INFO ] Implicit Places using invariants in 210 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 213 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 251 ms. Remains : 198/205 places, 406/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1161165 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :0 out of 1
Probabilistic random walk after 1161165 steps, saw 494110 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
[2025-06-02 15:09:58] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2025-06-02 15:09:58] [INFO ] Computed 58 invariants in 5 ms
[2025-06-02 15:09:58] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 161/168 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/462 variables, 168/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 35/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 30/492 variables, 30/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/492 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 161/168 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/462 variables, 168/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 35/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/492 variables, 30/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 198/198 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 15:09:59] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:59] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-02 15:09:59] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:59] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 15:09:59] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:09:59] [INFO ] Redundant transitions in 30 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-02 15:09:59] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:09:59] [INFO ] Invariant cache hit.
[2025-06-02 15:09:59] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 7/198 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:03] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:03] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:04] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [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 15:10:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [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 15:10:05] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:07] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:07] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:07] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:07] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:07] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:08] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:09] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:09] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:09] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:09] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:09] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:09] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 15 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 15:10:11] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:13] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:13] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:13] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:14] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:15] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:16] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:16] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:16] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:16] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:17] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:17] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:19] [INFO ] Deduced a trap composed of 21 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 15:10:20] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:20] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 20 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 15:10:21] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:21] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:22] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:22] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:22] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:22] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:23] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:23] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:23] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:23] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:23] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:23] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:24] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:24] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:24] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:25] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:25] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:25] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:25] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 18/176 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:26] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:27] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:28] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:28] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:28] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:29] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/492 variables, and 184 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 126/126 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 87/96 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 39/184 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:33] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:34] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:34] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:34] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:34] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 9/193 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:36] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:37] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:37] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:37] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:37] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:37] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 11/204 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:38] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:38] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:38] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:38] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:39] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:40] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:40] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:40] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:40] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:40] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:40] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:41] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:41] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:42] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:43] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 10 (OVERLAPS) 294/492 variables, 198/417 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 35/452 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 399/851 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:56] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:56] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:56] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:56] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:56] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:56] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 6/857 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 857 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 198/198 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 167/167 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60725 ms. Remains : 198/198 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 198 transition count 294
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 112 place count 198 transition count 245
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 252 place count 107 transition count 245
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 266 place count 100 transition count 238
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 93 transition count 280
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 287 place count 93 transition count 273
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 294 place count 86 transition count 273
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 86 transition count 273
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 308 place count 86 transition count 273
Applied a total of 308 rules in 90 ms. Remains 86 /198 variables (removed 112) and now considering 273/406 (removed 133) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 86 cols
[2025-06-02 15:11:00] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 15:11:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 15:11:00] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 15:11:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 15:11:00] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 15:11:00] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 15:11:00] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 498 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&((p2 U G(p3)) U !(p3 U p0)))))'
Support contains 77 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:11:00] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2025-06-02 15:11:01] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:01] [INFO ] Implicit Places using invariants in 456 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 459 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 18 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 479 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 532 ms :[(OR p1 p0), (OR p1 p0), true, p1, (NOT p3), (NOT p3), (AND (NOT p3) p0 p2), p0]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-00 finished in 1150 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)) U (X(X(p1))&&(!p1 U p2))))'
Support contains 63 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:11:02] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:02] [INFO ] Implicit Places using invariants in 170 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 172 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-02
Product exploration explored 100000 steps with 3553 reset in 415 ms.
Product exploration explored 100000 steps with 3538 reset in 364 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) p1)), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 149 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 14539 steps (2 resets) in 140 ms. (103 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) p1)), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F p0), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 449 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
[2025-06-02 15:11:05] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 212 cols
[2025-06-02 15:11:05] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:11:05] [INFO ] [Real]Absence check using 58 positive place invariants in 26 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p2) p1)), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F p0), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 16 factoid took 403 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-7-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-02 finished in 3862 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)&&(!p0||X(p1))) U (G((X(p0)&&(!p0||X(p1))))||(X(p0)&&(!p0||X(p1))&&(p1 U (p2||G(p1)))))))'
Support contains 35 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:11:05] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2025-06-02 15:11:05] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:06] [INFO ] Implicit Places using invariants in 183 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 197 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-04 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:11:06] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:06] [INFO ] Implicit Places using invariants in 186 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 198 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-05 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:11:06] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:06] [INFO ] Implicit Places using invariants in 196 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 197 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-06
Product exploration explored 100000 steps with 1090 reset in 276 ms.
Stack based approach found an accepted trace after 1693 steps with 21 reset with depth 188 and stack size 188 in 5 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-06 finished in 675 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((X(p0)&&(p0||(F(p1)&&F(p0))))))'
Support contains 63 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:11:07] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:07] [INFO ] Implicit Places using invariants in 478 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 479 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-07 finished in 643 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(((p1||X(p2)) U (p0&&(p1||X(p2))))))) U (p2&&X(p1)))))'
Support contains 35 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:11:08] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:11:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:08] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 15:11:08] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:11:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-02 15:11:08] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2025-06-02 15:11:08] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:11:08] [INFO ] Invariant cache hit.
[2025-06-02 15:11:08] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:13] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:13] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:13] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:13] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:13] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:14] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:14] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:14] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:14] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:14] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:14] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:15] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:17] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:17] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:17] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:17] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:18] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:19] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:19] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:19] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:19] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:19] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:19] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:19] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:20] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:20] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:21] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:21] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:21] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:21] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:21] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:21] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:21] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 15 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 15:11:22] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:23] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:23] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:24] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:24] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:25] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:25] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:25] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:25] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:25] [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 15:11:25] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:26] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:27] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:30] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:30] [INFO ] Deduced a trap composed of 22 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 15:11:30] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:30] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:32] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:32] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:32] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:32] [INFO ] Deduced a trap composed of 20 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 15:11:32] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:33] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:33] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:33] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:33] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:33] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 20 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 15:11:35] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:36] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:37] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:37] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
SMT process timed out in 30120ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30122ms
Finished structural reductions in LTL mode , in 1 iterations and 30682 ms. Remains : 219/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Product exploration explored 100000 steps with 33333 reset in 340 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 142 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-7-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-08 finished in 31778 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 14 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 18 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2025-06-02 15:11:39] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
// Phase 1: matrix 301 rows 212 cols
[2025-06-02 15:11:39] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:40] [INFO ] Implicit Places using invariants in 174 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 177 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 406
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 406
Applied a total of 14 rules in 12 ms. Remains 198 /205 variables (removed 7) and now considering 406/413 (removed 7) transitions.
[2025-06-02 15:11:40] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2025-06-02 15:11:40] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:40] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-02 15:11:40] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:11:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 15:11:40] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 406/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 738 ms. Remains : 198/219 places, 406/420 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-11
Product exploration explored 100000 steps with 6782 reset in 233 ms.
Product exploration explored 100000 steps with 6829 reset in 310 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 54 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2025-06-02 15:11:41] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:11:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:11:41] [INFO ] [Real]Absence check using 58 positive place invariants in 24 ms returned sat
[2025-06-02 15:11:42] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-02 15:11:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:11:42] [INFO ] [Nat]Absence check using 58 positive place invariants in 27 ms returned sat
[2025-06-02 15:11:42] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2025-06-02 15:11:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 15:11:42] [INFO ] [Nat]Added 35 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:42] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:42] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:42] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:43] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:44] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:44] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:44] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 8 ms to minimize.
[2025-06-02 15:11:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1786 ms
[2025-06-02 15:11:44] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 22 ms.
[2025-06-02 15:11:45] [INFO ] Added : 213 causal constraints over 43 iterations in 1495 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 14 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 15:11:45] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:11:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:46] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 15:11:46] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 15:11:46] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:11:46] [INFO ] Redundant transitions in 20 ms returned []
Running 399 sub problems to find dead transitions.
[2025-06-02 15:11:46] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:11:46] [INFO ] Invariant cache hit.
[2025-06-02 15:11:46] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 7/198 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:50] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:50] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:50] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:50] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:52] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:52] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:52] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:52] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:52] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:52] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:53] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:54] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:54] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:54] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:54] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:54] [INFO ] Deduced a trap composed of 15 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 15:11:54] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:54] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:55] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:55] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:55] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:55] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:55] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:55] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:55] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:56] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:56] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:56] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:56] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:56] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:56] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:57] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:57] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:57] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:57] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:57] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:58] [INFO ] Deduced a trap composed of 22 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 15:11:59] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:59] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:59] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:59] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:59] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:59] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:00] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:00] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:00] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:00] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:00] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:01] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:01] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:01] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:01] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:01] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:01] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:02] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:02] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:02] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:02] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:02] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:03] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:03] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:03] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:03] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:05] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:05] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:06] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:06] [INFO ] Deduced a trap composed of 20 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 15:12:06] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:07] [INFO ] Deduced a trap composed of 22 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 15:12:07] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:07] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:07] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:07] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:07] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:07] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:08] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:09] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:09] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:10] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:10] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:10] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 20 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 15:12:11] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:11] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:12] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:12] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:12] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 13/171 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:13] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:13] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:13] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:13] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:14] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:14] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:14] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:15] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:15] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:15] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:15] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:15] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/492 variables, and 183 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/198 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 125/125 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 91/100 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 7/198 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 34/183 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:20] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:20] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:20] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:22] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:22] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:22] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:23] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:25] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:25] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:27] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:29] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:30] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:30] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:30] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:31] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:31] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:31] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:31] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:32] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:32] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:33] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:33] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:33] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 12 (OVERLAPS) 294/492 variables, 198/409 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 35/444 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 399/843 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:46] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 11 ms to minimize.
SMT process timed out in 60182ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60773 ms. Remains : 198/198 places, 406/406 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 50 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2025-06-02 15:12:47] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2025-06-02 15:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:12:47] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2025-06-02 15:12:47] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-06-02 15:12:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:12:47] [INFO ] [Nat]Absence check using 58 positive place invariants in 27 ms returned sat
[2025-06-02 15:12:48] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-06-02 15:12:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 15:12:48] [INFO ] [Nat]Added 35 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:48] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:48] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:48] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:48] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:48] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:48] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:48] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:49] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:49] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:49] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:49] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:49] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:49] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:12:49] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 7 ms to minimize.
[2025-06-02 15:12:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1825 ms
[2025-06-02 15:12:49] [INFO ] Computed and/alt/rep : 252/1463/252 causal constraints (skipped 35 transitions) in 21 ms.
[2025-06-02 15:12:51] [INFO ] Added : 213 causal constraints over 43 iterations in 1429 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6812 reset in 248 ms.
Product exploration explored 100000 steps with 6769 reset in 282 ms.
Built C files in :
/tmp/ltsmin2998259577638124893
[2025-06-02 15:12:51] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2025-06-02 15:12:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:12:51] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2025-06-02 15:12:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:12:52] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2025-06-02 15:12:52] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:12:52] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2998259577638124893
Running compilation step : cd /tmp/ltsmin2998259577638124893;'/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 1200 ms.
Running link step : cd /tmp/ltsmin2998259577638124893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2998259577638124893;'/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/stateBased17069608357667476809.hoa' '--buchi-type=spotba'
LTSmin run took 2286 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-11 finished in 75764 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 (G(p0)||(p0&&X(X(G(p1)))&&(p2||G(p3))))) U !p1)))'
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:12:55] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2025-06-02 15:12:55] [INFO ] Computed 65 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:12:55] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 15:12:55] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:12:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-02 15:12:56] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2025-06-02 15:12:56] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:12:56] [INFO ] Invariant cache hit.
[2025-06-02 15:12:56] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:00] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:01] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:02] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:02] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:02] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:02] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:02] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:02] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:04] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:08] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:08] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:08] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:08] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:08] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 14 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 15:13:09] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 8 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 15:13:10] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:11] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:11] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:11] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:14] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:14] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:14] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:14] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:17] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:17] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:18] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:18] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:18] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:18] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:18] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:18] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:18] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:19] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:19] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:19] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:19] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:19] [INFO ] Deduced a trap composed of 20 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 15:13:19] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:20] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:20] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:20] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:21] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:21] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:21] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:22] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:22] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:23] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:23] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:23] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:23] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:23] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:24] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:25] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:25] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:25] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:25] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:26] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:26] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/527 variables, and 180 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/84 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 115/115 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 74/83 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/219 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:28] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:28] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:28] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:28] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:28] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:31] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:31] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:31] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:31] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:31] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:32] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:32] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:33] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:33] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:33] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 10/195 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:35] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (OVERLAPS) 308/527 variables, 219/415 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 84/499 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 413/912 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:49] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:49] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:49] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:49] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:49] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:49] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:50] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:50] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:50] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:50] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:50] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:51] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:51] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:51] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:51] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:51] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:51] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 17/929 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 929 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 148/148 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Finished structural reductions in LTL mode , in 1 iterations and 60750 ms. Remains : 219/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 567 ms :[p1, p1, true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), false, false]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2 p3), (X p2), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p3) p0))), (X (NOT (OR (AND p1 p2 p0) (AND p1 p3 p0)))), (X (NOT (AND p1 (NOT p2) p3 p0))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (OR (AND p1 p2 p0) (AND p1 p3 p0))))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (OR (AND p2 p0) (AND p3 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 22 ms. Reduced automaton from 12 states, 41 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-7-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-12 finished in 61785 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((F(p0)&&F(G(!p1))))))'
Support contains 56 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:13:57] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:13:57] [INFO ] Implicit Places using invariants in 163 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 179 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 330 ms.
Stack based approach found an accepted trace after 760 steps with 0 reset with depth 761 and stack size 761 in 2 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-13 finished in 734 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((p0||(X(X(p0))&&F((p1||G(p2)))))))'
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2025-06-02 15:13:58] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2025-06-02 15:13:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:13:58] [INFO ] Implicit Places using invariants in 186 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 187 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 538 steps with 9 reset in 3 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-15 finished in 375 ms.
All properties solved by simple procedures.
Total runtime 280772 ms.
BK_STOP 1748877238549
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LamportFastMutEx-COL-7"
export BK_EXAMINATION="LTLCardinality"
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 LamportFastMutEx-COL-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876423100635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;