About the Execution of ITS-Tools for LamportFastMutEx-PT-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 578879.00 | 0.00 | 0.00 | FFFFTFFFTFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423200699.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-PT-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423200699
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 29K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 263K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 310K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 582K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 329K 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-PT-8-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748888663523
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 18:24:24] [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 18:24:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:24:25] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-02 18:24:25] [INFO ] Transformed 315 places.
[2025-06-02 18:24:25] [INFO ] Transformed 666 transitions.
[2025-06-02 18:24:25] [INFO ] Found NUPN structural information;
[2025-06-02 18:24:25] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_start_1_8, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_b_8_false, P_b_8_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setx_3_8, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_setbi_5_8, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_ify0_4_8, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_sety_9_8, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_ifxi_10_8, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_setbi_11_8, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_fordo_12_8, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_0_8, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_1_8, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_2_8, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_3_8, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_4_8, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_5_8, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_6_8, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_await_13_8, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_0_8, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_1_8, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_2_8, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_3_8, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_4_8, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_5_8, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_6_8, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_ifyi_15_8, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_awaity_8, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_CS_21_8, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7, P_setbi_24_8]
[2025-06-02 18:24:25] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 151 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 16 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:24:25] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2025-06-02 18:24:25] [INFO ] Computed 82 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:24:25] [INFO ] Implicit Places using invariants in 470 ms returned [163, 164, 165, 166, 167, 168, 169]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 511 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/266 places, 584/584 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 550 ms. Remains : 259/266 places, 584/584 transitions.
Support contains 151 out of 259 places after structural reductions.
[2025-06-02 18:24:26] [INFO ] Flatten gal took : 73 ms
[2025-06-02 18:24:26] [INFO ] Flatten gal took : 35 ms
[2025-06-02 18:24:26] [INFO ] Input system was already deterministic with 584 transitions.
RANDOM walk for 40000 steps (8 resets) in 1513 ms. (26 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2025-06-02 18:24:27] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 259 cols
[2025-06-02 18:24:27] [INFO ] Computed 75 invariants in 5 ms
[2025-06-02 18:24:27] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 209/225 variables, 65/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 209/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 416/641 variables, 225/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 56/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/675 variables, 34/605 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 34/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 10/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/675 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 337 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 259/259 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 217/225 variables, 65/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 217/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 416/641 variables, 225/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 56/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/675 variables, 34/605 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 34/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 10/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 1/650 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:27] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:27] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/675 variables, 2/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/675 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 652 constraints, problems are : Problem set: 1 solved, 1 unsolved in 742 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 259/259 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 8 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 584/584 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 259 transition count 577
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 252 transition count 577
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 30 place count 244 transition count 569
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 244 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 243 transition count 568
Applied a total of 32 rules in 81 ms. Remains 243 /259 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 243/259 places, 568/584 transitions.
RANDOM walk for 40000 steps (8 resets) in 678 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1011875 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1011875 steps, saw 498847 distinct states, run finished after 3005 ms. (steps per millisecond=336 ) properties seen :0
[2025-06-02 18:24:31] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 243 cols
[2025-06-02 18:24:31] [INFO ] Computed 75 invariants in 5 ms
[2025-06-02 18:24:31] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/209 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 201/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/609 variables, 209/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 56/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/643 variables, 34/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 34/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 10/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/643 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 617 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 243/243 constraints, ReadFeed: 56/56 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/209 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 201/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/609 variables, 209/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 56/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/643 variables, 34/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 34/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 10/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/618 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 18:24:32] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:32] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:32] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/643 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/643 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/643 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 902 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 243/243 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1158ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 568/568 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 243/243 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 243 /243 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-02 18:24:32] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:24:32] [INFO ] Implicit Places using invariants in 274 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 276 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/243 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 312 ms. Remains : 242/243 places, 568/568 transitions.
RANDOM walk for 40000 steps (8 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 966663 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 1
Probabilistic random walk after 966663 steps, saw 474399 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
[2025-06-02 18:24:36] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2025-06-02 18:24:36] [INFO ] Computed 74 invariants in 9 ms
[2025-06-02 18:24:36] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/608 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 48/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/642 variables, 34/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 34/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/642 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/642 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 606 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 48/48 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/608 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 48/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/642 variables, 34/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 34/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/642 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/642 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 563ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-02 18:24:36] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:24:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:24:37] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-02 18:24:37] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:24:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:24:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:24:37] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:24:37] [INFO ] Redundant transitions in 37 ms returned []
Running 560 sub problems to find dead transitions.
[2025-06-02 18:24:37] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:24:37] [INFO ] Invariant cache hit.
[2025-06-02 18:24:37] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 74/316 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:40] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:40] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 10 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:40] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 11 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:40] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 10 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:41] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 10 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:41] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 11 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:41] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:41] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:41] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:41] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:42] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 10 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:42] [INFO ] Deduced a trap composed of 10 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 18:24:42] [INFO ] Deduced a trap composed of 10 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 18:24:42] [INFO ] Deduced a trap composed of 10 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 18:24:42] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:42] [INFO ] Deduced a trap composed of 10 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 18:24:42] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:43] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:43] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 5 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 13 solved, 547 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:43] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:43] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:43] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:43] [INFO ] Deduced a trap composed of 10 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 18:24:44] [INFO ] Deduced a trap composed of 10 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 18:24:44] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:44] [INFO ] Deduced a trap composed of 10 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 18:24:44] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:44] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:44] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:44] [INFO ] Deduced a trap composed of 16 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 18:24:45] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:45] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:45] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:45] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:46] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:46] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:46] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:46] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 13 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:46] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 7 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 39 solved, 521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:49] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:49] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:49] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:50] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:50] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:50] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:50] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
Problem TDEAD162 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:50] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 10 ms to minimize.
Problem TDEAD166 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:50] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:50] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:51] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:51] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:51] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:51] [INFO ] Deduced a trap composed of 41 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 18:24:51] [INFO ] Deduced a trap composed of 41 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 18:24:51] [INFO ] Deduced a trap composed of 16 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 18:24:51] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:52] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:52] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:52] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 6 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 47 solved, 513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:52] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:53] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:53] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:53] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:53] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:53] [INFO ] Deduced a trap composed of 17 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 18:24:53] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:54] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:54] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:54] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:54] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:55] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:55] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:55] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:55] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:55] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:56] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:56] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:56] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:56] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 47 solved, 513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:58] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:58] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:58] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 3 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:59] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:59] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:59] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:59] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:24:59] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:00] [INFO ] Deduced a trap composed of 22 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 18:25:00] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:00] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:00] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:00] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:01] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:01] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:01] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:01] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:01] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:01] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:02] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 15 ms to minimize.
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:07] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:07] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:07] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:07] [INFO ] Deduced a trap composed of 23 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 18:25:07] [INFO ] Deduced a trap composed of 23 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 18:25:07] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:07] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 14 ms to minimize.
SMT process timed out in 30264ms, After SMT, problems are : Problem set: 48 solved, 512 unsolved
Search for dead transitions found 48 dead transitions in 30269ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 520/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:25:07] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31246 ms. Remains : 242/242 places, 520/568 transitions.
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1040985 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1040985 steps, saw 508413 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
[2025-06-02 18:25:11] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-02 18:25:11] [INFO ] Computed 74 invariants in 5 ms
[2025-06-02 18:25:11] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 599 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 18:25:11] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:11] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-02 18:25:11] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 18:25:12] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:25:12] [INFO ] Redundant transitions in 12 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 18:25:12] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:25:12] [INFO ] Invariant cache hit.
[2025-06-02 18:25:12] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:20] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:20] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:21] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:21] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:21] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:21] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:21] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:21] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:22] [INFO ] Deduced a trap composed of 10 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 18:25:22] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:22] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:22] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:22] [INFO ] Deduced a trap composed of 7 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 18:25:22] [INFO ] Deduced a trap composed of 10 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 18:25:22] [INFO ] Deduced a trap composed of 10 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 18:25:22] [INFO ] Deduced a trap composed of 10 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 18:25:23] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:23] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:23] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:23] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:23] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:23] [INFO ] Deduced a trap composed of 15 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 18:25:24] [INFO ] Deduced a trap composed of 15 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 18:25:24] [INFO ] Deduced a trap composed of 15 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 18:25:24] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:24] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:25] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:25] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:25] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:25] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:25] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:25] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:25] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:26] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:26] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:26] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:26] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:26] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:27] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:27] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:30] [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 18:25:30] [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 18:25:30] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:30] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:30] [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 18:25:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:30] [INFO ] Deduced a trap composed of 41 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 18:25:30] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:31] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:31] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:31] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:32] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:32] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:32] [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 18:25:32] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:32] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:32] [INFO ] Deduced a trap composed of 16 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 18:25:33] [INFO ] Deduced a trap composed of 16 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 18:25:33] [INFO ] Deduced a trap composed of 16 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 18:25:33] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:35] [INFO ] Deduced a trap composed of 16 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 18:25:35] [INFO ] Deduced a trap composed of 16 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 18:25:35] [INFO ] Deduced a trap composed of 16 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 18:25:35] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:35] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:36] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:36] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:36] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:36] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:36] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:37] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:37] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:37] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:37] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:37] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:37] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:38] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:38] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:40] [INFO ] Deduced a trap composed of 22 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 18:25:40] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:40] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:41] [INFO ] Deduced a trap composed of 23 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 18:25:41] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:41] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:41] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:41] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:42] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:42] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:42] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:42] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:42] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 16 ms to minimize.
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31157 ms. Remains : 242/242 places, 520/520 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 152 place count 242 transition count 304
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 336 place count 122 transition count 304
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 352 place count 114 transition count 296
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 368 place count 106 transition count 352
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 376 place count 106 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 384 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 98 transition count 344
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 98 transition count 344
Applied a total of 400 rules in 66 ms. Remains 98 /242 variables (removed 144) and now considering 344/520 (removed 176) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 344 rows 98 cols
[2025-06-02 18:25:42] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 18:25:42] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-02 18:25:43] [INFO ] After 133ms 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 18:25:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-02 18:25:43] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 18:25:43] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 18:25:43] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 380 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p1&&F((G(F(p1))||(F(p1)&&X(p2))))))))))'
Support contains 16 out of 259 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:25:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 259 cols
[2025-06-02 18:25:43] [INFO ] Computed 75 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:43] [INFO ] Implicit Places using invariants in 185 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 258/259 places, 584/584 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-00 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 80 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 584/584 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 259 transition count 577
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 252 transition count 577
Applied a total of 14 rules in 23 ms. Remains 252 /259 variables (removed 7) and now considering 577/584 (removed 7) transitions.
[2025-06-02 18:25:44] [INFO ] Flow matrix only has 409 transitions (discarded 168 similar events)
// Phase 1: matrix 409 rows 252 cols
[2025-06-02 18:25:44] [INFO ] Computed 75 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:44] [INFO ] Implicit Places using invariants in 324 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/259 places, 577/584 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 251 transition count 576
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 250 transition count 576
Applied a total of 2 rules in 15 ms. Remains 250 /251 variables (removed 1) and now considering 576/577 (removed 1) transitions.
[2025-06-02 18:25:44] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2025-06-02 18:25:44] [INFO ] Computed 74 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:44] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-02 18:25:44] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2025-06-02 18:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:25:45] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/259 places, 576/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1100 ms. Remains : 250/259 places, 576/584 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-01
Product exploration explored 100000 steps with 3758 reset in 467 ms.
Product exploration explored 100000 steps with 3772 reset in 410 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
[2025-06-02 18:25:46] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2025-06-02 18:25:46] [INFO ] Invariant cache hit.
[2025-06-02 18:25:46] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 208/216 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/624 variables, 216/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 48/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/658 variables, 34/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 34/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/658 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 250/250 constraints, ReadFeed: 48/48 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 208/216 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/624 variables, 216/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 48/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/658 variables, 34/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 34/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/658 variables, 0/623 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 18:25:47] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:47] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:47] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 10 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/658 variables, 3/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/658 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/658 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 626 constraints, problems are : Problem set: 0 solved, 1 unsolved in 875 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 250/250 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 568
Applied a total of 16 rules in 12 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/250 places, 568/576 transitions.
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1082002 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 1
Probabilistic random walk after 1082002 steps, saw 527848 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
[2025-06-02 18:25:50] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2025-06-02 18:25:50] [INFO ] Computed 74 invariants in 6 ms
[2025-06-02 18:25:50] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/608 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 48/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/642 variables, 34/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 34/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/642 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/642 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 606 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 48/48 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/608 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 48/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/642 variables, 34/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 34/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/642 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/642 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-02 18:25:51] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:25:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:51] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-02 18:25:51] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:25:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:51] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:25:52] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:25:52] [INFO ] Redundant transitions in 9 ms returned []
Running 560 sub problems to find dead transitions.
[2025-06-02 18:25:52] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:25:52] [INFO ] Invariant cache hit.
[2025-06-02 18:25:52] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 74/316 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:54] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:54] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:54] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 7 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 6 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 6 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 16 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 18:25:55] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 9 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:56] [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 18:25:56] [INFO ] Deduced a trap composed of 10 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 18:25:56] [INFO ] Deduced a trap composed of 10 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 18:25:56] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:56] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:56] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:56] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:56] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:57] [INFO ] Deduced a trap composed of 16 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 18:25:57] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD564 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 14 solved, 546 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:57] [INFO ] Deduced a trap composed of 7 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 18:25:57] [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 18:25:57] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:57] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:57] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:57] [INFO ] Deduced a trap composed of 10 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 18:25:57] [INFO ] Deduced a trap composed of 10 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 18:25:58] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:58] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:58] [INFO ] Deduced a trap composed of 10 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 18:25:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:58] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:58] [INFO ] Deduced a trap composed of 16 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 18:25:58] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:58] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:59] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:59] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:59] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:59] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 11 ms to minimize.
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:59] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 7 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD566 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 39 solved, 521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:02] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:02] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:02] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:02] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 11 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:03] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:03] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:03] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:03] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 3 ms to minimize.
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:04] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:04] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:04] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:04] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:04] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:05] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:05] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:05] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:05] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:05] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:05] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:06] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 12 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD558 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:07] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:07] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:07] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:07] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:07] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:08] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:08] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:08] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:08] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:08] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:09] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:09] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:09] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:09] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:09] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:09] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:10] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:10] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:10] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:10] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:12] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:12] [INFO ] Deduced a trap composed of 17 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 18:26:12] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:12] [INFO ] Deduced a trap composed of 17 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 18:26:13] [INFO ] Deduced a trap composed of 17 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 18:26:13] [INFO ] Deduced a trap composed of 17 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 18:26:13] [INFO ] Deduced a trap composed of 17 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 18:26:13] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:13] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:13] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:14] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:14] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:14] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:14] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:14] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:14] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:15] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:15] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:15] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:15] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:18] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:20] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:20] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:20] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:20] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:21] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:21] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:21] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:21] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:21] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:22] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:22] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:22] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 14 ms to minimize.
SMT process timed out in 30305ms, After SMT, problems are : Problem set: 48 solved, 512 unsolved
Search for dead transitions found 48 dead transitions in 30308ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/242 places, 520/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:26:22] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31160 ms. Remains : 242/242 places, 520/568 transitions.
RANDOM walk for 40000 steps (8 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1132557 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 1
Probabilistic random walk after 1132557 steps, saw 549967 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2025-06-02 18:26:25] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-02 18:26:25] [INFO ] Computed 74 invariants in 4 ms
[2025-06-02 18:26:25] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 599 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 18:26:25] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:26:26] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-06-02 18:26:26] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:26:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 18:26:26] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:26:26] [INFO ] Redundant transitions in 5 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 18:26:26] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:26:26] [INFO ] Invariant cache hit.
[2025-06-02 18:26:26] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:35] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:35] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:35] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:35] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:35] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:35] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:36] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:36] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:36] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:36] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:36] [INFO ] Deduced a trap composed of 10 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 18:26:36] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:37] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:37] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:37] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:37] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:37] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:37] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:37] [INFO ] Deduced a trap composed of 15 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 18:26:38] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:38] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:38] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:38] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:38] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:38] [INFO ] Deduced a trap composed of 15 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 18:26:39] [INFO ] Deduced a trap composed of 7 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 18:26:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:39] [INFO ] Deduced a trap composed of 16 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 18:26:39] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:39] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:39] [INFO ] Deduced a trap composed of 13 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 18:26:40] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:40] [INFO ] Deduced a trap composed of 13 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 18:26:40] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:40] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:40] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:40] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:41] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:41] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:41] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:44] [INFO ] Deduced a trap composed of 41 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 18:26:44] [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 18:26:44] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:44] [INFO ] Deduced a trap composed of 41 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 18:26:44] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:45] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:45] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:45] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:46] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:46] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:46] [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 18:26:46] [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 18:26:46] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:46] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:46] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:46] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:46] [INFO ] Deduced a trap composed of 23 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 18:26:47] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:47] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:49] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:49] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:49] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:51] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:51] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:51] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:51] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:51] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:52] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:52] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:52] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:52] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:52] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:54] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:55] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:55] [INFO ] Deduced a trap composed of 22 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 18:26:55] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:55] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:55] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:56] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:56] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:56] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:56] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:56] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:57] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 13 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31029 ms. Remains : 242/242 places, 520/520 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 152 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 336 place count 122 transition count 304
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 352 place count 114 transition count 296
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 368 place count 106 transition count 352
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 376 place count 106 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 384 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 98 transition count 344
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 98 transition count 344
Applied a total of 400 rules in 33 ms. Remains 98 /242 variables (removed 144) and now considering 344/520 (removed 176) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 344 rows 98 cols
[2025-06-02 18:26:57] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 18:26:57] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-02 18:26:57] [INFO ] After 119ms 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 18:26:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-06-02 18:26:57] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 18:26:57] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 18:26:57] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 341 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 80 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2025-06-02 18:26:57] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2025-06-02 18:26:57] [INFO ] Computed 74 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:26:57] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-02 18:26:57] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2025-06-02 18:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:26:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:26:58] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:26:58] [INFO ] Redundant transitions in 7 ms returned []
Running 568 sub problems to find dead transitions.
[2025-06-02 18:26:58] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2025-06-02 18:26:58] [INFO ] Invariant cache hit.
[2025-06-02 18:26:58] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 74/324 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:01] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 10 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:01] [INFO ] Deduced a trap composed of 9 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 18:27:01] [INFO ] Deduced a trap composed of 9 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 18:27:01] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:01] [INFO ] Deduced a trap composed of 9 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 18:27:02] [INFO ] Deduced a trap composed of 10 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 18:27:02] [INFO ] Deduced a trap composed of 10 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 18:27:02] [INFO ] Deduced a trap composed of 14 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 18:27:02] [INFO ] Deduced a trap composed of 14 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 18:27:02] [INFO ] Deduced a trap composed of 14 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 18:27:02] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:02] [INFO ] Deduced a trap composed of 14 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 18:27:02] [INFO ] Deduced a trap composed of 17 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 18:27:03] [INFO ] Deduced a trap composed of 17 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 18:27:03] [INFO ] Deduced a trap composed of 10 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 18:27:03] [INFO ] Deduced a trap composed of 17 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 18:27:03] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:03] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:03] [INFO ] Deduced a trap composed of 10 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 18:27:03] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 10 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 20/344 constraints. Problems are: Problem set: 8 solved, 560 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:03] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 8 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:04] [INFO ] Deduced a trap composed of 10 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 18:27:04] [INFO ] Deduced a trap composed of 10 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 18:27:04] [INFO ] Deduced a trap composed of 10 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 18:27:04] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:04] [INFO ] Deduced a trap composed of 10 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 18:27:04] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:04] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:04] [INFO ] Deduced a trap composed of 22 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 18:27:05] [INFO ] Deduced a trap composed of 17 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 18:27:05] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:05] [INFO ] Deduced a trap composed of 22 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 18:27:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:05] [INFO ] Deduced a trap composed of 17 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 18:27:05] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:05] [INFO ] Deduced a trap composed of 22 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 18:27:05] [INFO ] Deduced a trap composed of 17 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 18:27:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:05] [INFO ] Deduced a trap composed of 22 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 18:27:06] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 9 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/364 constraints. Problems are: Problem set: 25 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:08] [INFO ] Deduced a trap composed of 17 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 18:27:08] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:08] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:09] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:09] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:09] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:09] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:09] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:10] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 7 ms to minimize.
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:10] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:10] [INFO ] Deduced a trap composed of 24 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 18:27:10] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:10] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:10] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:11] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:11] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:11] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:11] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:11] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 7 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:11] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 7 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 20/384 constraints. Problems are: Problem set: 41 solved, 527 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:12] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:12] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:13] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:13] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:13] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:13] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:13] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:13] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:14] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:14] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:14] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:14] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:14] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:14] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:15] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:15] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:15] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:15] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:15] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:16] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 20/404 constraints. Problems are: Problem set: 41 solved, 527 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:16] [INFO ] Deduced a trap composed of 24 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 18:27:16] [INFO ] Deduced a trap composed of 24 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 18:27:16] [INFO ] Deduced a trap composed of 24 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 18:27:16] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:17] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:17] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:17] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:17] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:18] [INFO ] Deduced a trap composed of 41 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 18:27:18] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:18] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:18] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:18] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:19] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:19] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:19] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:19] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:19] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:19] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:19] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 10 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 20/424 constraints. Problems are: Problem set: 47 solved, 521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:23] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:23] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:23] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:24] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:24] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:24] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:24] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:24] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:25] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:25] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:25] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:25] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:25] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:26] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:26] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:26] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 3 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:26] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:26] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:26] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:27] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 6 ms to minimize.
Problem TDEAD256 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 20/444 constraints. Problems are: Problem set: 48 solved, 520 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/658 variables, and 444 constraints, problems are : Problem set: 48 solved, 520 unsolved in 30023 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/250 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 520 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 48 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 10/252 constraints. Problems are: Problem set: 48 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 81/333 constraints. Problems are: Problem set: 48 solved, 520 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/333 constraints. Problems are: Problem set: 48 solved, 520 unsolved
At refinement iteration 4 (OVERLAPS) 8/250 variables, 64/397 constraints. Problems are: Problem set: 48 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 8/405 constraints. Problems are: Problem set: 48 solved, 520 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 39/444 constraints. Problems are: Problem set: 48 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:32] [INFO ] Deduced a trap composed of 17 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 18:27:33] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:33] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:33] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:33] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:34] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:34] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:34] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:34] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:35] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:35] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:35] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:35] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:35] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:35] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:36] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:36] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:36] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:36] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:36] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 20/464 constraints. Problems are: Problem set: 48 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:38] [INFO ] Deduced a trap composed of 17 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 18:27:38] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:38] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:39] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:40] [INFO ] Deduced a trap composed of 23 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 18:27:40] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:40] [INFO ] Deduced a trap composed of 24 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 18:27:40] [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 18:27:40] [INFO ] Deduced a trap composed of 24 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 18:27:40] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:41] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:41] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:41] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:42] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:42] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:42] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:42] [INFO ] Deduced a trap composed of 17 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 18:27:42] [INFO ] Deduced a trap composed of 17 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 18:27:43] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 19/483 constraints. Problems are: Problem set: 48 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:44] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:44] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:44] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:47] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 4/487 constraints. Problems are: Problem set: 48 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:48] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:48] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:49] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:49] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:49] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:51] [INFO ] Deduced a trap composed of 17 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 18:27:51] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 7/494 constraints. Problems are: Problem set: 48 solved, 520 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:53] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:54] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:56] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:56] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:56] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:56] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:56] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:56] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:57] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:57] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:57] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:57] [INFO ] Deduced a trap composed of 23 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 18:27:57] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:58] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 16 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 20/514 constraints. Problems are: Problem set: 48 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/658 variables, and 514 constraints, problems are : Problem set: 48 solved, 520 unsolved in 30018 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/250 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 0/568 constraints, Known Traps: 190/190 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 48 solved, 520 unsolved
Search for dead transitions found 48 dead transitions in 60198ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 250/250 places, 528/576 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:27:58] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61002 ms. Remains : 250/250 places, 528/576 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2025-06-02 18:27:59] [INFO ] Flow matrix only has 376 transitions (discarded 152 similar events)
// Phase 1: matrix 376 rows 250 cols
[2025-06-02 18:27:59] [INFO ] Computed 74 invariants in 2 ms
[2025-06-02 18:27:59] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 208/216 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 376/592 variables, 216/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 40/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/626 variables, 34/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 34/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 10/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/626 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 626/626 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 250/250 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 208/216 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 376/592 variables, 216/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 40/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/626 variables, 34/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 34/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 10/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 1/615 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 18:27:59] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 0/616 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 18:27:59] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:59] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 7 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/626 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/626 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 626/626 variables, and 618 constraints, problems are : Problem set: 0 solved, 1 unsolved in 821 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 250/250 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 528/528 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 520
Applied a total of 16 rules in 9 ms. Remains 242 /250 variables (removed 8) and now considering 520/528 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/250 places, 520/528 transitions.
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1037275 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1037275 steps, saw 506673 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2025-06-02 18:28:03] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-02 18:28:03] [INFO ] Computed 74 invariants in 5 ms
[2025-06-02 18:28:03] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/610 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 200/208 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 200/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 368/576 variables, 208/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/610 variables, 34/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 34/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/610 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 599 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Domain max(s): 242/242 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 242/242 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 18:28:03] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:03] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-06-02 18:28:03] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 18:28:04] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:28:04] [INFO ] Redundant transitions in 9 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 18:28:04] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:28:04] [INFO ] Invariant cache hit.
[2025-06-02 18:28:04] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:13] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:13] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:13] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:13] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:13] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:13] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:13] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:14] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:14] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:14] [INFO ] Deduced a trap composed of 7 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 18:28:14] [INFO ] Deduced a trap composed of 10 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 18:28:14] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:14] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:14] [INFO ] Deduced a trap composed of 10 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 18:28:15] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:15] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:15] [INFO ] Deduced a trap composed of 15 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 18:28:15] [INFO ] Deduced a trap composed of 15 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 18:28:15] [INFO ] Deduced a trap composed of 15 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 18:28:15] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:16] [INFO ] Deduced a trap composed of 15 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 18:28:16] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:16] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:16] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:16] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:16] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:16] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:17] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:17] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:17] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:17] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:17] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:17] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:18] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:18] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:18] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:18] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:19] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:19] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:19] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:21] [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 18:28:22] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:22] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:22] [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 18:28:22] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:22] [INFO ] Deduced a trap composed of 41 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 18:28:23] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:23] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:23] [INFO ] Deduced a trap composed of 16 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 18:28:23] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:24] [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 18:28:24] [INFO ] Deduced a trap composed of 16 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 18:28:24] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:24] [INFO ] Deduced a trap composed of 16 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 18:28:24] [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 18:28:24] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:24] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:24] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:25] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:25] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:27] [INFO ] Deduced a trap composed of 23 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 18:28:27] [INFO ] Deduced a trap composed of 22 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 18:28:27] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:27] [INFO ] Deduced a trap composed of 22 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 18:28:28] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:28] [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 18:28:28] [INFO ] Deduced a trap composed of 23 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 18:28:28] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:28] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:28] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:29] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:29] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:29] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:29] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:29] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:29] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:30] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:30] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:30] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:32] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:33] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:33] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:33] [INFO ] Deduced a trap composed of 23 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 18:28:33] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:33] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:33] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:34] [INFO ] Deduced a trap composed of 23 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 18:28:34] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:34] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:34] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:34] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 14 ms to minimize.
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31076 ms. Remains : 242/242 places, 520/520 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 242 transition count 368
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 152 place count 242 transition count 304
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 336 place count 122 transition count 304
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 352 place count 114 transition count 296
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 368 place count 106 transition count 352
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 376 place count 106 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 384 place count 98 transition count 344
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 98 transition count 344
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 98 transition count 344
Applied a total of 400 rules in 34 ms. Remains 98 /242 variables (removed 144) and now considering 344/520 (removed 176) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 344 rows 98 cols
[2025-06-02 18:28:34] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 18:28:34] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-06-02 18:28:34] [INFO ] After 126ms 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 18:28:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-02 18:28:35] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 18:28:35] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 18:28:35] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 330 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3816 reset in 346 ms.
Product exploration explored 100000 steps with 3748 reset in 395 ms.
Built C files in :
/tmp/ltsmin16965906738371915097
[2025-06-02 18:28:36] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2025-06-02 18:28:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:28:36] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2025-06-02 18:28:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:28:36] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2025-06-02 18:28:36] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:28:36] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16965906738371915097
Running compilation step : cd /tmp/ltsmin16965906738371915097;'/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 1499 ms.
Running link step : cd /tmp/ltsmin16965906738371915097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin16965906738371915097;'/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/stateBased5005406921779987110.hoa' '--buchi-type=spotba'
LTSmin run took 2232 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-01 finished in 176379 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 16 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 584/584 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 259 transition count 577
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 252 transition count 577
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 30 place count 244 transition count 569
Applied a total of 30 rules in 16 ms. Remains 244 /259 variables (removed 15) and now considering 569/584 (removed 15) transitions.
[2025-06-02 18:28:40] [INFO ] Flow matrix only has 401 transitions (discarded 168 similar events)
// Phase 1: matrix 401 rows 244 cols
[2025-06-02 18:28:40] [INFO ] Computed 75 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:40] [INFO ] Implicit Places using invariants in 254 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 255 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/259 places, 569/584 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 243 transition count 568
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 568
Applied a total of 2 rules in 9 ms. Remains 242 /243 variables (removed 1) and now considering 568/569 (removed 1) transitions.
[2025-06-02 18:28:40] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2025-06-02 18:28:40] [INFO ] Computed 74 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:40] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-06-02 18:28:40] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:28:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:28:41] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/259 places, 568/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1129 ms. Remains : 242/259 places, 568/584 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-02
Product exploration explored 100000 steps with 15048 reset in 261 ms.
Product exploration explored 100000 steps with 14815 reset in 276 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 169 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2025-06-02 18:28:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:28:43] [INFO ] [Real]Absence check using 74 positive place invariants in 59 ms returned sat
[2025-06-02 18:28:43] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2025-06-02 18:28:43] [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 18:28:43] [INFO ] [Nat]Absence check using 74 positive place invariants in 83 ms returned sat
[2025-06-02 18:28:44] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2025-06-02 18:28:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:28:44] [INFO ] [Nat]Added 48 Read/Feed constraints in 24 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:44] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:44] [INFO ] Deduced a trap composed of 9 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 18:28:44] [INFO ] Deduced a trap composed of 9 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 18:28:44] [INFO ] Deduced a trap composed of 9 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 18:28:45] [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 18:28:45] [INFO ] Deduced a trap composed of 9 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 18:28:45] [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 18:28:45] [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 18:28:45] [INFO ] Deduced a trap composed of 13 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 18:28:45] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:45] [INFO ] Deduced a trap composed of 17 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 18:28:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
[2025-06-02 18:28:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1604 ms
[2025-06-02 18:28:45] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 33 ms.
[2025-06-02 18:28:46] [INFO ] Added : 122 causal constraints over 25 iterations in 1014 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2025-06-02 18:28:46] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:47] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-02 18:28:47] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:28:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:28:47] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:28:47] [INFO ] Redundant transitions in 6 ms returned []
Running 560 sub problems to find dead transitions.
[2025-06-02 18:28:47] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2025-06-02 18:28:47] [INFO ] Invariant cache hit.
[2025-06-02 18:28:47] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 74/316 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:50] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:50] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 10 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:50] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 11 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:50] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 10 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:51] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 10 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:51] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 11 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:51] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:51] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:51] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:51] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:52] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 10 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:52] [INFO ] Deduced a trap composed of 10 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 18:28:52] [INFO ] Deduced a trap composed of 10 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 18:28:52] [INFO ] Deduced a trap composed of 10 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 18:28:52] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:52] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:52] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:53] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:53] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 13 solved, 547 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:53] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:53] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:53] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:53] [INFO ] Deduced a trap composed of 10 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 18:28:54] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:54] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:54] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:54] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:54] [INFO ] Deduced a trap composed of 16 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 18:28:54] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:54] [INFO ] Deduced a trap composed of 16 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 18:28:55] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:55] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:55] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:55] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:55] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:56] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:56] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:56] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 13 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:56] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 7 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 39 solved, 521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:59] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:59] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:59] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:59] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:00] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:00] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:00] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Problem TDEAD162 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:00] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 9 ms to minimize.
Problem TDEAD166 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:00] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:00] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:00] [INFO ] Deduced a trap composed of 41 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 18:29:01] [INFO ] Deduced a trap composed of 41 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 18:29:01] [INFO ] Deduced a trap composed of 41 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 18:29:01] [INFO ] Deduced a trap composed of 41 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 18:29:01] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:01] [INFO ] Deduced a trap composed of 16 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 18:29:01] [INFO ] Deduced a trap composed of 16 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 18:29:01] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:02] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:02] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 6 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 47 solved, 513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:02] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:02] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:03] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:03] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:03] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:03] [INFO ] Deduced a trap composed of 17 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 18:29:03] [INFO ] Deduced a trap composed of 17 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 18:29:04] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:04] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:04] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:04] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:04] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:05] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:05] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:05] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:05] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:05] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:05] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:06] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:06] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 47 solved, 513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:08] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:08] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:08] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 3 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:09] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:09] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:09] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:09] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:09] [INFO ] Deduced a trap composed of 17 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 18:29:09] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:09] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:09] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:10] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:10] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:10] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:10] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:10] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:11] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:11] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:11] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:11] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 16 ms to minimize.
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/416 constraints. Problems are: Problem set: 48 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:16] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:16] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:16] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:17] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:17] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:17] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:17] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:17] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:17] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 10 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 48 solved, 512 unsolved
Search for dead transitions found 48 dead transitions in 30167ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 242/242 places, 520/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:29:17] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 31034 ms. Remains : 242/242 places, 520/568 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2025-06-02 18:29:18] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
// Phase 1: matrix 368 rows 242 cols
[2025-06-02 18:29:18] [INFO ] Computed 74 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:29:18] [INFO ] [Real]Absence check using 74 positive place invariants in 52 ms returned sat
[2025-06-02 18:29:19] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-06-02 18:29:19] [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 18:29:19] [INFO ] [Nat]Absence check using 74 positive place invariants in 44 ms returned sat
[2025-06-02 18:29:20] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-06-02 18:29:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 18:29:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:20] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:20] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:20] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:20] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:21] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:21] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 10 ms to minimize.
[2025-06-02 18:29:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 974 ms
[2025-06-02 18:29:21] [INFO ] Computed and/alt/rep : 248/1368/248 causal constraints (skipped 112 transitions) in 30 ms.
[2025-06-02 18:29:21] [INFO ] Added : 108 causal constraints over 22 iterations in 784 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15079 reset in 244 ms.
Product exploration explored 100000 steps with 14843 reset in 251 ms.
Built C files in :
/tmp/ltsmin8317334559864476804
[2025-06-02 18:29:22] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2025-06-02 18:29:22] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:29:22] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2025-06-02 18:29:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:29:22] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2025-06-02 18:29:22] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:29:22] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8317334559864476804
Running compilation step : cd /tmp/ltsmin8317334559864476804;'/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 1290 ms.
Running link step : cd /tmp/ltsmin8317334559864476804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8317334559864476804;'/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/stateBased2375094645617990308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 16 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 520/520 transitions.
Applied a total of 0 rules in 13 ms. Remains 242 /242 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2025-06-02 18:29:37] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:29:37] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-02 18:29:37] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:29:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 18:29:38] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:29:38] [INFO ] Redundant transitions in 6 ms returned []
Running 512 sub problems to find dead transitions.
[2025-06-02 18:29:38] [INFO ] Flow matrix only has 368 transitions (discarded 152 similar events)
[2025-06-02 18:29:38] [INFO ] Invariant cache hit.
[2025-06-02 18:29:38] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 234/234 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 8/242 variables, 64/308 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:46] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:46] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:47] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:47] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:47] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:47] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:47] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:47] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:47] [INFO ] Deduced a trap composed of 10 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 18:29:48] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:48] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:48] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:48] [INFO ] Deduced a trap composed of 7 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 18:29:48] [INFO ] Deduced a trap composed of 10 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 18:29:48] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:48] [INFO ] Deduced a trap composed of 10 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 18:29:49] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:49] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:49] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:49] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:49] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:49] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:50] [INFO ] Deduced a trap composed of 15 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 18:29:50] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:50] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:50] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:50] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:51] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:51] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:51] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:51] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:51] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:51] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:52] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:52] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:52] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:52] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:52] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:53] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:53] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:56] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:56] [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 18:29:56] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:56] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:56] [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 18:29:56] [INFO ] Deduced a trap composed of 41 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 18:29:56] [INFO ] Deduced a trap composed of 41 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 18:29:57] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:57] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:58] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:58] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:58] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:58] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:58] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:58] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:59] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:59] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:29:59] [INFO ] Deduced a trap composed of 16 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 18:29:59] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:01] [INFO ] Deduced a trap composed of 16 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 18:30:01] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:01] [INFO ] Deduced a trap composed of 16 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 18:30:01] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:01] [INFO ] Deduced a trap composed of 7 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 18:30:01] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:02] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:02] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:02] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:02] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:02] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:02] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:03] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:03] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:03] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:03] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:03] [INFO ] Deduced a trap composed of 23 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 18:30:03] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:04] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:04] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:06] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:06] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:06] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:07] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:07] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:07] [INFO ] Deduced a trap composed of 23 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 18:30:07] [INFO ] Deduced a trap composed of 23 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 18:30:07] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:07] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:08] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:08] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:08] [INFO ] Deduced a trap composed of 23 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 18:30:08] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 15 ms to minimize.
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31006 ms. Remains : 242/242 places, 520/520 transitions.
Built C files in :
/tmp/ltsmin12003694372797864005
[2025-06-02 18:30:08] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2025-06-02 18:30:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:30:08] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2025-06-02 18:30:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:30:08] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2025-06-02 18:30:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:30:08] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12003694372797864005
Running compilation step : cd /tmp/ltsmin12003694372797864005;'/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 1337 ms.
Running link step : cd /tmp/ltsmin12003694372797864005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12003694372797864005;'/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/stateBased9812540939195644514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:30:23] [INFO ] Flatten gal took : 30 ms
[2025-06-02 18:30:23] [INFO ] Flatten gal took : 28 ms
[2025-06-02 18:30:23] [INFO ] Time to serialize gal into /tmp/LTL15338436728767116345.gal : 7 ms
[2025-06-02 18:30:23] [INFO ] Time to serialize properties into /tmp/LTL15825112448292095397.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15338436728767116345.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3637033266990240009.hoa' '-atoms' '/tmp/LTL15825112448292095397.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15825112448292095397.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3637033266990240009.hoa
Detected timeout of ITS tools.
[2025-06-02 18:30:39] [INFO ] Flatten gal took : 27 ms
[2025-06-02 18:30:39] [INFO ] Flatten gal took : 27 ms
[2025-06-02 18:30:39] [INFO ] Time to serialize gal into /tmp/LTL2640080689801198278.gal : 5 ms
[2025-06-02 18:30:39] [INFO ] Time to serialize properties into /tmp/LTL2456961379471352995.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2640080689801198278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2456961379471352995.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((P_ify0_4_1+P_ify0_4_2)+(P_ify0_4_3+P_ify0_4_4))+((P_ify0_4_5+P_ify0_4_6)+(P_ify0_4_7+P_ify0_4_8)))>(((P_sety_9_1+P_sety_9_...239
Formula 0 simplified : FG!"((((P_ify0_4_1+P_ify0_4_2)+(P_ify0_4_3+P_ify0_4_4))+((P_ify0_4_5+P_ify0_4_6)+(P_ify0_4_7+P_ify0_4_8)))>(((P_sety_9_1+P_sety_9_2)...233
Detected timeout of ITS tools.
[2025-06-02 18:30:54] [INFO ] Flatten gal took : 25 ms
[2025-06-02 18:30:54] [INFO ] Applying decomposition
[2025-06-02 18:30:54] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2337180464224289955.txt' '-o' '/tmp/graph2337180464224289955.bin' '-w' '/tmp/graph2337180464224289955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2337180464224289955.bin' '-l' '-1' '-v' '-w' '/tmp/graph2337180464224289955.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:30:54] [INFO ] Decomposing Gal with order
[2025-06-02 18:30:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:30:54] [INFO ] Removed a total of 782 redundant transitions.
[2025-06-02 18:30:54] [INFO ] Flatten gal took : 149 ms
[2025-06-02 18:30:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 411 labels/synchronizations in 28 ms.
[2025-06-02 18:30:54] [INFO ] Time to serialize gal into /tmp/LTL14945387942379634840.gal : 6 ms
[2025-06-02 18:30:54] [INFO ] Time to serialize properties into /tmp/LTL9206869762595685645.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14945387942379634840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9206869762595685645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu18.P_ify0_4_1+gu18.P_ify0_4_2)+(gu18.P_ify0_4_3+gu18.P_ify0_4_4))+((gu18.P_ify0_4_5+gu18.P_ify0_4_6)+(gu18.P_ify0_4_7+gu...319
Formula 0 simplified : FG!"((((gu18.P_ify0_4_1+gu18.P_ify0_4_2)+(gu18.P_ify0_4_3+gu18.P_ify0_4_4))+((gu18.P_ify0_4_5+gu18.P_ify0_4_6)+(gu18.P_ify0_4_7+gu18...313
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-02 finished in 149378 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) U X((X(p1) U ((!p2&&X(p1))||X(G(p1)))))))'
Support contains 24 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:31:09] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 259 cols
[2025-06-02 18:31:09] [INFO ] Computed 75 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:31:10] [INFO ] Implicit Places using invariants in 230 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 239 ms. Remains : 258/259 places, 584/584 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 2 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-03 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 8 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:31:10] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:31:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:31:10] [INFO ] Implicit Places using invariants in 233 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 236 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 258/259 places, 584/584 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-06
Product exploration explored 100000 steps with 6808 reset in 301 ms.
Product exploration explored 100000 steps with 6831 reset in 324 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 63 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-02 18:31:12] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2025-06-02 18:31:12] [INFO ] Computed 74 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using 74 positive place invariants in 74 ms returned sat
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2025-06-02 18:31:12] [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 18:31:13] [INFO ] [Nat]Absence check using 74 positive place invariants in 134 ms returned sat
[2025-06-02 18:31:14] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2025-06-02 18:31:14] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:31:14] [INFO ] [Nat]Added 48 Read/Feed constraints in 84 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:14] [INFO ] Deduced a trap composed of 9 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 18:31:15] [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 18:31:15] [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 18:31:15] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:15] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:15] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:15] [INFO ] Deduced a trap composed of 9 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 18:31:15] [INFO ] Deduced a trap composed of 9 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 18:31:15] [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 18:31:16] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:16] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:16] [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 18:31:16] [INFO ] Deduced a trap composed of 15 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 18:31:16] [INFO ] Deduced a trap composed of 10 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 18:31:16] [INFO ] Deduced a trap composed of 10 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 18:31:16] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:16] [INFO ] Deduced a trap composed of 15 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 18:31:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
[2025-06-02 18:31:16] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2189 ms
[2025-06-02 18:31:16] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 30 ms.
[2025-06-02 18:31:17] [INFO ] Added : 134 causal constraints over 27 iterations in 861 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:31:17] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:31:18] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-02 18:31:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:31:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:31:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:31:18] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2025-06-02 18:31:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:31:18] [INFO ] Invariant cache hit.
[2025-06-02 18:31:18] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 74/332 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:21] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 10 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:21] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 10 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:21] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 9 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:22] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 10 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:22] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 9 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:22] [INFO ] Deduced a trap composed of 9 places in 128 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 18:31:22] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 9 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:22] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 8 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:22] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:22] [INFO ] Deduced a trap composed of 10 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 18:31:22] [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 18:31:23] [INFO ] Deduced a trap composed of 22 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 18:31:23] [INFO ] Deduced a trap composed of 22 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 18:31:23] [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 18:31:23] [INFO ] Deduced a trap composed of 22 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 18:31:23] [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 18:31:23] [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 18:31:23] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:23] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:24] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD324 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/352 constraints. Problems are: Problem set: 13 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:24] [INFO ] Deduced a trap composed of 10 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 18:31:24] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:24] [INFO ] Deduced a trap composed of 10 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 18:31:24] [INFO ] Deduced a trap composed of 10 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 18:31:24] [INFO ] Deduced a trap composed of 10 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 18:31:25] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:25] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:25] [INFO ] Deduced a trap composed of 24 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 18:31:25] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:25] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 11 ms to minimize.
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:26] [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 18:31:26] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:26] [INFO ] Deduced a trap composed of 22 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 18:31:26] [INFO ] Deduced a trap composed of 22 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 18:31:26] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:26] [INFO ] Deduced a trap composed of 15 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 18:31:26] [INFO ] Deduced a trap composed of 15 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 18:31:26] [INFO ] Deduced a trap composed of 15 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 18:31:27] [INFO ] Deduced a trap composed of 17 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 18:31:27] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 5 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/372 constraints. Problems are: Problem set: 29 solved, 547 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:29] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:29] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:29] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:29] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:30] [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 18:31:30] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:30] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:30] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:30] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:30] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:30] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:31] [INFO ] Deduced a trap composed of 22 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 18:31:31] [INFO ] Deduced a trap composed of 22 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 18:31:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Problem TDEAD160 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Problem TDEAD162 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/392 constraints. Problems are: Problem set: 47 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:32] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:33] [INFO ] Deduced a trap composed of 22 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 18:31:33] [INFO ] Deduced a trap composed of 41 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 18:31:33] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:33] [INFO ] Deduced a trap composed of 41 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 18:31:33] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:34] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:34] [INFO ] Deduced a trap composed of 24 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 18:31:34] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 3 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:34] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:35] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:35] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:35] [INFO ] Deduced a trap composed of 17 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 18:31:35] [INFO ] Deduced a trap composed of 17 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 18:31:35] [INFO ] Deduced a trap composed of 17 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 18:31:36] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:36] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:36] [INFO ] Deduced a trap composed of 41 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 18:31:36] [INFO ] Deduced a trap composed of 17 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 18:31:36] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 11 ms to minimize.
Problem TDEAD256 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/412 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:37] [INFO ] Deduced a trap composed of 22 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 18:31:37] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:37] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:37] [INFO ] Deduced a trap composed of 24 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 18:31:38] [INFO ] Deduced a trap composed of 24 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 18:31:38] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:38] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:38] [INFO ] Deduced a trap composed of 24 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 18:31:38] [INFO ] Deduced a trap composed of 24 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 18:31:38] [INFO ] Deduced a trap composed of 24 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 18:31:38] [INFO ] Deduced a trap composed of 24 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 18:31:39] [INFO ] Deduced a trap composed of 17 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 18:31:40] [INFO ] Deduced a trap composed of 41 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 18:31:41] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:41] [INFO ] Deduced a trap composed of 17 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 18:31:41] [INFO ] Deduced a trap composed of 17 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 18:31:41] [INFO ] Deduced a trap composed of 17 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 18:31:41] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:41] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:41] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/432 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:44] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:44] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:45] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:45] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:45] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:45] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:45] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:45] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:45] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:46] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:46] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:46] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:46] [INFO ] Deduced a trap composed of 24 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 18:31:46] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:46] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:47] [INFO ] Deduced a trap composed of 24 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 18:31:47] [INFO ] Deduced a trap composed of 23 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 18:31:47] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:47] [INFO ] Deduced a trap composed of 24 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 18:31:47] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/452 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:48] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:48] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:48] [INFO ] Deduced a trap composed of 24 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 18:31:48] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:48] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/674 variables, and 457 constraints, problems are : Problem set: 48 solved, 528 unsolved in 30015 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/258 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 125/125 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 10/260 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 94/354 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/354 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 4 (OVERLAPS) 8/258 variables, 64/418 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 8/426 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 31/457 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:53] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:53] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:53] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:53] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:54] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:55] [INFO ] Deduced a trap composed of 22 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 18:31:55] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:55] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:56] [INFO ] Deduced a trap composed of 41 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 18:31:56] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:56] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:57] [INFO ] Deduced a trap composed of 23 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 18:31:57] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:57] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:57] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:57] [INFO ] Deduced a trap composed of 24 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 18:31:57] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:58] [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 18:31:58] [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 18:31:58] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 20/477 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:58] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:59] [INFO ] Deduced a trap composed of 17 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 18:31:59] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:31:59] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:00] [INFO ] Deduced a trap composed of 17 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 18:32:00] [INFO ] Deduced a trap composed of 17 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 18:32:01] [INFO ] Deduced a trap composed of 41 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 18:32:02] [INFO ] Deduced a trap composed of 17 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 18:32:02] [INFO ] Deduced a trap composed of 17 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 18:32:02] [INFO ] Deduced a trap composed of 17 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 18:32:02] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:02] [INFO ] Deduced a trap composed of 23 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 18:32:03] [INFO ] Deduced a trap composed of 23 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 18:32:03] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:03] [INFO ] Deduced a trap composed of 24 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 18:32:03] [INFO ] Deduced a trap composed of 24 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 18:32:03] [INFO ] Deduced a trap composed of 25 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 18:32:03] [INFO ] Deduced a trap composed of 23 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 18:32:04] [INFO ] Deduced a trap composed of 25 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 18:32:04] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 20/497 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:06] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:06] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:06] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:08] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:08] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:08] [INFO ] Deduced a trap composed of 23 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 18:32:08] [INFO ] Deduced a trap composed of 24 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 18:32:09] [INFO ] Deduced a trap composed of 24 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 18:32:09] [INFO ] Deduced a trap composed of 23 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 18:32:09] [INFO ] Deduced a trap composed of 24 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 18:32:09] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:09] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:09] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:10] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:10] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:10] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:10] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:10] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:10] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:10] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 20/517 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:11] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:12] [INFO ] Deduced a trap composed of 24 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 18:32:12] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:12] [INFO ] Deduced a trap composed of 24 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 18:32:13] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:14] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:15] [INFO ] Deduced a trap composed of 24 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 18:32:15] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:15] [INFO ] Deduced a trap composed of 24 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 18:32:15] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:16] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:16] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:16] [INFO ] Deduced a trap composed of 24 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 18:32:16] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 14/531 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/674 variables, and 531 constraints, problems are : Problem set: 48 solved, 528 unsolved in 30014 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 0/258 constraints, ReadFeed: 0/48 constraints, PredecessorRefiner: 0/576 constraints, Known Traps: 199/199 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 48 solved, 528 unsolved
Search for dead transitions found 48 dead transitions in 60158ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 258/258 places, 536/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61115 ms. Remains : 258/258 places, 536/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 51 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-02 18:32:19] [INFO ] Flow matrix only has 384 transitions (discarded 152 similar events)
// Phase 1: matrix 384 rows 258 cols
[2025-06-02 18:32:19] [INFO ] Computed 74 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:32:19] [INFO ] [Real]Absence check using 74 positive place invariants in 136 ms returned sat
[2025-06-02 18:32:20] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2025-06-02 18:32:20] [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 18:32:20] [INFO ] [Nat]Absence check using 74 positive place invariants in 64 ms returned sat
[2025-06-02 18:32:21] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2025-06-02 18:32:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 18:32:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 27 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:21] [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 18:32:21] [INFO ] Deduced a trap composed of 9 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 18:32:21] [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 18:32:22] [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 18:32:22] [INFO ] Deduced a trap composed of 9 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 18:32:22] [INFO ] Deduced a trap composed of 10 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 18:32:22] [INFO ] Deduced a trap composed of 9 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 18:32:22] [INFO ] Deduced a trap composed of 9 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 18:32:22] [INFO ] Deduced a trap composed of 10 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 18:32:22] [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 18:32:22] [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 18:32:23] [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 18:32:23] [INFO ] Deduced a trap composed of 9 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 18:32:23] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:23] [INFO ] Deduced a trap composed of 9 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 18:32:23] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:23] [INFO ] Deduced a trap composed of 10 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 18:32:23] [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 18:32:24] [INFO ] Deduced a trap composed of 10 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 18:32:24] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:24] [INFO ] Deduced a trap composed of 9 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 18:32:24] [INFO ] Deduced a trap composed of 10 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 18:32:24] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:24] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:24] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:25] [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 18:32:25] [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 18:32:25] [INFO ] Deduced a trap composed of 14 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 18:32:25] [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 18:32:25] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:25] [INFO ] Deduced a trap composed of 14 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 18:32:25] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:26] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 6 ms to minimize.
[2025-06-02 18:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 34 trap constraints in 4583 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-8-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-06 finished in 75921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:32:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 259 cols
[2025-06-02 18:32:26] [INFO ] Computed 75 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:32:26] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-06-02 18:32:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:32:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:32:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 18:32:27] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2025-06-02 18:32:27] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:32:27] [INFO ] Invariant cache hit.
[2025-06-02 18:32:27] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 75/334 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:29] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 10 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 11 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 10 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:30] [INFO ] Deduced a trap composed of 10 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 18:32:30] [INFO ] Deduced a trap composed of 10 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 18:32:30] [INFO ] Deduced a trap composed of 10 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 18:32:31] [INFO ] Deduced a trap composed of 10 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 18:32:31] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:31] [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 18:32:31] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:31] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:31] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:32] [INFO ] Deduced a trap composed of 17 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 18:32:32] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 20/354 constraints. Problems are: Problem set: 14 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:32] [INFO ] Deduced a trap composed of 10 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 18:32:32] [INFO ] Deduced a trap composed of 10 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 18:32:32] [INFO ] Deduced a trap composed of 10 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 18:32:32] [INFO ] Deduced a trap composed of 15 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 18:32:33] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 11 ms to minimize.
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:33] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:33] [INFO ] Deduced a trap composed of 22 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 18:32:33] [INFO ] Deduced a trap composed of 15 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 18:32:33] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:33] [INFO ] Deduced a trap composed of 22 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 18:32:34] [INFO ] Deduced a trap composed of 15 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 18:32:34] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:34] [INFO ] Deduced a trap composed of 17 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 18:32:34] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 14 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:34] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Problem TDEAD160 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 20/374 constraints. Problems are: Problem set: 43 solved, 533 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:37] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:37] [INFO ] Deduced a trap composed of 10 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 18:32:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:37] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:38] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:38] [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 18:32:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Problem TDEAD166 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:38] [INFO ] Deduced a trap composed of 41 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 18:32:39] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:39] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:39] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:39] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 3 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD332 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:40] [INFO ] Deduced a trap composed of 16 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 18:32:40] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 5 ms to minimize.
Problem TDEAD334 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:40] [INFO ] Deduced a trap composed of 17 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 18:32:40] [INFO ] Deduced a trap composed of 17 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 18:32:40] [INFO ] Deduced a trap composed of 17 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 18:32:40] [INFO ] Deduced a trap composed of 17 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 18:32:40] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 7 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 20/394 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:41] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:41] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:41] [INFO ] Deduced a trap composed of 22 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 18:32:41] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:41] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:42] [INFO ] Deduced a trap composed of 22 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 18:32:43] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:44] [INFO ] Deduced a trap composed of 41 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 18:32:44] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:44] [INFO ] Deduced a trap composed of 17 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 18:32:45] [INFO ] Deduced a trap composed of 17 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 18:32:45] [INFO ] Deduced a trap composed of 17 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 18:32:45] [INFO ] Deduced a trap composed of 17 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 18:32:45] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:45] [INFO ] Deduced a trap composed of 17 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 18:32:45] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:45] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:46] [INFO ] Deduced a trap composed of 24 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 18:32:46] [INFO ] Deduced a trap composed of 24 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 18:32:46] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 20/414 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:47] [INFO ] Deduced a trap composed of 17 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 18:32:48] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:49] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:49] [INFO ] Deduced a trap composed of 24 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 18:32:49] [INFO ] Deduced a trap composed of 24 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 18:32:49] [INFO ] Deduced a trap composed of 24 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 18:32:49] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:50] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:50] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:50] [INFO ] Deduced a trap composed of 24 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 18:32:50] [INFO ] Deduced a trap composed of 24 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 18:32:50] [INFO ] Deduced a trap composed of 24 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 18:32:50] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:50] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:51] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:51] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:51] [INFO ] Deduced a trap composed of 24 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 18:32:51] [INFO ] Deduced a trap composed of 24 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 18:32:51] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:51] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 20/434 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:55] [INFO ] Deduced a trap composed of 24 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 18:32:56] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:56] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:56] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:56] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:56] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 259/675 variables, and 440 constraints, problems are : Problem set: 48 solved, 528 unsolved in 30016 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 0/259 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 106/106 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 10/261 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 73/334 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/334 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 4 (OVERLAPS) 8/259 variables, 65/399 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 8/407 constraints. Problems are: Problem set: 48 solved, 528 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 33/440 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:02] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:02] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:02] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:02] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:02] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:03] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:04] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:04] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:04] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:05] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:05] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:05] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:05] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:05] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:05] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:06] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:06] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 17/457 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:06] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:09] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:09] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:09] [INFO ] Deduced a trap composed of 23 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 18:33:09] [INFO ] Deduced a trap composed of 23 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 18:33:10] [INFO ] Deduced a trap composed of 23 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 18:33:10] [INFO ] Deduced a trap composed of 23 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 18:33:10] [INFO ] Deduced a trap composed of 23 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 18:33:10] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:10] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:11] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:11] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:11] [INFO ] Deduced a trap composed of 25 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 18:33:11] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 14/471 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:14] [INFO ] Deduced a trap composed of 41 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 18:33:15] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/473 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:17] [INFO ] Deduced a trap composed of 17 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 18:33:18] [INFO ] Deduced a trap composed of 17 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 18:33:18] [INFO ] Deduced a trap composed of 41 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 18:33:19] [INFO ] Deduced a trap composed of 17 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 18:33:19] [INFO ] Deduced a trap composed of 24 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 18:33:19] [INFO ] Deduced a trap composed of 24 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 18:33:19] [INFO ] Deduced a trap composed of 24 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 18:33:20] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:20] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:20] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:20] [INFO ] Deduced a trap composed of 24 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 18:33:20] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:20] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 13/486 constraints. Problems are: Problem set: 48 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:21] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:23] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:23] [INFO ] Deduced a trap composed of 24 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 18:33:23] [INFO ] Deduced a trap composed of 24 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 18:33:23] [INFO ] Deduced a trap composed of 24 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 18:33:23] [INFO ] Deduced a trap composed of 23 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 18:33: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 18:33:25] [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 18:33:25] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:26] [INFO ] Deduced a trap composed of 23 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 18:33:26] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:26] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:26] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:26] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:26] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:27] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:27] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:27] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 13 ms to minimize.
SMT process timed out in 60262ms, After SMT, problems are : Problem set: 48 solved, 528 unsolved
Search for dead transitions found 48 dead transitions in 60264ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 259/259 places, 536/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 259 /259 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61126 ms. Remains : 259/259 places, 536/584 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 9636 steps with 0 reset in 27 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-10 finished in 61314 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)))'
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:33:27] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:33:27] [INFO ] Implicit Places using invariants in 238 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 239 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 258/259 places, 584/584 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-12 finished in 352 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))))'
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:33:27] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:33:28] [INFO ] Implicit Places using invariants in 227 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 229 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 258/259 places, 584/584 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-13
Product exploration explored 100000 steps with 454 reset in 240 ms.
Stack based approach found an accepted trace after 4416 steps with 27 reset with depth 413 and stack size 413 in 13 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-13 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(!p1))) U ((X((p0&&X(!p1)))&&G(p0))||X(G((p0&&X(!p1)))))))'
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2025-06-02 18:33:28] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2025-06-02 18:33:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:33:28] [INFO ] Implicit Places using invariants in 234 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/259 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 258/259 places, 584/584 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), true, p1, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-14 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 584/584 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 259 transition count 577
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 252 transition count 577
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 28 place count 245 transition count 570
Applied a total of 28 rules in 17 ms. Remains 245 /259 variables (removed 14) and now considering 570/584 (removed 14) transitions.
[2025-06-02 18:33:28] [INFO ] Flow matrix only has 402 transitions (discarded 168 similar events)
// Phase 1: matrix 402 rows 245 cols
[2025-06-02 18:33:28] [INFO ] Computed 75 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:33:29] [INFO ] Implicit Places using invariants in 249 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 250 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 244/259 places, 570/584 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 244 transition count 569
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 243 transition count 569
Applied a total of 2 rules in 8 ms. Remains 243 /244 variables (removed 1) and now considering 569/570 (removed 1) transitions.
[2025-06-02 18:33:29] [INFO ] Flow matrix only has 401 transitions (discarded 168 similar events)
// Phase 1: matrix 401 rows 243 cols
[2025-06-02 18:33:29] [INFO ] Computed 74 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:33:29] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-02 18:33:29] [INFO ] Flow matrix only has 401 transitions (discarded 168 similar events)
[2025-06-02 18:33:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:33:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 18:33:30] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 243/259 places, 569/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1093 ms. Remains : 243/259 places, 569/584 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 256 ms.
Stack based approach found an accepted trace after 954 steps with 0 reset with depth 955 and stack size 955 in 3 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-15 finished in 1415 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)))'
[2025-06-02 18:33:30] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15927422406030496472
[2025-06-02 18:33:30] [INFO ] Computing symmetric may disable matrix : 584 transitions.
[2025-06-02 18:33:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:33:30] [INFO ] Applying decomposition
[2025-06-02 18:33:30] [INFO ] Computing symmetric may enable matrix : 584 transitions.
[2025-06-02 18:33:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:33:30] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8378547871964871599.txt' '-o' '/tmp/graph8378547871964871599.bin' '-w' '/tmp/graph8378547871964871599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8378547871964871599.bin' '-l' '-1' '-v' '-w' '/tmp/graph8378547871964871599.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:33:30] [INFO ] Decomposing Gal with order
[2025-06-02 18:33:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:33:30] [INFO ] Computing Do-Not-Accords matrix : 584 transitions.
[2025-06-02 18:33:30] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:33:30] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15927422406030496472
Running compilation step : cd /tmp/ltsmin15927422406030496472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 18:33:30] [INFO ] Removed a total of 793 redundant transitions.
[2025-06-02 18:33:30] [INFO ] Flatten gal took : 77 ms
[2025-06-02 18:33:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 533 labels/synchronizations in 23 ms.
[2025-06-02 18:33:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality3136040255844197639.gal : 6 ms
[2025-06-02 18:33:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality17307386584352249603.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3136040255844197639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17307386584352249603.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu14.P_ify0_4_1+gu14.P_ify0_4_2)+(gu14.P_ify0_4_3+gu14.P_ify0_4_4))+((gu14.P_ify0_4_5+gu14.P_ify0_4_6)+(gu14.P_ify0_4_7+gu...319
Formula 0 simplified : FG!"((((gu14.P_ify0_4_1+gu14.P_ify0_4_2)+(gu14.P_ify0_4_3+gu14.P_ify0_4_4))+((gu14.P_ify0_4_5+gu14.P_ify0_4_6)+(gu14.P_ify0_4_7+gu14...313
Compilation finished in 1445 ms.
Running link step : cd /tmp/ltsmin15927422406030496472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15927422406030496472;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 30046 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 577385 ms.
BK_STOP 1748889242402
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-PT-8"
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-PT-8, 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-174876423200699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-8.tgz
mv LamportFastMutEx-PT-8 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 ;