About the Execution of ITS-Tools for PolyORBLF-PT-S02J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFF??FFTFTFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254000412.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 PolyORBLF-PT-S02J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254000412
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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.3K 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 51K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K 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 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 862K 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 PolyORBLF-PT-S02J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748970042139
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 17:00:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 17:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:00:43] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-06-03 17:00:43] [INFO ] Transformed 476 places.
[2025-06-03 17:00:43] [INFO ] Transformed 920 transitions.
[2025-06-03 17:00:43] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2025-06-03 17:00:43] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-03 17:00:43] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-03 17:00:43] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 179 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 469 transition count 819
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 469 transition count 819
Applied a total of 12 rules in 74 ms. Remains 469 /476 variables (removed 7) and now considering 819/824 (removed 5) transitions.
Running 817 sub problems to find dead transitions.
[2025-06-03 17:00:43] [INFO ] Flow matrix only has 807 transitions (discarded 12 similar events)
// Phase 1: matrix 807 rows 469 cols
[2025-06-03 17:00:44] [INFO ] Computed 44 invariants in 59 ms
[2025-06-03 17:00:44] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:51] [INFO ] Deduced a trap composed of 64 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-03 17:00:51] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:51] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:51] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:52] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:54] [INFO ] Deduced a trap composed of 128 places in 2005 ms of which 1813 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:54] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:55] [INFO ] Deduced a trap composed of 212 places in 240 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:55] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:55] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:55] [INFO ] Deduced a trap composed of 223 places in 234 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:56] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:59] [INFO ] Deduced a trap composed of 217 places in 285 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:00:59] [INFO ] Deduced a trap composed of 223 places in 260 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:00] [INFO ] Deduced a trap composed of 235 places in 301 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:02] [INFO ] Deduced a trap composed of 205 places in 260 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1276 variables, and 58 constraints, problems are : Problem set: 0 solved, 817 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/469 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/1276 variables, and 58 constraints, problems are : Problem set: 0 solved, 817 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/469 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40759ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 40783ms
[2025-06-03 17:01:24] [INFO ] Flow matrix only has 807 transitions (discarded 12 similar events)
[2025-06-03 17:01:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:01:25] [INFO ] Implicit Places using invariants in 462 ms returned [112, 238, 275, 278, 429]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 472 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/476 places, 819/824 transitions.
Applied a total of 0 rules in 10 ms. Remains 464 /464 variables (removed 0) and now considering 819/819 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41390 ms. Remains : 464/476 places, 819/824 transitions.
Support contains 179 out of 464 places after structural reductions.
[2025-06-03 17:01:25] [INFO ] Flatten gal took : 91 ms
[2025-06-03 17:01:25] [INFO ] Flatten gal took : 68 ms
[2025-06-03 17:01:25] [INFO ] Input system was already deterministic with 819 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (16 resets) in 1572 ms. (25 steps per ms) remains 6/33 properties
BEST_FIRST walk for 40001 steps (10 resets) in 356 ms. (112 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 214 ms. (186 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 691 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
[2025-06-03 17:01:26] [INFO ] Flow matrix only has 807 transitions (discarded 12 similar events)
// Phase 1: matrix 807 rows 464 cols
[2025-06-03 17:01:26] [INFO ] Computed 39 invariants in 16 ms
[2025-06-03 17:01:26] [INFO ] State equation strengthened by 72 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 275/307 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 67/374 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/382 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 78/460 variables, 20/36 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/462 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 807/1269 variables, 462/500 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1269 variables, 72/572 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1269 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1271 variables, 2/574 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1271 variables, 1/575 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1271 variables, 0/575 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1271 variables, 0/575 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1271/1271 variables, and 575 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1937 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 464/464 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 281/307 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:28] [INFO ] Deduced a trap composed of 211 places in 150 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 67/374 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/382 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 78/460 variables, 20/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:29] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:29] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:29] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:29] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:29] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 5/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/462 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:30] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:30] [INFO ] Deduced a trap composed of 223 places in 269 ms of which 77 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 807/1269 variables, 462/508 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1269 variables, 72/580 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1269 variables, 2/582 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1269 variables, 0/582 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1271 variables, 2/584 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1271 variables, 1/585 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1271 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1271 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1271/1271 variables, and 585 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 464/464 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6994ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 819/819 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 464 transition count 787
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 432 transition count 781
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 426 transition count 781
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 76 place count 426 transition count 733
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 172 place count 378 transition count 733
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 377 transition count 732
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 377 transition count 732
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 256 place count 336 transition count 691
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 259 place count 333 transition count 688
Iterating global reduction 3 with 3 rules applied. Total rules applied 262 place count 333 transition count 688
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 274 place count 333 transition count 676
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 286 place count 321 transition count 676
Applied a total of 286 rules in 160 ms. Remains 321 /464 variables (removed 143) and now considering 676/819 (removed 143) transitions.
Running 674 sub problems to find dead transitions.
[2025-06-03 17:01:33] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
// Phase 1: matrix 664 rows 321 cols
[2025-06-03 17:01:33] [INFO ] Computed 39 invariants in 9 ms
[2025-06-03 17:01:33] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:38] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:38] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:39] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:39] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:39] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:39] [INFO ] Deduced a trap composed of 42 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-03 17:01:39] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:39] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:40] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:41] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:41] [INFO ] Deduced a trap composed of 103 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:44] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:45] [INFO ] Deduced a trap composed of 122 places in 189 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:01:48] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/985 variables, and 45 constraints, problems are : Problem set: 0 solved, 674 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/321 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:01] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:01] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:02] [INFO ] Deduced a trap composed of 130 places in 208 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:02] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:02] [INFO ] Deduced a trap composed of 3 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-03 17:02:03] [INFO ] Deduced a trap composed of 3 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-03 17:02:03] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:03] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:04] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:05] [INFO ] Deduced a trap composed of 116 places in 203 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:05] [INFO ] Deduced a trap composed of 120 places in 201 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:05] [INFO ] Deduced a trap composed of 120 places in 192 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:05] [INFO ] Deduced a trap composed of 120 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:05] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:06] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:09] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:10] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:11] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:11] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 57 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/985 variables, and 65 constraints, problems are : Problem set: 0 solved, 674 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/321 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/674 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40556ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 40559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40721 ms. Remains : 321/464 places, 676/819 transitions.
RANDOM walk for 40000 steps (23 resets) in 392 ms. (101 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 357 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 205305 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :1 out of 3
Probabilistic random walk after 205305 steps, saw 112107 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :1
[2025-06-03 17:02:17] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
[2025-06-03 17:02:17] [INFO ] Invariant cache hit.
[2025-06-03 17:02:17] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/275 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/279 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 39/318 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/319 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 664/983 variables, 319/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 72/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/985 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/985 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/985 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 432 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 321/321 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/275 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/279 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 39/318 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:20] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:20] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:20] [INFO ] Deduced a trap composed of 41 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-03 17:02:20] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:20] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/319 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:02:20] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 664/983 variables, 319/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 72/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/983 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/985 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38155 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 321/321 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40016ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5620 ms.
Support contains 13 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 676/676 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 309 transition count 664
Applied a total of 24 rules in 30 ms. Remains 309 /321 variables (removed 12) and now considering 664/676 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 309/321 places, 664/676 transitions.
RANDOM walk for 40000 steps (22 resets) in 326 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 224600 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 224600 steps, saw 121211 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2025-06-03 17:03:06] [INFO ] Flow matrix only has 652 transitions (discarded 12 similar events)
// Phase 1: matrix 652 rows 309 cols
[2025-06-03 17:03:06] [INFO ] Computed 39 invariants in 13 ms
[2025-06-03 17:03:06] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 182/220 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/276 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/306 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/307 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 652/959 variables, 307/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/959 variables, 72/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/959 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/961 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/961 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/961 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/961 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 961/961 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 309/309 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 182/220 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/276 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/306 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:08] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:08] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:08] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:09] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/307 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 652/959 variables, 307/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/959 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/959 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:11] [INFO ] Deduced a trap composed of 108 places in 201 ms of which 39 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/959 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:03:22] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 34 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/959 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/959 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/961 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/961 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/961 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/961 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 961/961 variables, and 429 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38080 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 309/309 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39773ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 5084 ms.
Support contains 13 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 664/664 transitions.
Applied a total of 0 rules in 16 ms. Remains 309 /309 variables (removed 0) and now considering 664/664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 309/309 places, 664/664 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 664/664 transitions.
Applied a total of 0 rules in 14 ms. Remains 309 /309 variables (removed 0) and now considering 664/664 (removed 0) transitions.
[2025-06-03 17:03:51] [INFO ] Flow matrix only has 652 transitions (discarded 12 similar events)
[2025-06-03 17:03:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:03:52] [INFO ] Implicit Places using invariants in 886 ms returned [273]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 890 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 308/309 places, 664/664 transitions.
Applied a total of 0 rules in 20 ms. Remains 308 /308 variables (removed 0) and now considering 664/664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 924 ms. Remains : 308/309 places, 664/664 transitions.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(X(X(G(p1))))))))'
Support contains 12 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 457 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 457 transition count 812
Applied a total of 14 rules in 41 ms. Remains 457 /464 variables (removed 7) and now considering 812/819 (removed 7) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:03:53] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2025-06-03 17:03:53] [INFO ] Computed 39 invariants in 9 ms
[2025-06-03 17:03:53] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:00] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:00] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:00] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:00] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:00] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:01] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:01] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:01] [INFO ] Deduced a trap composed of 121 places in 185 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:02] [INFO ] Deduced a trap composed of 205 places in 264 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:02] [INFO ] Deduced a trap composed of 15 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-03 17:04:02] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:03] [INFO ] Deduced a trap composed of 222 places in 242 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:05] [INFO ] Deduced a trap composed of 217 places in 253 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:06] [INFO ] Deduced a trap composed of 217 places in 230 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:06] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:07] [INFO ] Deduced a trap composed of 287 places in 263 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:08] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:11] [INFO ] Deduced a trap composed of 233 places in 214 ms of which 54 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40431ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40434ms
[2025-06-03 17:04:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:04:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:04:34] [INFO ] Implicit Places using invariants in 719 ms returned [406]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 727 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/819 transitions.
Applied a total of 0 rules in 6 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41211 ms. Remains : 456/464 places, 812/819 transitions.
Stuttering acceptance computed with spot in 421 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-01 finished in 41727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (p1 U G(p0))))'
Support contains 13 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 457 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 457 transition count 812
Applied a total of 14 rules in 22 ms. Remains 457 /464 variables (removed 7) and now considering 812/819 (removed 7) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:04:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:04:34] [INFO ] Invariant cache hit.
[2025-06-03 17:04:34] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:42] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:42] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:42] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:43] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:43] [INFO ] Deduced a trap composed of 121 places in 238 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:43] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:43] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:44] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:44] [INFO ] Deduced a trap composed of 205 places in 229 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:44] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:45] [INFO ] Deduced a trap composed of 222 places in 260 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:47] [INFO ] Deduced a trap composed of 217 places in 259 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:48] [INFO ] Deduced a trap composed of 217 places in 250 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:48] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:04:51] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 107 ms to minimize.
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 455/1257 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:13] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:14] [INFO ] Deduced a trap composed of 86 places in 243 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40370ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40372ms
[2025-06-03 17:05:15] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:05:16] [INFO ] Implicit Places using invariants in 807 ms returned [406]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 810 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/819 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41215 ms. Remains : 456/464 places, 812/819 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), p0, false, false, true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1908 steps with 640 reset in 95 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-02 finished in 41583 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(X((X((G(p1)&&p0))||(F(p2)&&F(p3)))))))'
Support contains 26 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 793
Reduce places removed 26 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 58 place count 438 transition count 787
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 432 transition count 787
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 64 place count 432 transition count 733
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 172 place count 378 transition count 733
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 377 transition count 732
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 377 transition count 732
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 220 place count 354 transition count 709
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 223 place count 351 transition count 706
Iterating global reduction 3 with 3 rules applied. Total rules applied 226 place count 351 transition count 706
Applied a total of 226 rules in 63 ms. Remains 351 /464 variables (removed 113) and now considering 706/819 (removed 113) transitions.
Running 704 sub problems to find dead transitions.
[2025-06-03 17:05:16] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
// Phase 1: matrix 694 rows 351 cols
[2025-06-03 17:05:16] [INFO ] Computed 39 invariants in 13 ms
[2025-06-03 17:05:16] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:21] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:21] [INFO ] Deduced a trap composed of 46 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-03 17:05:21] [INFO ] Deduced a trap composed of 46 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-03 17:05:21] [INFO ] Deduced a trap composed of 46 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-03 17:05:21] [INFO ] Deduced a trap composed of 46 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-03 17:05:21] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:22] [INFO ] Deduced a trap composed of 34 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-03 17:05:22] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:22] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:23] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:23] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:24] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:24] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:25] [INFO ] Deduced a trap composed of 105 places in 188 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:26] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:26] [INFO ] Deduced a trap composed of 173 places in 222 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:26] [INFO ] Deduced a trap composed of 186 places in 206 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:28] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:35] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1045 variables, and 55 constraints, problems are : Problem set: 0 solved, 704 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:46] [INFO ] Deduced a trap composed of 3 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-03 17:05:47] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:47] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:47] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:05:47] [INFO ] Deduced a trap composed of 149 places in 202 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1045 variables, and 60 constraints, problems are : Problem set: 0 solved, 704 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/704 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40375ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 40377ms
[2025-06-03 17:05:56] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
[2025-06-03 17:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:05:57] [INFO ] Implicit Places using invariants in 956 ms returned [313]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 960 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/464 places, 706/819 transitions.
Applied a total of 0 rules in 20 ms. Remains 350 /350 variables (removed 0) and now considering 706/706 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41423 ms. Remains : 350/464 places, 706/819 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-03
Product exploration explored 100000 steps with 1022 reset in 771 ms.
Stack based approach found an accepted trace after 23758 steps with 260 reset with depth 269 and stack size 269 in 189 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-03 finished in 42554 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 7 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 464 transition count 787
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 432 transition count 781
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 426 transition count 781
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 76 place count 426 transition count 733
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 172 place count 378 transition count 733
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 377 transition count 732
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 377 transition count 732
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 280 place count 324 transition count 679
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 283 place count 321 transition count 676
Iterating global reduction 3 with 3 rules applied. Total rules applied 286 place count 321 transition count 676
Applied a total of 286 rules in 51 ms. Remains 321 /464 variables (removed 143) and now considering 676/819 (removed 143) transitions.
Running 674 sub problems to find dead transitions.
[2025-06-03 17:05:59] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
// Phase 1: matrix 664 rows 321 cols
[2025-06-03 17:05:59] [INFO ] Computed 39 invariants in 12 ms
[2025-06-03 17:05:59] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:03] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:03] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:03] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:03] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:03] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:03] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:04] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:04] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:04] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:04] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:05] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:05] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:09] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:09] [INFO ] Deduced a trap composed of 103 places in 183 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:09] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:10] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:10] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:10] [INFO ] Deduced a trap composed of 109 places in 197 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:15] [INFO ] Deduced a trap composed of 114 places in 204 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:17] [INFO ] Deduced a trap composed of 122 places in 175 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/985 variables, and 57 constraints, problems are : Problem set: 0 solved, 674 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/321 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:29] [INFO ] Deduced a trap composed of 184 places in 175 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/985 variables, and 58 constraints, problems are : Problem set: 0 solved, 674 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/321 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/674 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40363ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 40364ms
[2025-06-03 17:06:39] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
[2025-06-03 17:06:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:06:40] [INFO ] Implicit Places using invariants in 843 ms returned [285]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 847 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/464 places, 676/819 transitions.
Applied a total of 0 rules in 17 ms. Remains 320 /320 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41282 ms. Remains : 320/464 places, 676/819 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-04
Product exploration explored 100000 steps with 1757 reset in 364 ms.
Product exploration explored 100000 steps with 1707 reset in 360 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 169 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 676/676 transitions.
Applied a total of 0 rules in 14 ms. Remains 320 /320 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Running 674 sub problems to find dead transitions.
[2025-06-03 17:06:41] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
// Phase 1: matrix 664 rows 320 cols
[2025-06-03 17:06:41] [INFO ] Computed 38 invariants in 15 ms
[2025-06-03 17:06:41] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:46] [INFO ] Deduced a trap composed of 15 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-03 17:06:46] [INFO ] Deduced a trap composed of 41 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-03 17:06:46] [INFO ] Deduced a trap composed of 42 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-03 17:06:46] [INFO ] Deduced a trap composed of 41 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-03 17:06:46] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:46] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:46] [INFO ] Deduced a trap composed of 41 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-03 17:06:47] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:48] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:48] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:48] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:49] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:06:52] [INFO ] Deduced a trap composed of 122 places in 169 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/984 variables, and 43 constraints, problems are : Problem set: 0 solved, 674 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/320 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:08] [INFO ] Deduced a trap composed of 2 places in 159 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:08] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:08] [INFO ] Deduced a trap composed of 3 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-03 17:07:08] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:09] [INFO ] Deduced a trap composed of 116 places in 223 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:09] [INFO ] Deduced a trap composed of 130 places in 192 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:10] [INFO ] Deduced a trap composed of 116 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:10] [INFO ] Deduced a trap composed of 140 places in 189 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:10] [INFO ] Deduced a trap composed of 127 places in 183 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:10] [INFO ] Deduced a trap composed of 126 places in 168 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:11] [INFO ] Deduced a trap composed of 122 places in 191 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:11] [INFO ] Deduced a trap composed of 126 places in 193 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:12] [INFO ] Deduced a trap composed of 126 places in 189 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:12] [INFO ] Deduced a trap composed of 130 places in 198 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:12] [INFO ] Deduced a trap composed of 127 places in 189 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:12] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:13] [INFO ] Deduced a trap composed of 131 places in 195 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:13] [INFO ] Deduced a trap composed of 135 places in 196 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:15] [INFO ] Deduced a trap composed of 180 places in 195 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:17] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/984 variables, and 63 constraints, problems are : Problem set: 0 solved, 674 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/320 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/674 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40351ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 40354ms
[2025-06-03 17:07:21] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
[2025-06-03 17:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:07:22] [INFO ] Implicit Places using invariants in 871 ms returned []
[2025-06-03 17:07:22] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
[2025-06-03 17:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:07:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:07:27] [INFO ] Implicit Places using invariants and state equation in 4541 ms returned []
Implicit Place search using SMT with State Equation took 5414 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:07:27] [INFO ] Redundant transitions in 54 ms returned []
Running 674 sub problems to find dead transitions.
[2025-06-03 17:07:27] [INFO ] Flow matrix only has 664 transitions (discarded 12 similar events)
[2025-06-03 17:07:27] [INFO ] Invariant cache hit.
[2025-06-03 17:07:27] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:31] [INFO ] Deduced a trap composed of 15 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-03 17:07:32] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:32] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:34] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:34] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:34] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:35] [INFO ] Deduced a trap composed of 103 places in 170 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:38] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:38] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/320 variables, 8/52 constraints. Problems are: Problem set: 66 solved, 608 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:54] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:54] [INFO ] Deduced a trap composed of 103 places in 199 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:55] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:07:55] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/984 variables, and 56 constraints, problems are : Problem set: 66 solved, 608 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/320 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 608 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 14/14 constraints. Problems are: Problem set: 66 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/30 constraints. Problems are: Problem set: 66 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 15/45 constraints. Problems are: Problem set: 66 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/45 constraints. Problems are: Problem set: 66 solved, 608 unsolved
At refinement iteration 4 (OVERLAPS) 2/320 variables, 8/53 constraints. Problems are: Problem set: 66 solved, 608 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 3/56 constraints. Problems are: Problem set: 66 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/984 variables, and 56 constraints, problems are : Problem set: 66 solved, 608 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/320 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/674 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 66 solved, 608 unsolved
Search for dead transitions found 66 dead transitions in 60355ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 320/320 places, 610/676 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 306 transition count 586
Applied a total of 12 rules in 16 ms. Remains 306 /320 variables (removed 14) and now considering 586/610 (removed 24) transitions.
[2025-06-03 17:08:27] [INFO ] Flow matrix only has 574 transitions (discarded 12 similar events)
// Phase 1: matrix 574 rows 306 cols
[2025-06-03 17:08:27] [INFO ] Computed 38 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:08:28] [INFO ] Implicit Places using invariants in 836 ms returned []
[2025-06-03 17:08:28] [INFO ] Flow matrix only has 574 transitions (discarded 12 similar events)
[2025-06-03 17:08:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:08:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:08:32] [INFO ] Implicit Places using invariants and state equation in 3917 ms returned []
Implicit Place search using SMT with State Equation took 4756 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 306/320 places, 586/676 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110983 ms. Remains : 306/320 places, 586/676 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 171 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1758 reset in 297 ms.
Product exploration explored 100000 steps with 1705 reset in 313 ms.
Built C files in :
/tmp/ltsmin13589307017741485416
[2025-06-03 17:08:33] [INFO ] Computing symmetric may disable matrix : 586 transitions.
[2025-06-03 17:08:33] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:08:33] [INFO ] Computing symmetric may enable matrix : 586 transitions.
[2025-06-03 17:08:33] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:08:33] [INFO ] Computing Do-Not-Accords matrix : 586 transitions.
[2025-06-03 17:08:33] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:08:33] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13589307017741485416
Running compilation step : cd /tmp/ltsmin13589307017741485416;'/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 1623 ms.
Running link step : cd /tmp/ltsmin13589307017741485416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin13589307017741485416;'/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/stateBased3327577044627670038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 586/586 transitions.
Applied a total of 0 rules in 19 ms. Remains 306 /306 variables (removed 0) and now considering 586/586 (removed 0) transitions.
Running 584 sub problems to find dead transitions.
[2025-06-03 17:08:48] [INFO ] Flow matrix only has 574 transitions (discarded 12 similar events)
[2025-06-03 17:08:48] [INFO ] Invariant cache hit.
[2025-06-03 17:08:48] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:52] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:52] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:53] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:53] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:53] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:53] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:53] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:53] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:53] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:54] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:54] [INFO ] Deduced a trap composed of 146 places in 176 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:54] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:54] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:54] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:55] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:55] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:55] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:55] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:56] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:56] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:57] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:57] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:57] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:57] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:57] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:58] [INFO ] Deduced a trap composed of 119 places in 148 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:58] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:58] [INFO ] Deduced a trap composed of 170 places in 178 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:58] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:59] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:59] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:59] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:59] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:08:59] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:00] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:00] [INFO ] Deduced a trap composed of 94 places in 201 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:01] [INFO ] Deduced a trap composed of 94 places in 209 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:01] [INFO ] Deduced a trap composed of 127 places in 165 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:01] [INFO ] Deduced a trap composed of 129 places in 176 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:01] [INFO ] Deduced a trap composed of 152 places in 166 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:06] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:07] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:07] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:09] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:09] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 37 ms to minimize.
SMT process timed out in 20300ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 20303ms
[2025-06-03 17:09:09] [INFO ] Flow matrix only has 574 transitions (discarded 12 similar events)
[2025-06-03 17:09:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:09:09] [INFO ] Implicit Places using invariants in 761 ms returned []
[2025-06-03 17:09:09] [INFO ] Flow matrix only has 574 transitions (discarded 12 similar events)
[2025-06-03 17:09:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:09:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:09:13] [INFO ] Implicit Places using invariants and state equation in 3951 ms returned []
Implicit Place search using SMT with State Equation took 4714 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:09:13] [INFO ] Redundant transitions in 13 ms returned []
Running 584 sub problems to find dead transitions.
[2025-06-03 17:09:13] [INFO ] Flow matrix only has 574 transitions (discarded 12 similar events)
[2025-06-03 17:09:13] [INFO ] Invariant cache hit.
[2025-06-03 17:09:13] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:17] [INFO ] Deduced a trap composed of 15 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-03 17:09:17] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:17] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:18] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:18] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:18] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:18] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:18] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:18] [INFO ] Deduced a trap composed of 39 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-03 17:09:19] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:19] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:19] [INFO ] Deduced a trap composed of 40 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-03 17:09:19] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:19] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:20] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:20] [INFO ] Deduced a trap composed of 11 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-03 17:09:20] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:20] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:20] [INFO ] Deduced a trap composed of 119 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:21] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:21] [INFO ] Deduced a trap composed of 105 places in 177 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:22] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:22] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:22] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:22] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:22] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:23] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:23] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:23] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:24] [INFO ] Deduced a trap composed of 133 places in 187 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:24] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:24] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:24] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:24] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:24] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:25] [INFO ] Deduced a trap composed of 94 places in 187 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:26] [INFO ] Deduced a trap composed of 94 places in 192 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:26] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:26] [INFO ] Deduced a trap composed of 129 places in 170 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:26] [INFO ] Deduced a trap composed of 152 places in 156 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:31] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:32] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:32] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:33] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:34] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:34] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:34] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:34] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:34] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:35] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:35] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:36] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:36] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:36] [INFO ] Deduced a trap composed of 128 places in 181 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:37] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:37] [INFO ] Deduced a trap composed of 118 places in 177 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:38] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:38] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:38] [INFO ] Deduced a trap composed of 116 places in 182 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:39] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:39] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:39] [INFO ] Deduced a trap composed of 114 places in 188 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:40] [INFO ] Deduced a trap composed of 116 places in 170 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:40] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:41] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:41] [INFO ] Deduced a trap composed of 94 places in 186 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:42] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:42] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:42] [INFO ] Deduced a trap composed of 127 places in 176 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:42] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:42] [INFO ] Deduced a trap composed of 127 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:43] [INFO ] Deduced a trap composed of 94 places in 199 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:43] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:43] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 41 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/880 variables, and 110 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 74/110 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:50] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:50] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:50] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:50] [INFO ] Deduced a trap composed of 124 places in 163 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:50] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:51] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:51] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:51] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:51] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:51] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:51] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:52] [INFO ] Deduced a trap composed of 124 places in 167 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:57] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:57] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:57] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:57] [INFO ] Deduced a trap composed of 124 places in 167 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:57] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:58] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:58] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:58] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/880 variables, and 130 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 94/94 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85337 ms. Remains : 306/306 places, 586/586 transitions.
Built C files in :
/tmp/ltsmin14029849640754496553
[2025-06-03 17:10:14] [INFO ] Computing symmetric may disable matrix : 586 transitions.
[2025-06-03 17:10:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:10:14] [INFO ] Computing symmetric may enable matrix : 586 transitions.
[2025-06-03 17:10:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:10:14] [INFO ] Computing Do-Not-Accords matrix : 586 transitions.
[2025-06-03 17:10:14] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:10:14] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14029849640754496553
Running compilation step : cd /tmp/ltsmin14029849640754496553;'/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 1480 ms.
Running link step : cd /tmp/ltsmin14029849640754496553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14029849640754496553;'/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/stateBased1283598468395227943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 17:10:29] [INFO ] Flatten gal took : 32 ms
[2025-06-03 17:10:29] [INFO ] Flatten gal took : 30 ms
[2025-06-03 17:10:29] [INFO ] Time to serialize gal into /tmp/LTL4505446123765942074.gal : 7 ms
[2025-06-03 17:10:29] [INFO ] Time to serialize properties into /tmp/LTL3545070356809852088.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/LTL4505446123765942074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6272351213707225461.hoa' '-atoms' '/tmp/LTL3545070356809852088.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...317
Loading property file /tmp/LTL3545070356809852088.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6272351213707225461.hoa
Detected timeout of ITS tools.
[2025-06-03 17:10:44] [INFO ] Flatten gal took : 27 ms
[2025-06-03 17:10:44] [INFO ] Flatten gal took : 26 ms
[2025-06-03 17:10:44] [INFO ] Time to serialize gal into /tmp/LTL17351339281569081345.gal : 7 ms
[2025-06-03 17:10:44] [INFO ] Time to serialize properties into /tmp/LTL8295516685309221448.ltl : 3 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/LTL17351339281569081345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8295516685309221448.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("(((((P_1113_2<1)||(P_1095<1))&&((P_1095<1)||(P_1113_1<1)))&&(((P_1113_5<1)||(P_1095<1))&&((P_1113_4<1)||(P_1095<1))))&&(((P_11...210
Formula 0 simplified : FG!"(((((P_1113_2<1)||(P_1095<1))&&((P_1095<1)||(P_1113_1<1)))&&(((P_1113_5<1)||(P_1095<1))&&((P_1113_4<1)||(P_1095<1))))&&(((P_1113...204
Detected timeout of ITS tools.
[2025-06-03 17:10:59] [INFO ] Flatten gal took : 25 ms
[2025-06-03 17:10:59] [INFO ] Applying decomposition
[2025-06-03 17:10:59] [INFO ] Flatten gal took : 23 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/graph2278360005549144990.txt' '-o' '/tmp/graph2278360005549144990.bin' '-w' '/tmp/graph2278360005549144990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2278360005549144990.bin' '-l' '-1' '-v' '-w' '/tmp/graph2278360005549144990.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:10:59] [INFO ] Decomposing Gal with order
[2025-06-03 17:10:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:11:00] [INFO ] Removed a total of 470 redundant transitions.
[2025-06-03 17:11:00] [INFO ] Flatten gal took : 136 ms
[2025-06-03 17:11:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 270 labels/synchronizations in 24 ms.
[2025-06-03 17:11:00] [INFO ] Time to serialize gal into /tmp/LTL9334171992423479358.gal : 8 ms
[2025-06-03 17:11:00] [INFO ] Time to serialize properties into /tmp/LTL13143082008021326925.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/LTL9334171992423479358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13143082008021326925.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i4.u6.P_1113_2<1)||(i4.u20.P_1095<1))&&((i4.u20.P_1095<1)||(i4.u24.P_1113_1<1)))&&(((i4.u13.P_1113_5<1)||(i4.u20.P_1095<1...292
Formula 0 simplified : FG!"(((((i4.u6.P_1113_2<1)||(i4.u20.P_1095<1))&&((i4.u20.P_1095<1)||(i4.u24.P_1113_1<1)))&&(((i4.u13.P_1113_5<1)||(i4.u20.P_1095<1))...286
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-04 finished in 316202 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&&X(p1)))||X(F((G(F(!p2))||(F(!p2)&&X(X(!p3)))))))))'
Support contains 20 out of 464 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 457 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 457 transition count 812
Applied a total of 14 rules in 21 ms. Remains 457 /464 variables (removed 7) and now considering 812/819 (removed 7) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:11:15] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2025-06-03 17:11:15] [INFO ] Computed 39 invariants in 14 ms
[2025-06-03 17:11:15] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:22] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:22] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:22] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:22] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:23] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:23] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:23] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:24] [INFO ] Deduced a trap composed of 121 places in 198 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:24] [INFO ] Deduced a trap composed of 205 places in 255 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:24] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:24] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:25] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:27] [INFO ] Deduced a trap composed of 217 places in 253 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:28] [INFO ] Deduced a trap composed of 217 places in 233 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:28] [INFO ] Deduced a trap composed of 222 places in 248 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:30] [INFO ] Deduced a trap composed of 287 places in 282 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:31] [INFO ] Deduced a trap composed of 242 places in 297 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:11:33] [INFO ] Deduced a trap composed of 233 places in 228 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40416ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40419ms
[2025-06-03 17:11:55] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:11:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:11:56] [INFO ] Implicit Places using invariants in 766 ms returned [406]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 770 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/819 transitions.
Applied a total of 0 rules in 6 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41218 ms. Remains : 456/464 places, 812/819 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-05
Product exploration explored 100000 steps with 33284 reset in 320 ms.
Product exploration explored 100000 steps with 33341 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 133 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
RANDOM walk for 36699 steps (12 resets) in 461 ms. (79 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR (NOT p2) p0 p1))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 15 factoid took 320 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Support contains 20 out of 456 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 6 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:11:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-03 17:11:58] [INFO ] Computed 38 invariants in 16 ms
[2025-06-03 17:11:58] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:05] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:05] [INFO ] Deduced a trap composed of 64 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-03 17:12:05] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:05] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:05] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:06] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:06] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:06] [INFO ] Deduced a trap composed of 121 places in 203 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:06] [INFO ] Deduced a trap composed of 210 places in 268 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:07] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:07] [INFO ] Deduced a trap composed of 222 places in 273 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:08] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:10] [INFO ] Deduced a trap composed of 217 places in 239 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:10] [INFO ] Deduced a trap composed of 298 places in 246 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:11] [INFO ] Deduced a trap composed of 222 places in 291 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:11] [INFO ] Deduced a trap composed of 227 places in 274 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:12] [INFO ] Deduced a trap composed of 210 places in 271 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:15] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:16] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 15 ms to minimize.
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 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40467ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40468ms
[2025-06-03 17:12:38] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:12:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:12:39] [INFO ] Implicit Places using invariants in 996 ms returned []
[2025-06-03 17:12:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:12:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:12:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:12:45] [INFO ] Implicit Places using invariants and state equation in 6128 ms returned []
Implicit Place search using SMT with State Equation took 7133 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:12:45] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:12:45] [INFO ] Invariant cache hit.
[2025-06-03 17:12:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:52] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:52] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:52] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:53] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:53] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:53] [INFO ] Deduced a trap composed of 121 places in 246 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:54] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:54] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:54] [INFO ] Deduced a trap composed of 210 places in 246 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:55] [INFO ] Deduced a trap composed of 217 places in 233 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:55] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:55] [INFO ] Deduced a trap composed of 222 places in 248 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:58] [INFO ] Deduced a trap composed of 210 places in 235 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:59] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:59] [INFO ] Deduced a trap composed of 222 places in 249 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:12:59] [INFO ] Deduced a trap composed of 227 places in 246 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:00] [INFO ] Deduced a trap composed of 287 places in 254 ms of which 85 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:13:15] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Finished structural reductions in LTL mode , in 1 iterations and 108029 ms. Remains : 456/456 places, 812/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 117 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (11 resets) in 210 ms. (189 steps per ms) remains 2/7 properties
BEST_FIRST walk for 11422 steps (2 resets) in 221 ms. (51 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR (NOT p2) p0 p1))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 15 factoid took 328 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 33393 reset in 316 ms.
Product exploration explored 100000 steps with 33433 reset in 333 ms.
Built C files in :
/tmp/ltsmin6692215887719093225
[2025-06-03 17:13:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6692215887719093225
Running compilation step : cd /tmp/ltsmin6692215887719093225;'/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 1391 ms.
Running link step : cd /tmp/ltsmin6692215887719093225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6692215887719093225;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased798905823463032554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 10 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:14:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:14:03] [INFO ] Invariant cache hit.
[2025-06-03 17:14:03] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:10] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:10] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:10] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:11] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:11] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:11] [INFO ] Deduced a trap composed of 121 places in 234 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:12] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:12] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:12] [INFO ] Deduced a trap composed of 210 places in 229 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:12] [INFO ] Deduced a trap composed of 217 places in 230 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:13] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:13] [INFO ] Deduced a trap composed of 222 places in 218 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:16] [INFO ] Deduced a trap composed of 210 places in 249 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:16] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:17] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:17] [INFO ] Deduced a trap composed of 227 places in 262 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:18] [INFO ] Deduced a trap composed of 287 places in 265 ms of which 85 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40424ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40426ms
[2025-06-03 17:14:43] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:14:44] [INFO ] Implicit Places using invariants in 793 ms returned []
[2025-06-03 17:14:44] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:14:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:14:49] [INFO ] Implicit Places using invariants and state equation in 4792 ms returned []
Implicit Place search using SMT with State Equation took 5587 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:14:49] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:14:49] [INFO ] Invariant cache hit.
[2025-06-03 17:14:49] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:56] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:56] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:56] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:56] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:57] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:57] [INFO ] Deduced a trap composed of 121 places in 232 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:58] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:58] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:58] [INFO ] Deduced a trap composed of 210 places in 248 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:58] [INFO ] Deduced a trap composed of 217 places in 247 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:59] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:14:59] [INFO ] Deduced a trap composed of 222 places in 236 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:02] [INFO ] Deduced a trap composed of 210 places in 220 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:02] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:03] [INFO ] Deduced a trap composed of 222 places in 241 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:03] [INFO ] Deduced a trap composed of 227 places in 262 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:04] [INFO ] Deduced a trap composed of 287 places in 257 ms of which 85 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:15:19] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 53 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Finished structural reductions in LTL mode , in 1 iterations and 106392 ms. Remains : 456/456 places, 812/812 transitions.
Built C files in :
/tmp/ltsmin3974931551258426864
[2025-06-03 17:15:49] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3974931551258426864
Running compilation step : cd /tmp/ltsmin3974931551258426864;'/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 1401 ms.
Running link step : cd /tmp/ltsmin3974931551258426864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3974931551258426864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2594231667663477049.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 17:16:05] [INFO ] Flatten gal took : 30 ms
[2025-06-03 17:16:05] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:16:05] [INFO ] Time to serialize gal into /tmp/LTL11042784835359873002.gal : 4 ms
[2025-06-03 17:16:05] [INFO ] Time to serialize properties into /tmp/LTL4928757258530768916.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/LTL11042784835359873002.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13450442348695781443.hoa' '-atoms' '/tmp/LTL4928757258530768916.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/LTL4928757258530768916.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13450442348695781443.hoa
Detected timeout of ITS tools.
[2025-06-03 17:16:20] [INFO ] Flatten gal took : 27 ms
[2025-06-03 17:16:20] [INFO ] Flatten gal took : 28 ms
[2025-06-03 17:16:20] [INFO ] Time to serialize gal into /tmp/LTL17468799394843750222.gal : 5 ms
[2025-06-03 17:16:20] [INFO ] Time to serialize properties into /tmp/LTL10134867123301099191.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/LTL17468799394843750222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10134867123301099191.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((RunB_3>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_1>=1)))||((RunB_6>=1)||(RunB_4>=1)))")&&(X("((((QueueJobE_2>=1)||(QueueJob...1264
Formula 0 simplified : F(G(!"((((RunB_3>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_1>=1)))||((RunB_6>=1)||(RunB_4>=1)))" | X!"((((QueueJobE_2>=1)||(QueueJobE_3...1242
Detected timeout of ITS tools.
[2025-06-03 17:16:35] [INFO ] Flatten gal took : 28 ms
[2025-06-03 17:16:35] [INFO ] Applying decomposition
[2025-06-03 17:16:35] [INFO ] Flatten gal took : 28 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/graph7953839771527001423.txt' '-o' '/tmp/graph7953839771527001423.bin' '-w' '/tmp/graph7953839771527001423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7953839771527001423.bin' '-l' '-1' '-v' '-w' '/tmp/graph7953839771527001423.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:16:35] [INFO ] Decomposing Gal with order
[2025-06-03 17:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:16:35] [INFO ] Removed a total of 670 redundant transitions.
[2025-06-03 17:16:35] [INFO ] Flatten gal took : 81 ms
[2025-06-03 17:16:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 19 ms.
[2025-06-03 17:16:35] [INFO ] Time to serialize gal into /tmp/LTL11989436149728140650.gal : 7 ms
[2025-06-03 17:16:35] [INFO ] Time to serialize properties into /tmp/LTL4269520732053715497.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11989436149728140650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4269520732053715497.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((i1.i1.u20.RunB_3>=1)||(i4.u81.RunB_5>=1))||((i1.i2.u74.RunB_2>=1)||(i5.i1.u88.RunB_1>=1)))||((i1.i0.u70.RunB_6>=1)||(i7....1786
Formula 0 simplified : F(G(!"((((i1.i1.u20.RunB_3>=1)||(i4.u81.RunB_5>=1))||((i1.i2.u74.RunB_2>=1)||(i5.i1.u88.RunB_1>=1)))||((i1.i0.u70.RunB_6>=1)||(i7.i1...1764
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-05 finished in 335451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X((!p0 U (p1 U X(!p2))))||G(p3)) U X(!p0)))'
Support contains 35 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 818
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 818
Applied a total of 2 rules in 17 ms. Remains 463 /464 variables (removed 1) and now considering 818/819 (removed 1) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-03 17:16:50] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 463 cols
[2025-06-03 17:16:50] [INFO ] Computed 39 invariants in 15 ms
[2025-06-03 17:16:50] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:57] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:57] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:57] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:58] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:58] [INFO ] Deduced a trap composed of 127 places in 244 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:58] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:58] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:59] [INFO ] Deduced a trap composed of 211 places in 240 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:16:59] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:00] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:00] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:01] [INFO ] Deduced a trap composed of 223 places in 274 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:02] [INFO ] Deduced a trap composed of 223 places in 248 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:03] [INFO ] Deduced a trap composed of 217 places in 264 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:04] [INFO ] Deduced a trap composed of 223 places in 260 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:04] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:04] [INFO ] Deduced a trap composed of 205 places in 212 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:05] [INFO ] Deduced a trap composed of 288 places in 279 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:06] [INFO ] Deduced a trap composed of 288 places in 259 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:07] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 2.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 6.0)
(s342 0.0)
(s343 9.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 timeout
1.0)
(s451 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/1269 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/463 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/1269 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/463 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40416ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40417ms
[2025-06-03 17:17:31] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 17:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:17:31] [INFO ] Implicit Places using invariants in 725 ms returned [412]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 731 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/464 places, 818/819 transitions.
Applied a total of 0 rules in 6 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41173 ms. Remains : 462/464 places, 818/819 transitions.
Stuttering acceptance computed with spot in 652 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND p3 (NOT p0)), true, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p0)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), p3]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 128 steps with 40 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-06 finished in 41866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 54 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 464 transition count 787
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 432 transition count 781
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 426 transition count 781
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 76 place count 426 transition count 757
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 124 place count 402 transition count 757
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 401 transition count 756
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 401 transition count 756
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 366 transition count 721
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 199 place count 363 transition count 718
Iterating global reduction 3 with 3 rules applied. Total rules applied 202 place count 363 transition count 718
Applied a total of 202 rules in 57 ms. Remains 363 /464 variables (removed 101) and now considering 718/819 (removed 101) transitions.
Running 716 sub problems to find dead transitions.
[2025-06-03 17:17:32] [INFO ] Flow matrix only has 706 transitions (discarded 12 similar events)
// Phase 1: matrix 706 rows 363 cols
[2025-06-03 17:17:32] [INFO ] Computed 39 invariants in 11 ms
[2025-06-03 17:17:32] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 716 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 716 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:37] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:38] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:38] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:38] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:38] [INFO ] Deduced a trap composed of 48 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-03 17:17:38] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:38] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:38] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:39] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:39] [INFO ] Deduced a trap composed of 145 places in 199 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:40] [INFO ] Deduced a trap composed of 150 places in 211 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:41] [INFO ] Deduced a trap composed of 157 places in 210 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:41] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:43] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:43] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:46] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:17:46] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 716 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1069 variables, and 54 constraints, problems are : Problem set: 0 solved, 716 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 716/716 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 716 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 716 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 716 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 716 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1069 variables, and 54 constraints, problems are : Problem set: 0 solved, 716 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/716 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40377ms problems are : Problem set: 0 solved, 716 unsolved
Search for dead transitions found 0 dead transitions in 40379ms
[2025-06-03 17:18:12] [INFO ] Flow matrix only has 706 transitions (discarded 12 similar events)
[2025-06-03 17:18:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:18:13] [INFO ] Implicit Places using invariants in 1004 ms returned [322]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/464 places, 718/819 transitions.
Applied a total of 0 rules in 17 ms. Remains 362 /362 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41471 ms. Remains : 362/464 places, 718/819 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-07
Product exploration explored 100000 steps with 772 reset in 714 ms.
Stack based approach found an accepted trace after 5327 steps with 33 reset with depth 290 and stack size 290 in 39 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-07 finished in 42293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))||(F(G(!p2))&&(X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))))))'
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 457 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 457 transition count 812
Applied a total of 14 rules in 12 ms. Remains 457 /464 variables (removed 7) and now considering 812/819 (removed 7) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:18:14] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2025-06-03 17:18:14] [INFO ] Computed 39 invariants in 8 ms
[2025-06-03 17:18:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:22] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:22] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:22] [INFO ] Deduced a trap composed of 64 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-03 17:18:22] [INFO ] Deduced a trap composed of 64 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-03 17:18:22] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:23] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:23] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:23] [INFO ] Deduced a trap composed of 121 places in 196 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:24] [INFO ] Deduced a trap composed of 205 places in 253 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:24] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:24] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:24] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:27] [INFO ] Deduced a trap composed of 217 places in 253 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:28] [INFO ] Deduced a trap composed of 217 places in 245 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:28] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:29] [INFO ] Deduced a trap composed of 287 places in 278 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:30] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:18:32] [INFO ] Deduced a trap composed of 233 places in 227 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40437ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40454ms
[2025-06-03 17:18:55] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:18:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:18:56] [INFO ] Implicit Places using invariants in 749 ms returned [406]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 765 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/819 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41238 ms. Remains : 456/464 places, 812/819 transitions.
Stuttering acceptance computed with spot in 254 ms :[p0, (AND p2 p0), p0, p0, p0, p0, p0]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-09
Product exploration explored 100000 steps with 37 reset in 317 ms.
Stack based approach found an accepted trace after 967 steps with 4 reset with depth 952 and stack size 952 in 3 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-09 finished in 41873 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)||G(p1))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 464 transition count 775
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 420 transition count 775
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 88 place count 420 transition count 727
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 184 place count 372 transition count 727
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 371 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 371 transition count 726
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 292 place count 318 transition count 673
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 315 transition count 670
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 315 transition count 670
Applied a total of 298 rules in 63 ms. Remains 315 /464 variables (removed 149) and now considering 670/819 (removed 149) transitions.
Running 668 sub problems to find dead transitions.
[2025-06-03 17:18:56] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
// Phase 1: matrix 658 rows 315 cols
[2025-06-03 17:18:56] [INFO ] Computed 39 invariants in 7 ms
[2025-06-03 17:18:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:01] [INFO ] Deduced a trap composed of 15 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-03 17:19:01] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:01] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:01] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:01] [INFO ] Deduced a trap composed of 41 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-03 17:19:02] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:02] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:02] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:03] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:03] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:03] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:04] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:07] [INFO ] Deduced a trap composed of 103 places in 194 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:07] [INFO ] Deduced a trap composed of 114 places in 217 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:13] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:13] [INFO ] Deduced a trap composed of 116 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:15] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:15] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/973 variables, and 55 constraints, problems are : Problem set: 0 solved, 668 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/973 variables, and 55 constraints, problems are : Problem set: 0 solved, 668 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40486ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 40521ms
[2025-06-03 17:19:37] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
[2025-06-03 17:19:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:19:38] [INFO ] Implicit Places using invariants in 896 ms returned [279]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 899 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/464 places, 670/819 transitions.
Applied a total of 0 rules in 15 ms. Remains 314 /314 variables (removed 0) and now considering 670/670 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41501 ms. Remains : 314/464 places, 670/819 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-11
Product exploration explored 100000 steps with 56 reset in 335 ms.
Stack based approach found an accepted trace after 781 steps with 0 reset with depth 782 and stack size 779 in 3 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-11 finished in 41909 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((X(X(p0))&&F(p1)))))))'
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 813
Applied a total of 12 rules in 9 ms. Remains 458 /464 variables (removed 6) and now considering 813/819 (removed 6) transitions.
Running 811 sub problems to find dead transitions.
[2025-06-03 17:19:38] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
// Phase 1: matrix 801 rows 458 cols
[2025-06-03 17:19:38] [INFO ] Computed 39 invariants in 15 ms
[2025-06-03 17:19:38] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:45] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:45] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:45] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:45] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:45] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:46] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:46] [INFO ] Deduced a trap composed of 122 places in 224 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:46] [INFO ] Deduced a trap composed of 218 places in 231 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:46] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:47] [INFO ] Deduced a trap composed of 15 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-03 17:19:47] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:47] [INFO ] Deduced a trap composed of 223 places in 250 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:49] [INFO ] Deduced a trap composed of 194 places in 244 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:49] [INFO ] Deduced a trap composed of 243 places in 241 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:51] [INFO ] Deduced a trap composed of 235 places in 255 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:52] [INFO ] Deduced a trap composed of 223 places in 254 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:19:54] [INFO ] Deduced a trap composed of 87 places in 225 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1259 variables, and 48 constraints, problems are : Problem set: 0 solved, 811 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/458 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 811/811 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/1259 variables, and 48 constraints, problems are : Problem set: 0 solved, 811 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/458 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/811 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40383ms problems are : Problem set: 0 solved, 811 unsolved
Search for dead transitions found 0 dead transitions in 40385ms
[2025-06-03 17:20:18] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
[2025-06-03 17:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:20:19] [INFO ] Implicit Places using invariants in 765 ms returned [407]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 767 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/464 places, 813/819 transitions.
Applied a total of 0 rules in 7 ms. Remains 457 /457 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41169 ms. Remains : 457/464 places, 813/819 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-12
Product exploration explored 100000 steps with 16666 reset in 225 ms.
Product exploration explored 100000 steps with 16666 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (11 resets) in 171 ms. (232 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (9 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
[2025-06-03 17:20:21] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
// Phase 1: matrix 801 rows 457 cols
[2025-06-03 17:20:21] [INFO ] Computed 38 invariants in 11 ms
[2025-06-03 17:20:21] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 295/1258 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 3/17 constraints, Generalized P Invariants (flows): 0/21 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 813/813 transitions.
Applied a total of 0 rules in 8 ms. Remains 457 /457 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Running 811 sub problems to find dead transitions.
[2025-06-03 17:20:21] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
[2025-06-03 17:20:21] [INFO ] Invariant cache hit.
[2025-06-03 17:20:21] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:30] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:30] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:31] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:31] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:31] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:32] [INFO ] Deduced a trap composed of 122 places in 245 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:32] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:32] [INFO ] Deduced a trap composed of 206 places in 245 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:33] [INFO ] Deduced a trap composed of 15 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-03 17:20:33] [INFO ] Deduced a trap composed of 223 places in 232 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:33] [INFO ] Deduced a trap composed of 288 places in 266 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:34] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:35] [INFO ] Deduced a trap composed of 205 places in 253 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:36] [INFO ] Deduced a trap composed of 218 places in 258 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:37] [INFO ] Deduced a trap composed of 223 places in 254 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 235 places in 269 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:20:38] [INFO ] Deduced a trap composed of 223 places in 235 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1258 variables, and 53 constraints, problems are : Problem set: 0 solved, 811 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 811/811 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1258 variables, and 53 constraints, problems are : Problem set: 0 solved, 811 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/811 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40345ms problems are : Problem set: 0 solved, 811 unsolved
Search for dead transitions found 0 dead transitions in 40346ms
[2025-06-03 17:21:02] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
[2025-06-03 17:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:21:02] [INFO ] Implicit Places using invariants in 838 ms returned []
[2025-06-03 17:21:02] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
[2025-06-03 17:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:21:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:21:07] [INFO ] Implicit Places using invariants and state equation in 4650 ms returned []
Implicit Place search using SMT with State Equation took 5490 ms to find 0 implicit places.
Running 811 sub problems to find dead transitions.
[2025-06-03 17:21:07] [INFO ] Flow matrix only has 801 transitions (discarded 12 similar events)
[2025-06-03 17:21:07] [INFO ] Invariant cache hit.
[2025-06-03 17:21:07] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:16] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:16] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:16] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:16] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:17] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:17] [INFO ] Deduced a trap composed of 122 places in 243 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:18] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:18] [INFO ] Deduced a trap composed of 206 places in 259 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:18] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:18] [INFO ] Deduced a trap composed of 223 places in 229 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:19] [INFO ] Deduced a trap composed of 288 places in 263 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:19] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:21] [INFO ] Deduced a trap composed of 205 places in 243 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:22] [INFO ] Deduced a trap composed of 218 places in 241 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:23] [INFO ] Deduced a trap composed of 223 places in 230 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:23] [INFO ] Deduced a trap composed of 235 places in 245 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:21:23] [INFO ] Deduced a trap composed of 223 places in 247 ms of which 54 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 3.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 4.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 5.0)
timeout
(s337 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1258 variables, and 53 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 811/811 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 811 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 811 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:01] [INFO ] Deduced a trap composed of 299 places in 278 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:06] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 53 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1258 variables, and 55 constraints, problems are : Problem set: 0 solved, 811 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/811 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 811 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in LTL mode , in 1 iterations and 106260 ms. Remains : 457/457 places, 813/813 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 20818 steps (7 resets) in 73 ms. (281 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 232 ms.
Product exploration explored 100000 steps with 16666 reset in 246 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 813/813 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 457 transition count 813
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 36 place count 457 transition count 867
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 88 place count 457 transition count 867
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 100 place count 445 transition count 855
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 112 place count 445 transition count 855
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 161 place count 445 transition count 855
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 181 place count 425 transition count 835
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 201 place count 425 transition count 835
Deduced a syphon composed of 108 places in 0 ms
Applied a total of 201 rules in 69 ms. Remains 425 /457 variables (removed 32) and now considering 835/813 (removed -22) transitions.
Running 833 sub problems to find dead transitions.
[2025-06-03 17:22:10] [INFO ] Flow matrix only has 823 transitions (discarded 12 similar events)
// Phase 1: matrix 823 rows 425 cols
[2025-06-03 17:22:10] [INFO ] Computed 38 invariants in 17 ms
[2025-06-03 17:22:10] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:16] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:16] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:17] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:17] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:17] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:17] [INFO ] Deduced a trap composed of 15 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-03 17:22:17] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:17] [INFO ] Deduced a trap composed of 25 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-03 17:22:18] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 48 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:19] [INFO ] Deduced a trap composed of 110 places in 226 ms of which 47 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:20] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:20] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 21 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:21] [INFO ] Deduced a trap composed of 180 places in 218 ms of which 43 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:25] [INFO ] Deduced a trap composed of 105 places in 244 ms of which 45 ms to minimize.
Problem TDEAD687 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:25] [INFO ] Deduced a trap composed of 111 places in 234 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:25] [INFO ] Deduced a trap composed of 116 places in 226 ms of which 50 ms to minimize.
Problem TDEAD691 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 16/52 constraints. Problems are: Problem set: 150 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1248 variables, and 52 constraints, problems are : Problem set: 150 solved, 683 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/425 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 150 solved, 683 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 6/6 constraints. Problems are: Problem set: 150 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 11/17 constraints. Problems are: Problem set: 150 solved, 683 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 16/33 constraints. Problems are: Problem set: 150 solved, 683 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 1/34 constraints. Problems are: Problem set: 150 solved, 683 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/34 constraints. Problems are: Problem set: 150 solved, 683 unsolved
At refinement iteration 5 (OVERLAPS) 30/357 variables, 5/39 constraints. Problems are: Problem set: 150 solved, 683 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 4/43 constraints. Problems are: Problem set: 150 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1248 variables, and 43 constraints, problems are : Problem set: 150 solved, 683 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/27 constraints, State Equation: 0/425 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40495ms problems are : Problem set: 150 solved, 683 unsolved
Search for dead transitions found 150 dead transitions in 40496ms
Found 150 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 150 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 150 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:22:50] [INFO ] Redundant transitions in 7 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 425/457 places, 685/813 transitions.
Graph (complete) has 1936 edges and 425 vertex of which 329 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.3 ms
Discarding 96 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 1 ms
Applied a total of 1 rules in 15 ms. Remains 329 /425 variables (removed 96) and now considering 685/685 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 329/457 places, 685/813 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40599 ms. Remains : 329/457 places, 685/813 transitions.
Built C files in :
/tmp/ltsmin10851568155846751977
[2025-06-03 17:22:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10851568155846751977
Running compilation step : cd /tmp/ltsmin10851568155846751977;'/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 1385 ms.
Running link step : cd /tmp/ltsmin10851568155846751977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10851568155846751977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14266978856613537959.hoa' '--buchi-type=spotba'
LTSmin run took 200 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-12 finished in 194027 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)))||(X(p2)&&p1))))'
Support contains 7 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 457 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 457 transition count 812
Applied a total of 14 rules in 14 ms. Remains 457 /464 variables (removed 7) and now considering 812/819 (removed 7) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:22:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2025-06-03 17:22:52] [INFO ] Computed 39 invariants in 16 ms
[2025-06-03 17:22:52] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:59] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:22:59] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:00] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:00] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:00] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:00] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:01] [INFO ] Deduced a trap composed of 86 places in 218 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:01] [INFO ] Deduced a trap composed of 121 places in 203 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:01] [INFO ] Deduced a trap composed of 205 places in 275 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:02] [INFO ] Deduced a trap composed of 15 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-03 17:23:02] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:02] [INFO ] Deduced a trap composed of 222 places in 236 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:04] [INFO ] Deduced a trap composed of 217 places in 251 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:05] [INFO ] Deduced a trap composed of 217 places in 249 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:06] [INFO ] Deduced a trap composed of 222 places in 249 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:07] [INFO ] Deduced a trap composed of 287 places in 279 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:08] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:10] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 56 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40436ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40439ms
[2025-06-03 17:23:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:23:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:23:33] [INFO ] Implicit Places using invariants in 889 ms returned []
[2025-06-03 17:23:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:23:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:23:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:23:39] [INFO ] Implicit Places using invariants and state equation in 5415 ms returned []
Implicit Place search using SMT with State Equation took 6307 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:23:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:23:39] [INFO ] Invariant cache hit.
[2025-06-03 17:23:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:46] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:47] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:47] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:47] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:47] [INFO ] Deduced a trap composed of 121 places in 235 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:48] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:48] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:48] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:48] [INFO ] Deduced a trap composed of 205 places in 237 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:49] [INFO ] Deduced a trap composed of 15 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-03 17:23:49] [INFO ] Deduced a trap composed of 222 places in 244 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:52] [INFO ] Deduced a trap composed of 217 places in 219 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:53] [INFO ] Deduced a trap composed of 217 places in 240 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:53] [INFO ] Deduced a trap composed of 222 places in 216 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:23:56] [INFO ] Deduced a trap composed of 233 places in 291 ms of which 109 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:03] [INFO ] Deduced a trap composed of 205 places in 231 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:05] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:08] [INFO ] Deduced a trap composed of 276 places in 265 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:08] [INFO ] Deduced a trap composed of 282 places in 272 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:09] [INFO ] Deduced a trap composed of 287 places in 275 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:09] [INFO ] Deduced a trap composed of 298 places in 282 ms of which 89 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:29] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:30] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 52 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Starting structural reductions in LTL mode, iteration 1 : 457/464 places, 812/819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107135 ms. Remains : 457/464 places, 812/819 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-13
Stuttering criterion allowed to conclude after 636 steps with 2 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-13 finished in 107350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||(F(p0)&&X(p2)))))'
Support contains 6 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 459 transition count 814
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 459 transition count 814
Applied a total of 10 rules in 18 ms. Remains 459 /464 variables (removed 5) and now considering 814/819 (removed 5) transitions.
Running 812 sub problems to find dead transitions.
[2025-06-03 17:24:40] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
// Phase 1: matrix 802 rows 459 cols
[2025-06-03 17:24:40] [INFO ] Computed 39 invariants in 8 ms
[2025-06-03 17:24:40] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:46] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:46] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:46] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:46] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:46] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:47] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:47] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:47] [INFO ] Deduced a trap composed of 123 places in 208 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:48] [INFO ] Deduced a trap composed of 207 places in 264 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:48] [INFO ] Deduced a trap composed of 15 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-03 17:24:49] [INFO ] Deduced a trap composed of 223 places in 263 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:51] [INFO ] Deduced a trap composed of 219 places in 237 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:52] [INFO ] Deduced a trap composed of 217 places in 254 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:52] [INFO ] Deduced a trap composed of 223 places in 258 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:52] [INFO ] Deduced a trap composed of 235 places in 268 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:24:52] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/457 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/1261 variables, and 53 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/459 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/457 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:16] [INFO ] Deduced a trap composed of 205 places in 268 ms of which 77 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/1261 variables, and 54 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/459 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/812 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40405ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 40406ms
[2025-06-03 17:25:20] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2025-06-03 17:25:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:25:21] [INFO ] Implicit Places using invariants in 758 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 761 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/464 places, 814/819 transitions.
Applied a total of 0 rules in 6 ms. Remains 458 /458 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41193 ms. Remains : 458/464 places, 814/819 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-14
Stuttering criterion allowed to conclude after 863 steps with 1 reset in 3 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-14 finished in 41364 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))))'
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 457 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 457 transition count 812
Applied a total of 14 rules in 21 ms. Remains 457 /464 variables (removed 7) and now considering 812/819 (removed 7) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 17:25:21] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 457 cols
[2025-06-03 17:25:21] [INFO ] Computed 39 invariants in 12 ms
[2025-06-03 17:25:21] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:28] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:28] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:28] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:28] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:29] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:29] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:29] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:30] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:30] [INFO ] Deduced a trap composed of 205 places in 255 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:30] [INFO ] Deduced a trap composed of 15 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-03 17:25:30] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:31] [INFO ] Deduced a trap composed of 222 places in 241 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:33] [INFO ] Deduced a trap composed of 217 places in 254 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:34] [INFO ] Deduced a trap composed of 217 places in 241 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:34] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:35] [INFO ] Deduced a trap composed of 287 places in 243 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:36] [INFO ] Deduced a trap composed of 242 places in 246 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:25:39] [INFO ] Deduced a trap composed of 233 places in 201 ms of which 54 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1257 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/457 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40383ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40385ms
[2025-06-03 17:26:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 17:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:26:02] [INFO ] Implicit Places using invariants in 1013 ms returned [406]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1016 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/464 places, 812/819 transitions.
Applied a total of 0 rules in 7 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41432 ms. Remains : 456/464 places, 812/819 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-15 finished in 41706 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)))'
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&&X(p1)))||X(F((G(F(!p2))||(F(!p2)&&X(X(!p3)))))))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J04T06-LTLFireability-05
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Support contains 20 out of 464 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 464/464 places, 819/819 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 464 transition count 787
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 432 transition count 781
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 426 transition count 781
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 76 place count 426 transition count 733
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 172 place count 378 transition count 733
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 377 transition count 732
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 377 transition count 732
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 232 place count 348 transition count 703
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 235 place count 345 transition count 700
Iterating global reduction 3 with 3 rules applied. Total rules applied 238 place count 345 transition count 700
Applied a total of 238 rules in 59 ms. Remains 345 /464 variables (removed 119) and now considering 700/819 (removed 119) transitions.
Running 698 sub problems to find dead transitions.
[2025-06-03 17:26:03] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
// Phase 1: matrix 688 rows 345 cols
[2025-06-03 17:26:03] [INFO ] Computed 39 invariants in 12 ms
[2025-06-03 17:26:03] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 45 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-03 17:26:08] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:08] [INFO ] Deduced a trap composed of 120 places in 182 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:09] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:09] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:11] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:11] [INFO ] Deduced a trap composed of 152 places in 198 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:13] [INFO ] Deduced a trap composed of 115 places in 188 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:15] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:23] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 23 ms to minimize.
SMT process timed out in 20464ms, After SMT, problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 20466ms
[2025-06-03 17:26:23] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:26:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:26:24] [INFO ] Implicit Places using invariants in 913 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 929 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 344/464 places, 700/819 transitions.
Applied a total of 0 rules in 8 ms. Remains 344 /344 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 21464 ms. Remains : 344/464 places, 700/819 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J04T06-LTLFireability-05
Product exploration explored 100000 steps with 33434 reset in 288 ms.
Product exploration explored 100000 steps with 33262 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 146 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (15 resets) in 197 ms. (202 steps per ms) remains 2/7 properties
BEST_FIRST walk for 17884 steps (7 resets) in 72 ms. (244 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR (NOT p2) p0 p1))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 15 factoid took 360 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Support contains 20 out of 344 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 700/700 transitions.
Applied a total of 0 rules in 6 ms. Remains 344 /344 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Running 698 sub problems to find dead transitions.
[2025-06-03 17:26:26] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
// Phase 1: matrix 688 rows 344 cols
[2025-06-03 17:26:26] [INFO ] Computed 38 invariants in 11 ms
[2025-06-03 17:26:26] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:31] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:31] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:31] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:31] [INFO ] Deduced a trap composed of 3 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-03 17:26:32] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:32] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:32] [INFO ] Deduced a trap composed of 45 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-03 17:26:32] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:32] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:33] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:36] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:36] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:38] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:39] [INFO ] Deduced a trap composed of 100 places in 179 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:39] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:41] [INFO ] Deduced a trap composed of 115 places in 212 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:45] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:26:45] [INFO ] Deduced a trap composed of 132 places in 196 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1032 variables, and 54 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:01] [INFO ] Deduced a trap composed of 202 places in 218 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 55 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40361ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 40362ms
[2025-06-03 17:27:06] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:27:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:27:07] [INFO ] Implicit Places using invariants in 941 ms returned []
[2025-06-03 17:27:07] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:27:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:27:12] [INFO ] Implicit Places using invariants and state equation in 4976 ms returned []
Implicit Place search using SMT with State Equation took 5939 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2025-06-03 17:27:12] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:27:12] [INFO ] Invariant cache hit.
[2025-06-03 17:27:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:17] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:17] [INFO ] Deduced a trap composed of 46 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-03 17:27:17] [INFO ] Deduced a trap composed of 3 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-03 17:27:18] [INFO ] Deduced a trap composed of 45 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-03 17:27:18] [INFO ] Deduced a trap composed of 45 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-03 17:27:18] [INFO ] Deduced a trap composed of 120 places in 192 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:18] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:18] [INFO ] Deduced a trap composed of 45 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-03 17:27:19] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:20] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:20] [INFO ] Deduced a trap composed of 115 places in 188 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:22] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:24] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:26] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:39] [INFO ] Deduced a trap composed of 202 places in 193 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1032 variables, and 51 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:54] [INFO ] Deduced a trap composed of 127 places in 205 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:27:55] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 53 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Finished structural reductions in LTL mode , in 1 iterations and 106684 ms. Remains : 344/344 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 122 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (15 resets) in 193 ms. (206 steps per ms) remains 2/7 properties
BEST_FIRST walk for 15459 steps (2 resets) in 71 ms. (214 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p0)))), (F p1), (F (NOT (OR (NOT p2) p0 p1))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 15 factoid took 389 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 33324 reset in 311 ms.
Product exploration explored 100000 steps with 33412 reset in 327 ms.
Built C files in :
/tmp/ltsmin577865108287558504
[2025-06-03 17:28:15] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin577865108287558504
Running compilation step : cd /tmp/ltsmin577865108287558504;'/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 1191 ms.
Running link step : cd /tmp/ltsmin577865108287558504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin577865108287558504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15860853968404840340.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 700/700 transitions.
Applied a total of 0 rules in 6 ms. Remains 344 /344 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Running 698 sub problems to find dead transitions.
[2025-06-03 17:28:30] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:28:30] [INFO ] Invariant cache hit.
[2025-06-03 17:28:30] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:35] [INFO ] Deduced a trap composed of 15 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-03 17:28:35] [INFO ] Deduced a trap composed of 46 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-03 17:28:35] [INFO ] Deduced a trap composed of 3 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-03 17:28:35] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:35] [INFO ] Deduced a trap composed of 45 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-03 17:28:36] [INFO ] Deduced a trap composed of 120 places in 191 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:36] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:36] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:36] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:38] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:38] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:40] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:42] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:44] [INFO ] Deduced a trap composed of 115 places in 187 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1032 variables, and 50 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:58] [INFO ] Deduced a trap composed of 127 places in 217 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:28:58] [INFO ] Deduced a trap composed of 132 places in 198 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:01] [INFO ] Deduced a trap composed of 202 places in 191 ms of which 46 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 53 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40388ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 40390ms
[2025-06-03 17:29:10] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:29:11] [INFO ] Implicit Places using invariants in 935 ms returned []
[2025-06-03 17:29:11] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:29:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 17:29:16] [INFO ] Implicit Places using invariants and state equation in 4369 ms returned []
Implicit Place search using SMT with State Equation took 5308 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2025-06-03 17:29:16] [INFO ] Flow matrix only has 688 transitions (discarded 12 similar events)
[2025-06-03 17:29:16] [INFO ] Invariant cache hit.
[2025-06-03 17:29:16] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:21] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:21] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:21] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:21] [INFO ] Deduced a trap composed of 45 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-03 17:29:21] [INFO ] Deduced a trap composed of 45 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-03 17:29:21] [INFO ] Deduced a trap composed of 120 places in 205 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:22] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:22] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:22] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:24] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:24] [INFO ] Deduced a trap composed of 115 places in 188 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:25] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:28] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:30] [INFO ] Deduced a trap composed of 115 places in 206 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:42] [INFO ] Deduced a trap composed of 202 places in 176 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1032 variables, and 51 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:58] [INFO ] Deduced a trap composed of 127 places in 194 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:29:58] [INFO ] Deduced a trap composed of 132 places in 196 ms of which 42 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1032 variables, and 53 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/344 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Finished structural reductions in LTL mode , in 1 iterations and 106078 ms. Remains : 344/344 places, 700/700 transitions.
Built C files in :
/tmp/ltsmin15052576958210424082
[2025-06-03 17:30:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15052576958210424082
Running compilation step : cd /tmp/ltsmin15052576958210424082;'/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 1207 ms.
Running link step : cd /tmp/ltsmin15052576958210424082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15052576958210424082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14818887136688077323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 17:30:31] [INFO ] Flatten gal took : 24 ms
[2025-06-03 17:30:31] [INFO ] Flatten gal took : 27 ms
[2025-06-03 17:30:31] [INFO ] Time to serialize gal into /tmp/LTL11217590582068656468.gal : 4 ms
[2025-06-03 17:30:31] [INFO ] Time to serialize properties into /tmp/LTL3876452177468833410.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11217590582068656468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut800398141814064802.hoa' '-atoms' '/tmp/LTL3876452177468833410.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...317
Loading property file /tmp/LTL3876452177468833410.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut800398141814064802.hoa
Detected timeout of ITS tools.
[2025-06-03 17:30:46] [INFO ] Flatten gal took : 22 ms
[2025-06-03 17:30:46] [INFO ] Flatten gal took : 25 ms
[2025-06-03 17:30:46] [INFO ] Time to serialize gal into /tmp/LTL1509484599134569443.gal : 4 ms
[2025-06-03 17:30:46] [INFO ] Time to serialize properties into /tmp/LTL4591741183524049023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1509484599134569443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4591741183524049023.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(("((((RunB_3>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_1>=1)))||((RunB_6>=1)||(RunB_4>=1)))")&&(X("((((QueueJobE_2>=1)||(QueueJob...1264
Formula 0 simplified : F(G(!"((((RunB_3>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_1>=1)))||((RunB_6>=1)||(RunB_4>=1)))" | X!"((((QueueJobE_2>=1)||(QueueJobE_3...1242
Detected timeout of ITS tools.
[2025-06-03 17:31:01] [INFO ] Flatten gal took : 22 ms
[2025-06-03 17:31:01] [INFO ] Applying decomposition
[2025-06-03 17:31:01] [INFO ] Flatten gal took : 21 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/graph7015906950847162822.txt' '-o' '/tmp/graph7015906950847162822.bin' '-w' '/tmp/graph7015906950847162822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7015906950847162822.bin' '-l' '-1' '-v' '-w' '/tmp/graph7015906950847162822.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:31:01] [INFO ] Decomposing Gal with order
[2025-06-03 17:31:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:31:01] [INFO ] Removed a total of 502 redundant transitions.
[2025-06-03 17:31:02] [INFO ] Flatten gal took : 47 ms
[2025-06-03 17:31:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 9 ms.
[2025-06-03 17:31:02] [INFO ] Time to serialize gal into /tmp/LTL4994709405597583036.gal : 5 ms
[2025-06-03 17:31:02] [INFO ] Time to serialize properties into /tmp/LTL15751931185309978532.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/LTL4994709405597583036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15751931185309978532.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((u15.RunB_3>=1)||(u15.RunB_5>=1))||((u15.RunB_2>=1)||(i0.u28.RunB_1>=1)))||((u15.RunB_6>=1)||(i0.u7.RunB_4>=1)))")&&(X("(...1635
Formula 0 simplified : F(G(!"((((u15.RunB_3>=1)||(u15.RunB_5>=1))||((u15.RunB_2>=1)||(i0.u28.RunB_1>=1)))||((u15.RunB_6>=1)||(i0.u7.RunB_4>=1)))" | X!"((((...1613
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T06-LTLFireability-05 finished in 313939 ms.
[2025-06-03 17:31:17] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4581999960939486494
[2025-06-03 17:31:17] [INFO ] Computing symmetric may disable matrix : 819 transitions.
[2025-06-03 17:31:17] [INFO ] Applying decomposition
[2025-06-03 17:31:17] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:31:17] [INFO ] Computing symmetric may enable matrix : 819 transitions.
[2025-06-03 17:31:17] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:31:17] [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/graph5332905234751452107.txt' '-o' '/tmp/graph5332905234751452107.bin' '-w' '/tmp/graph5332905234751452107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5332905234751452107.bin' '-l' '-1' '-v' '-w' '/tmp/graph5332905234751452107.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:31:17] [INFO ] Decomposing Gal with order
[2025-06-03 17:31:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:31:17] [INFO ] Removed a total of 619 redundant transitions.
[2025-06-03 17:31:17] [INFO ] Flatten gal took : 47 ms
[2025-06-03 17:31:17] [INFO ] Computing Do-Not-Accords matrix : 819 transitions.
[2025-06-03 17:31:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 8 ms.
[2025-06-03 17:31:17] [INFO ] Time to serialize gal into /tmp/LTLFireability17896801646789542710.gal : 7 ms
[2025-06-03 17:31:17] [INFO ] Time to serialize properties into /tmp/LTLFireability14325784189826624843.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17896801646789542710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14325784189826624843.ltl' '-c' '-stutter-deadlock'
[2025-06-03 17:31:17] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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...278
Read 2 LTL properties
[2025-06-03 17:31:17] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4581999960939486494
Running compilation step : cd /tmp/ltsmin4581999960939486494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Checking formula 0 : !((G(F("(((((u68.P_1113_2<1)||(u68.P_1095<1))&&((u68.P_1095<1)||(u68.P_1113_1<1)))&&(((u68.P_1113_5<1)||(u68.P_1095<1))&&((u68.P_1113_...258
Formula 0 simplified : FG!"(((((u68.P_1113_2<1)||(u68.P_1095<1))&&((u68.P_1095<1)||(u68.P_1113_1<1)))&&(((u68.P_1113_5<1)||(u68.P_1095<1))&&((u68.P_1113_4<...252
Compilation finished in 2368 ms.
Running link step : cd /tmp/ltsmin4581999960939486494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4581999960939486494;'/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'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4581999960939486494;'/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'
Running LTSmin : cd /tmp/ltsmin4581999960939486494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(((LTLAPp1==true)&&X((LTLAPp2==true))))||X(<>(([](<>(!(LTLAPp3==true)))||(<>(!(LTLAPp3==true))&&X(X(!(LTLAPp4==true)))))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254000412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;