About the Execution of ITS-Tools for PolyORBNT-PT-S05J20
| 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 | FFFTF?FFTFFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254400635.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 PolyORBNT-PT-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254400635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 164K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 PolyORBNT-PT-S05J20-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749081003937
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 23:50:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 23:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 23:50:05] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-06-04 23:50:05] [INFO ] Transformed 349 places.
[2025-06-04 23:50:05] [INFO ] Transformed 1210 transitions.
[2025-06-04 23:50:05] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 270 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 345 transition count 555
Applied a total of 4 rules in 46 ms. Remains 345 /349 variables (removed 4) and now considering 555/555 (removed 0) transitions.
Running 549 sub problems to find dead transitions.
[2025-06-04 23:50:05] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 345 cols
[2025-06-04 23:50:05] [INFO ] Computed 58 invariants in 31 ms
[2025-06-04 23:50:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
At refinement iteration 3 (OVERLAPS) 7/345 variables, 7/58 constraints. Problems are: Problem set: 95 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:18] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:19] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 2/60 constraints. Problems are: Problem set: 95 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/60 constraints. Problems are: Problem set: 95 solved, 454 unsolved
SMT process timed out in 20645ms, After SMT, problems are : Problem set: 95 solved, 454 unsolved
Search for dead transitions found 95 dead transitions in 20670ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2025-06-04 23:50:26] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 345 cols
[2025-06-04 23:50:26] [INFO ] Computed 58 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:50:26] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-04 23:50:26] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2025-06-04 23:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:50:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:50:27] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 345/349 places, 460/555 transitions.
Applied a total of 0 rules in 5 ms. Remains 345 /345 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21714 ms. Remains : 345/349 places, 460/555 transitions.
Support contains 270 out of 345 places after structural reductions.
[2025-06-04 23:50:27] [INFO ] Flatten gal took : 69 ms
[2025-06-04 23:50:27] [INFO ] Flatten gal took : 38 ms
[2025-06-04 23:50:27] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 249 out of 345 places (down from 270) after GAL structural reductions.
RANDOM walk for 40000 steps (2763 resets) in 1750 ms. (22 steps per ms) remains 9/36 properties
BEST_FIRST walk for 40004 steps (712 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (726 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (496 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40005 steps (696 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (992 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (695 resets) in 225 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (725 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (614 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (127 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
[2025-06-04 23:50:28] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2025-06-04 23:50:28] [INFO ] Invariant cache hit.
[2025-06-04 23:50:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 2 (OVERLAPS) 165/302 variables, 42/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp35 is UNSAT
After SMT solving in domain Real declared 344/801 variables, and 58 constraints, problems are : Problem set: 9 solved, 0 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/345 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&(F(!(p1 U p0))||G(!p1))))'
Support contains 148 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 343 transition count 459
Applied a total of 3 rules in 19 ms. Remains 343 /345 variables (removed 2) and now considering 459/460 (removed 1) transitions.
Running 453 sub problems to find dead transitions.
[2025-06-04 23:50:29] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2025-06-04 23:50:29] [INFO ] Computed 57 invariants in 16 ms
[2025-06-04 23:50:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:39] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:39] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:40] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:40] [INFO ] Deduced a trap composed of 145 places in 235 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:41] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:41] [INFO ] Deduced a trap composed of 145 places in 175 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:41] [INFO ] Deduced a trap composed of 77 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-04 23:50:41] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 41 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:42] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:47] [INFO ] Deduced a trap composed of 125 places in 162 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:47] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:47] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:48] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/798 variables, and 70 constraints, problems are : Problem set: 0 solved, 453 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:58] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:58] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:59] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:59] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:59] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:59] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:50:59] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 33 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:00] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:02] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:03] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:03] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:03] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:03] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:03] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:03] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:04] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:04] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:04] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:04] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:04] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 25 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 20/90 constraints. Problems are: Problem set: 1 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/798 variables, and 90 constraints, problems are : Problem set: 1 solved, 452 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40300ms problems are : Problem set: 1 solved, 452 unsolved
Search for dead transitions found 1 dead transitions in 40302ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2025-06-04 23:51:09] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 343 cols
[2025-06-04 23:51:09] [INFO ] Computed 57 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:51:10] [INFO ] Implicit Places using invariants in 414 ms returned []
[2025-06-04 23:51:10] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-04 23:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:51:11] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 343/345 places, 458/460 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 342 transition count 458
Applied a total of 1 rules in 14 ms. Remains 342 /343 variables (removed 1) and now considering 458/458 (removed 0) transitions.
[2025-06-04 23:51:11] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 342 cols
[2025-06-04 23:51:11] [INFO ] Computed 56 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:51:12] [INFO ] Implicit Places using invariants in 332 ms returned []
[2025-06-04 23:51:12] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-04 23:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:51:14] [INFO ] Implicit Places using invariants and state equation in 2462 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 342/345 places, 458/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45362 ms. Remains : 342/345 places, 458/460 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) p1), p0, (AND p1 p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-01
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-01 finished in 45743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||X((G(p1) U (p0&&G(p1))))) U X(X((p2 U p0))))))'
Support contains 49 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 344 transition count 460
Applied a total of 1 rules in 16 ms. Remains 344 /345 variables (removed 1) and now considering 460/460 (removed 0) transitions.
Running 454 sub problems to find dead transitions.
[2025-06-04 23:51:15] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2025-06-04 23:51:15] [INFO ] Computed 57 invariants in 5 ms
[2025-06-04 23:51:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (OVERLAPS) 6/344 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:25] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:26] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:26] [INFO ] Deduced a trap composed of 145 places in 244 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:26] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:27] [INFO ] Deduced a trap composed of 145 places in 221 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:27] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:27] [INFO ] Deduced a trap composed of 145 places in 193 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:27] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:27] [INFO ] Deduced a trap composed of 145 places in 191 ms of which 68 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:29] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:29] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:29] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:29] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:29] [INFO ] Deduced a trap composed of 125 places in 173 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:32] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/800 variables, and 72 constraints, problems are : Problem set: 0 solved, 454 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/344 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (OVERLAPS) 6/344 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:41] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:41] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:42] [INFO ] Deduced a trap composed of 108 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-04 23:51:42] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:42] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:42] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:42] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:42] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:43] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:43] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:43] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:43] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:43] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:44] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:44] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:44] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:44] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:44] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:51:44] [INFO ] Deduced a trap composed of 125 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-04 23:51:45] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/800 variables, and 92 constraints, problems are : Problem set: 0 solved, 454 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/344 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/454 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40199ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 40201ms
[2025-06-04 23:51:55] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2025-06-04 23:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:51:55] [INFO ] Implicit Places using invariants in 454 ms returned []
[2025-06-04 23:51:55] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2025-06-04 23:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:51:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:51:57] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2463 ms to find 0 implicit places.
Running 454 sub problems to find dead transitions.
[2025-06-04 23:51:57] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2025-06-04 23:51:57] [INFO ] Invariant cache hit.
[2025-06-04 23:51:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (OVERLAPS) 6/344 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:07] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:07] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:08] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:08] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:08] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:08] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:08] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:09] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:09] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:14] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:14] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:14] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:14] [INFO ] Deduced a trap composed of 145 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:14] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:14] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:15] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:15] [INFO ] Deduced a trap composed of 145 places in 136 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (OVERLAPS) 456/800 variables, 344/418 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/800 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 800/800 variables, and 419 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 344/344 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (OVERLAPS) 6/344 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:32] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:32] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:32] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:32] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:33] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:33] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:33] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:33] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:33] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:33] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 25 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:34] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:35] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:35] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:35] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:35] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:35] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:36] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:36] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:36] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:52:37] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 14 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 20/94 constraints. Problems are: Problem set: 1 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/800 variables, and 94 constraints, problems are : Problem set: 1 solved, 453 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/344 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/454 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 1 solved, 453 unsolved
Search for dead transitions found 1 dead transitions in 60193ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 344/345 places, 459/460 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 343 transition count 459
Applied a total of 1 rules in 10 ms. Remains 343 /344 variables (removed 1) and now considering 459/459 (removed 0) transitions.
[2025-06-04 23:52:58] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2025-06-04 23:52:58] [INFO ] Computed 56 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:52:58] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-04 23:52:58] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2025-06-04 23:52:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:53:01] [INFO ] Implicit Places using invariants and state equation in 3174 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 343/345 places, 459/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106445 ms. Remains : 343/345 places, 459/460 transitions.
Stuttering acceptance computed with spot in 467 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-04
Stuttering criterion allowed to conclude after 72 steps with 14 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-04 finished in 106952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 22 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 455
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 339 transition count 455
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 10 place count 339 transition count 430
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 60 place count 314 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 313 transition count 429
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 313 transition count 429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 311 transition count 427
Applied a total of 66 rules in 68 ms. Remains 311 /345 variables (removed 34) and now considering 427/460 (removed 33) transitions.
Running 421 sub problems to find dead transitions.
[2025-06-04 23:53:02] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
// Phase 1: matrix 423 rows 311 cols
[2025-06-04 23:53:02] [INFO ] Computed 57 invariants in 7 ms
[2025-06-04 23:53:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:04] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:05] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:05] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:05] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:05] [INFO ] Deduced a trap composed of 95 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-04 23:53:06] [INFO ] Deduced a trap composed of 97 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-04 23:53:06] [INFO ] Deduced a trap composed of 97 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-04 23:53:06] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:06] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:06] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:06] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:07] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:07] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:07] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:07] [INFO ] Deduced a trap composed of 97 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-04 23:53:07] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:08] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:08] [INFO ] Deduced a trap composed of 95 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-04 23:53:08] [INFO ] Deduced a trap composed of 97 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-04 23:53:08] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:09] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:09] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:09] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:10] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:10] [INFO ] Deduced a trap composed of 97 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-04 23:53:10] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:10] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:11] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:11] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:11] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:11] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:11] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:11] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:12] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:12] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:12] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:13] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:13] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:13] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:13] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:17] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:17] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:17] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:17] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:19] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:20] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:20] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:20] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:20] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:20] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:20] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:21] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:21] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:22] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:22] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/734 variables, and 107 constraints, problems are : Problem set: 0 solved, 421 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/311 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 55/107 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:25] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:25] [INFO ] Deduced a trap composed of 135 places in 146 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:25] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:25] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:25] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:26] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:26] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:26] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:26] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:26] [INFO ] Deduced a trap composed of 97 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-04 23:53:26] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:27] [INFO ] Deduced a trap composed of 97 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-04 23:53:27] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:27] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:27] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:27] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:27] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:28] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:28] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:28] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:30] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:31] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:31] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:31] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:31] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:31] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:31] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:31] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:32] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:32] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:32] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:32] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:32] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:33] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:33] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:33] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:33] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:33] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:33] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:33] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:37] [INFO ] Deduced a trap composed of 120 places in 157 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:37] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:37] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:38] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:38] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:38] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:39] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:39] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:39] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:39] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:39] [INFO ] Deduced a trap composed of 97 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-04 23:53:39] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:39] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:40] [INFO ] Deduced a trap composed of 97 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-04 23:53:40] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:40] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:40] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:40] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:41] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:41] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/734 variables, and 167 constraints, problems are : Problem set: 0 solved, 421 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/311 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/421 constraints, Known Traps: 115/115 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40210ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 40212ms
[2025-06-04 23:53:42] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
[2025-06-04 23:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:53:42] [INFO ] Implicit Places using invariants in 380 ms returned []
[2025-06-04 23:53:42] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
[2025-06-04 23:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:53:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:53:44] [INFO ] Implicit Places using invariants and state equation in 2080 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:53:44] [INFO ] Redundant transitions in 32 ms returned []
Running 421 sub problems to find dead transitions.
[2025-06-04 23:53:44] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
[2025-06-04 23:53:44] [INFO ] Invariant cache hit.
[2025-06-04 23:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:47] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:47] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:48] [INFO ] Deduced a trap composed of 95 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-04 23:53:48] [INFO ] Deduced a trap composed of 95 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-04 23:53:48] [INFO ] Deduced a trap composed of 97 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-04 23:53:48] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:49] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:50] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:51] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:51] [INFO ] Deduced a trap composed of 97 places in 169 ms of which 56 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:52] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:52] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:52] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:52] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:53] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:53] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:54] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:54] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:54] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:55] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:53:55] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:00] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:00] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:00] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:00] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:02] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:02] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:02] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:03] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:03] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:03] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:03] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:04] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:04] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:04] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:04] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:04] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:05] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:05] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:05] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:05] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:05] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:06] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:06] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:06] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:07] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:08] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:08] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:08] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:08] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:08] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:09] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:09] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:09] [INFO ] Deduced a trap composed of 97 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-04 23:54:10] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:10] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:10] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:10] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:10] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:10] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:11] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:11] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:11] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:11] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:11] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/734 variables, and 127 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/311 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 75/127 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:17] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:25] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:25] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:26] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:28] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:35] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:36] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:36] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:36] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:36] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:36] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 18 ms to minimize.
Problem TDEAD423 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:54:37] [INFO ] Deduced a trap composed of 115 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-04 23:54:37] [INFO ] Deduced a trap composed of 115 places in 151 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 13/140 constraints. Problems are: Problem set: 1 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/734 variables, and 140 constraints, problems are : Problem set: 1 solved, 420 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/311 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/421 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 1 solved, 420 unsolved
Search for dead transitions found 1 dead transitions in 60200ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 311/345 places, 426/460 transitions.
Graph (complete) has 1576 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 310 /311 variables (removed 1) and now considering 426/426 (removed 0) transitions.
[2025-06-04 23:54:45] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
// Phase 1: matrix 422 rows 310 cols
[2025-06-04 23:54:45] [INFO ] Computed 56 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:54:45] [INFO ] Implicit Places using invariants in 507 ms returned []
[2025-06-04 23:54:45] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:54:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:54:48] [INFO ] Implicit Places using invariants and state equation in 2454 ms returned []
Implicit Place search using SMT with State Equation took 2987 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/345 places, 426/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105994 ms. Remains : 310/345 places, 426/460 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-05
Product exploration explored 100000 steps with 5099 reset in 498 ms.
Product exploration explored 100000 steps with 5130 reset in 486 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1574 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
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 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 98 steps (1 resets) in 4 ms. (19 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 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 22 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 426/426 transitions.
Applied a total of 0 rules in 21 ms. Remains 310 /310 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Running 420 sub problems to find dead transitions.
[2025-06-04 23:54:49] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:54:49] [INFO ] Invariant cache hit.
[2025-06-04 23:54:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 5/310 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 422/732 variables, 310/366 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 732/732 variables, and 367 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 5/310 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 422/732 variables, 310/366 constraints. Problems are: Problem set: 0 solved, 420 unsolved
SMT process timed out in 40193ms, After SMT, problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 40194ms
[2025-06-04 23:55:29] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:55:30] [INFO ] Implicit Places using invariants in 410 ms returned []
[2025-06-04 23:55:30] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:55:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:55:32] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 2982 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:55:32] [INFO ] Redundant transitions in 8 ms returned []
Running 420 sub problems to find dead transitions.
[2025-06-04 23:55:32] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:55:32] [INFO ] Invariant cache hit.
[2025-06-04 23:55:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 5/310 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 422/732 variables, 310/366 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:55:54] [INFO ] Deduced a trap composed of 73 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-04 23:55:55] [INFO ] Deduced a trap composed of 115 places in 515 ms of which 376 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:55:56] [INFO ] Deduced a trap composed of 115 places in 1510 ms of which 1382 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:55:57] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 40 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 732/732 variables, and 371 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 5/310 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (OVERLAPS) 422/732 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 732/732 variables, and 791 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60460ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103682 ms. Remains : 310/310 places, 426/426 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1574 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
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 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 211 steps (12 resets) in 13 ms. (15 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 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5120 reset in 409 ms.
Product exploration explored 100000 steps with 5001 reset in 433 ms.
Built C files in :
/tmp/ltsmin13083232915088185690
[2025-06-04 23:56:34] [INFO ] Computing symmetric may disable matrix : 426 transitions.
[2025-06-04 23:56:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:56:34] [INFO ] Computing symmetric may enable matrix : 426 transitions.
[2025-06-04 23:56:34] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:56:34] [INFO ] Computing Do-Not-Accords matrix : 426 transitions.
[2025-06-04 23:56:34] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:56:34] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13083232915088185690
Running compilation step : cd /tmp/ltsmin13083232915088185690;'/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 1117 ms.
Running link step : cd /tmp/ltsmin13083232915088185690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13083232915088185690;'/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/stateBased14190072010977221155.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 22 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 426/426 transitions.
Applied a total of 0 rules in 18 ms. Remains 310 /310 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Running 420 sub problems to find dead transitions.
[2025-06-04 23:56:49] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:56:49] [INFO ] Invariant cache hit.
[2025-06-04 23:56:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 5/310 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 422/732 variables, 310/366 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 732/732 variables, and 367 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 5/310 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 422/732 variables, 310/366 constraints. Problems are: Problem set: 0 solved, 420 unsolved
SMT process timed out in 40185ms, After SMT, problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 40186ms
[2025-06-04 23:57:29] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:57:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:57:30] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-04 23:57:30] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:57:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 23:57:32] [INFO ] Implicit Places using invariants and state equation in 2543 ms returned []
Implicit Place search using SMT with State Equation took 2917 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 23:57:32] [INFO ] Redundant transitions in 5 ms returned []
Running 420 sub problems to find dead transitions.
[2025-06-04 23:57:32] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-04 23:57:32] [INFO ] Invariant cache hit.
[2025-06-04 23:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 5/310 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 422/732 variables, 310/366 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:57:54] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:57:54] [INFO ] Deduced a trap composed of 115 places in 497 ms of which 373 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:57:56] [INFO ] Deduced a trap composed of 115 places in 1487 ms of which 1374 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:57:56] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 39 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 732/732 variables, and 371 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 5/310 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (OVERLAPS) 422/732 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 732/732 variables, and 791 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 310/310 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103426 ms. Remains : 310/310 places, 426/426 transitions.
Built C files in :
/tmp/ltsmin10366287903943099591
[2025-06-04 23:58:32] [INFO ] Computing symmetric may disable matrix : 426 transitions.
[2025-06-04 23:58:32] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:58:32] [INFO ] Computing symmetric may enable matrix : 426 transitions.
[2025-06-04 23:58:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:58:32] [INFO ] Computing Do-Not-Accords matrix : 426 transitions.
[2025-06-04 23:58:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 23:58:32] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10366287903943099591
Running compilation step : cd /tmp/ltsmin10366287903943099591;'/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 1027 ms.
Running link step : cd /tmp/ltsmin10366287903943099591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10366287903943099591;'/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/stateBased2350082213560736658.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 23:58:48] [INFO ] Flatten gal took : 29 ms
[2025-06-04 23:58:48] [INFO ] Flatten gal took : 26 ms
[2025-06-04 23:58:48] [INFO ] Time to serialize gal into /tmp/LTL7246771630985280525.gal : 6 ms
[2025-06-04 23:58:48] [INFO ] Time to serialize properties into /tmp/LTL1829204138450452521.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/LTL7246771630985280525.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5479933851259753502.hoa' '-atoms' '/tmp/LTL1829204138450452521.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/LTL1829204138450452521.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5479933851259753502.hoa
Detected timeout of ITS tools.
[2025-06-04 23:59:03] [INFO ] Flatten gal took : 25 ms
[2025-06-04 23:59:03] [INFO ] Flatten gal took : 25 ms
[2025-06-04 23:59:03] [INFO ] Time to serialize gal into /tmp/LTL2012484350887548278.gal : 4 ms
[2025-06-04 23:59:03] [INFO ] Time to serialize properties into /tmp/LTL4660113484411155234.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/LTL2012484350887548278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4660113484411155234.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 : !((F(G("((((((Perform_Work_B_1_20+Perform_Work_B_1_10)+(Perform_Work_B_1_1+Perform_Work_B_1_0))+((Perform_Work_B_1_14+Perform_Work_B_1...498
Formula 0 simplified : GF!"((((((Perform_Work_B_1_20+Perform_Work_B_1_10)+(Perform_Work_B_1_1+Perform_Work_B_1_0))+((Perform_Work_B_1_14+Perform_Work_B_1_7...492
Detected timeout of ITS tools.
[2025-06-04 23:59:18] [INFO ] Flatten gal took : 23 ms
[2025-06-04 23:59:18] [INFO ] Applying decomposition
[2025-06-04 23:59:18] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15051956952056131206.txt' '-o' '/tmp/graph15051956952056131206.bin' '-w' '/tmp/graph15051956952056131206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15051956952056131206.bin' '-l' '-1' '-v' '-w' '/tmp/graph15051956952056131206.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:59:18] [INFO ] Decomposing Gal with order
[2025-06-04 23:59:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:59:18] [INFO ] Removed a total of 329 redundant transitions.
[2025-06-04 23:59:19] [INFO ] Flatten gal took : 438 ms
[2025-06-04 23:59:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 497 labels/synchronizations in 42 ms.
[2025-06-04 23:59:19] [INFO ] Time to serialize gal into /tmp/LTL4797238778431189511.gal : 5 ms
[2025-06-04 23:59:19] [INFO ] Time to serialize properties into /tmp/LTL1701641381813663809.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/LTL4797238778431189511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1701641381813663809.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 : !((F(G("((((((gu0.Perform_Work_B_1_20+gu0.Perform_Work_B_1_10)+(gu0.Perform_Work_B_1_1+gu0.Perform_Work_B_1_0))+((gu0.Perform_Work_B_1...586
Formula 0 simplified : GF!"((((((gu0.Perform_Work_B_1_20+gu0.Perform_Work_B_1_10)+(gu0.Perform_Work_B_1_1+gu0.Perform_Work_B_1_0))+((gu0.Perform_Work_B_1_1...580
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-05 finished in 392456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 22 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 343 transition count 459
Applied a total of 3 rules in 10 ms. Remains 343 /345 variables (removed 2) and now considering 459/460 (removed 1) transitions.
Running 453 sub problems to find dead transitions.
[2025-06-04 23:59:34] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2025-06-04 23:59:34] [INFO ] Computed 57 invariants in 5 ms
[2025-06-04 23:59:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:44] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:45] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:45] [INFO ] Deduced a trap composed of 77 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-04 23:59:46] [INFO ] Deduced a trap composed of 145 places in 228 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:46] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:46] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:46] [INFO ] Deduced a trap composed of 77 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-04 23:59:46] [INFO ] Deduced a trap composed of 145 places in 175 ms of which 43 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:48] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:52] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:52] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:52] [INFO ] Deduced a trap composed of 125 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:59:53] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/798 variables, and 70 constraints, problems are : Problem set: 0 solved, 453 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:03] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:03] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:04] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:04] [INFO ] Deduced a trap composed of 125 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-05 00:00:04] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:04] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:04] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 33 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:05] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:07] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:08] [INFO ] Deduced a trap composed of 106 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-05 00:00:08] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:08] [INFO ] Deduced a trap composed of 106 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-05 00:00:08] [INFO ] Deduced a trap composed of 106 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-05 00:00:08] [INFO ] Deduced a trap composed of 106 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-05 00:00:08] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:09] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:09] [INFO ] Deduced a trap composed of 106 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-05 00:00:09] [INFO ] Deduced a trap composed of 106 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-05 00:00:09] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:09] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 25 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 20/90 constraints. Problems are: Problem set: 1 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/798 variables, and 90 constraints, problems are : Problem set: 1 solved, 452 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40223ms problems are : Problem set: 1 solved, 452 unsolved
Search for dead transitions found 1 dead transitions in 40225ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2025-06-05 00:00:14] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 343 cols
[2025-06-05 00:00:14] [INFO ] Computed 57 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:00:15] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-06-05 00:00:15] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-05 00:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:00:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:00:17] [INFO ] Implicit Places using invariants and state equation in 2228 ms returned []
Implicit Place search using SMT with State Equation took 2690 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 343/345 places, 458/460 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 342 transition count 458
Applied a total of 1 rules in 7 ms. Remains 342 /343 variables (removed 1) and now considering 458/458 (removed 0) transitions.
[2025-06-05 00:00:17] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 342 cols
[2025-06-05 00:00:17] [INFO ] Computed 56 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:00:17] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-06-05 00:00:17] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-05 00:00:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:00:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:00:20] [INFO ] Implicit Places using invariants and state equation in 2994 ms returned []
Implicit Place search using SMT with State Equation took 3410 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 342/345 places, 458/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46344 ms. Remains : 342/345 places, 458/460 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-06 finished in 46439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 343 transition count 459
Applied a total of 3 rules in 8 ms. Remains 343 /345 variables (removed 2) and now considering 459/460 (removed 1) transitions.
Running 453 sub problems to find dead transitions.
[2025-06-05 00:00:20] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2025-06-05 00:00:20] [INFO ] Computed 57 invariants in 9 ms
[2025-06-05 00:00:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:31] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:31] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:32] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:32] [INFO ] Deduced a trap composed of 145 places in 220 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:32] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:32] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:32] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:33] [INFO ] Deduced a trap composed of 145 places in 161 ms of which 43 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:34] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:38] [INFO ] Deduced a trap composed of 125 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-05 00:00:39] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:39] [INFO ] Deduced a trap composed of 125 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-05 00:00:39] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/798 variables, and 70 constraints, problems are : Problem set: 0 solved, 453 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:49] [INFO ] Deduced a trap composed of 148 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:50] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:50] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:50] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:50] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:51] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:51] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 32 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:51] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:54] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:54] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:54] [INFO ] Deduced a trap composed of 106 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-05 00:00:54] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:55] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:55] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:55] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:55] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:55] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:55] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:56] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:00:56] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 24 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 20/90 constraints. Problems are: Problem set: 1 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/798 variables, and 90 constraints, problems are : Problem set: 1 solved, 452 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40188ms problems are : Problem set: 1 solved, 452 unsolved
Search for dead transitions found 1 dead transitions in 40189ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2025-06-05 00:01:01] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 343 cols
[2025-06-05 00:01:01] [INFO ] Computed 57 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:01:01] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-06-05 00:01:01] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-05 00:01:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:01:04] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 2876 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 343/345 places, 458/460 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 342 transition count 458
Applied a total of 1 rules in 11 ms. Remains 342 /343 variables (removed 1) and now considering 458/458 (removed 0) transitions.
[2025-06-05 00:01:04] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 342 cols
[2025-06-05 00:01:04] [INFO ] Computed 56 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:01:04] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-06-05 00:01:04] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-05 00:01:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:01:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:01:07] [INFO ] Implicit Places using invariants and state equation in 3471 ms returned []
Implicit Place search using SMT with State Equation took 3899 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 342/345 places, 458/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46985 ms. Remains : 342/345 places, 458/460 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1602 edges and 342 vertex of which 341 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-08 finished in 47594 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(F(p1)))))'
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 344 transition count 438
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 322 transition count 435
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 319 transition count 435
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 50 place count 319 transition count 412
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 96 place count 296 transition count 412
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 294 transition count 410
Applied a total of 100 rules in 58 ms. Remains 294 /345 variables (removed 51) and now considering 410/460 (removed 50) transitions.
Running 404 sub problems to find dead transitions.
[2025-06-05 00:01:08] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
// Phase 1: matrix 406 rows 294 cols
[2025-06-05 00:01:08] [INFO ] Computed 57 invariants in 7 ms
[2025-06-05 00:01:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:11] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:11] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:11] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:11] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:11] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:11] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:12] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:12] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:12] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:12] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:13] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:13] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:13] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:13] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:13] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:13] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:13] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:14] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:14] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:14] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:14] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:15] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:15] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:15] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:15] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:15] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:15] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:16] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:16] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:16] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:16] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:16] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:16] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:17] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:17] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:17] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:17] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:18] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:18] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:18] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (OVERLAPS) 5/294 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 404 unsolved
SMT process timed out in 20190ms, After SMT, problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 20191ms
[2025-06-05 00:01:28] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
[2025-06-05 00:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:01:29] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-05 00:01:29] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
[2025-06-05 00:01:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:01:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:01:31] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 2584 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:01:31] [INFO ] Redundant transitions in 2 ms returned []
Running 404 sub problems to find dead transitions.
[2025-06-05 00:01:31] [INFO ] Flow matrix only has 406 transitions (discarded 4 similar events)
[2025-06-05 00:01:31] [INFO ] Invariant cache hit.
[2025-06-05 00:01:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:33] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:34] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:34] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:34] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:34] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:34] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:35] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:35] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:35] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:35] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:36] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:36] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:36] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:36] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:36] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:36] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:37] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:37] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:37] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:37] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:38] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:38] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:39] [INFO ] Deduced a trap composed of 76 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-05 00:01:39] [INFO ] Deduced a trap composed of 79 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-05 00:01:39] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:39] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:39] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:39] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:39] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:40] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:40] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:40] [INFO ] Deduced a trap composed of 79 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-05 00:01:41] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:41] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:41] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:41] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:41] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:41] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:41] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:01:42] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (OVERLAPS) 5/294 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 406/700 variables, 294/391 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 700/700 variables, and 392 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 294/294 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:03] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:03] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:03] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:03] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:04] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:04] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:04] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:04] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:04] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:04] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:05] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:05] [INFO ] Deduced a trap composed of 59 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-05 00:02:05] [INFO ] Deduced a trap composed of 59 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-05 00:02:05] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:05] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:05] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:06] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:06] [INFO ] Deduced a trap composed of 59 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-05 00:02:06] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:06] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:08] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:08] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:08] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:08] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:09] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:09] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:09] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:09] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:09] [INFO ] Deduced a trap composed of 59 places in 189 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:10] [INFO ] Deduced a trap composed of 59 places in 916 ms of which 786 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:11] [INFO ] Deduced a trap composed of 59 places in 952 ms of which 838 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:12] [INFO ] Deduced a trap composed of 59 places in 1200 ms of which 1070 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:13] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:14] [INFO ] Deduced a trap composed of 59 places in 981 ms of which 861 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:14] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:14] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:14] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:14] [INFO ] Deduced a trap composed of 59 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-05 00:02:15] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:15] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:17] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:31] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 25 ms to minimize.
SMT process timed out in 60323ms, After SMT, problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Starting structural reductions in SI_LTL mode, iteration 1 : 294/345 places, 410/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83178 ms. Remains : 294/345 places, 410/460 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-09
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-09 finished in 83271 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))'
Support contains 2 out of 345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 344 transition count 435
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 319 transition count 435
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 319 transition count 410
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 294 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 293 transition count 409
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 293 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 291 transition count 407
Applied a total of 106 rules in 32 ms. Remains 291 /345 variables (removed 54) and now considering 407/460 (removed 53) transitions.
Running 401 sub problems to find dead transitions.
[2025-06-05 00:02:31] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2025-06-05 00:02:31] [INFO ] Computed 57 invariants in 10 ms
[2025-06-05 00:02:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:34] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:34] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:34] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:34] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:35] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:35] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:35] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:35] [INFO ] Deduced a trap composed of 78 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-05 00:02:35] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:35] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:35] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:35] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:36] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:36] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:36] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:36] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:36] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:36] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:37] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:37] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:37] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:38] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:38] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:38] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:38] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:38] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:38] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:39] [INFO ] Deduced a trap composed of 57 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-05 00:02:39] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:39] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:39] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:39] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:39] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:40] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:40] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:40] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:40] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:40] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:41] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:41] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:44] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:44] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:46] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:46] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:47] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:47] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:47] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:47] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:47] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:47] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:48] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:48] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:48] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:48] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:48] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:49] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:49] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:49] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:49] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:49] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:49] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:50] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:51] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:51] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:51] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:51] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:51] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/694 variables, and 119 constraints, problems are : Problem set: 0 solved, 401 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/291 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 67/119 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:52] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:53] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:53] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:53] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:53] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:54] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:54] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:55] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:55] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:55] [INFO ] Deduced a trap composed of 58 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-05 00:02:56] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:56] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:56] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:56] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:57] [INFO ] Deduced a trap composed of 78 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-05 00:02:58] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:58] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:02:58] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:02] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:02] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/694 variables, and 139 constraints, problems are : Problem set: 0 solved, 401 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/291 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/401 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40199ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 40200ms
[2025-06-05 00:03:12] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2025-06-05 00:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:03:12] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-05 00:03:12] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2025-06-05 00:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:03:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:03:14] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2439 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:03:14] [INFO ] Redundant transitions in 2 ms returned []
Running 401 sub problems to find dead transitions.
[2025-06-05 00:03:14] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
[2025-06-05 00:03:14] [INFO ] Invariant cache hit.
[2025-06-05 00:03:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:17] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:17] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:17] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:17] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:17] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:17] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:18] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:18] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:18] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:18] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:18] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:19] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:19] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:19] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:19] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:19] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:19] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:20] [INFO ] Deduced a trap composed of 54 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-05 00:03:20] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:20] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:21] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:21] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:21] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:21] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:21] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:21] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:22] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:22] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:22] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:22] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:22] [INFO ] Deduced a trap composed of 77 places in 183 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:22] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:23] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:23] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:23] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:23] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:23] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:23] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:24] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:24] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:27] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:27] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:28] [INFO ] Deduced a trap composed of 78 places in 239 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:28] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:28] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:28] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:28] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:28] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:28] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:29] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:29] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:29] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:29] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:29] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:31] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:31] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:31] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:31] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:31] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:32] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:32] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:32] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:32] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:32] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:32] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:33] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:33] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:33] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:33] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:33] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:34] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:34] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:34] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:34] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:35] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:35] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:35] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:35] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:36] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:36] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:37] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:37] [INFO ] Deduced a trap composed of 77 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-05 00:03:37] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:37] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:37] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:37] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:38] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:38] [INFO ] Deduced a trap composed of 57 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-05 00:03:38] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:38] [INFO ] Deduced a trap composed of 57 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-05 00:03:38] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:38] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:38] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:39] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:44] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:03:44] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/694 variables, and 148 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/291 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 96/148 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/694 variables, and 148 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/13 constraints, State Equation: 0/291 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/401 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 291/345 places, 407/460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102877 ms. Remains : 291/345 places, 407/460 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 292 steps with 15 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-10 finished in 102939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X((p2&&G(p3)))&&(p0 U (p1||G(p0)))))))))'
Support contains 4 out of 345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 460/460 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 343 transition count 459
Applied a total of 3 rules in 11 ms. Remains 343 /345 variables (removed 2) and now considering 459/460 (removed 1) transitions.
Running 453 sub problems to find dead transitions.
[2025-06-05 00:04:14] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2025-06-05 00:04:14] [INFO ] Computed 57 invariants in 4 ms
[2025-06-05 00:04:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:24] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:25] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:25] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:26] [INFO ] Deduced a trap composed of 145 places in 242 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:26] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:26] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:26] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:26] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 42 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:28] [INFO ] Deduced a trap composed of 125 places in 166 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:32] [INFO ] Deduced a trap composed of 125 places in 186 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:32] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:32] [INFO ] Deduced a trap composed of 125 places in 162 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:33] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/798 variables, and 70 constraints, problems are : Problem set: 0 solved, 453 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 6/343 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:43] [INFO ] Deduced a trap composed of 148 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-05 00:04:44] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:44] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:44] [INFO ] Deduced a trap composed of 125 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-05 00:04:44] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:44] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:45] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 32 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:45] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:48] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:48] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:48] [INFO ] Deduced a trap composed of 106 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-05 00:04:48] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:48] [INFO ] Deduced a trap composed of 106 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-05 00:04:49] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:49] [INFO ] Deduced a trap composed of 106 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-05 00:04:49] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:49] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:49] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:50] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:04:50] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 25 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 20/90 constraints. Problems are: Problem set: 1 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/798 variables, and 90 constraints, problems are : Problem set: 1 solved, 452 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/343 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40272ms problems are : Problem set: 1 solved, 452 unsolved
Search for dead transitions found 1 dead transitions in 40273ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2025-06-05 00:04:55] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 343 cols
[2025-06-05 00:04:55] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:04:55] [INFO ] Implicit Places using invariants in 462 ms returned []
[2025-06-05 00:04:55] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-05 00:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:04:57] [INFO ] Implicit Places using invariants and state equation in 2216 ms returned []
Implicit Place search using SMT with State Equation took 2704 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 343/345 places, 458/460 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 342 transition count 458
Applied a total of 1 rules in 10 ms. Remains 342 /343 variables (removed 1) and now considering 458/458 (removed 0) transitions.
[2025-06-05 00:04:57] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
// Phase 1: matrix 454 rows 342 cols
[2025-06-05 00:04:57] [INFO ] Computed 56 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:04:58] [INFO ] Implicit Places using invariants in 431 ms returned []
[2025-06-05 00:04:58] [INFO ] Flow matrix only has 454 transitions (discarded 4 similar events)
[2025-06-05 00:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 00:05:01] [INFO ] Implicit Places using invariants and state equation in 3603 ms returned []
Implicit Place search using SMT with State Equation took 4069 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 342/345 places, 458/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47069 ms. Remains : 342/345 places, 458/460 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-12 finished in 47402 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)))'
[2025-06-05 00:05:02] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1807487821841641297
[2025-06-05 00:05:02] [INFO ] Computing symmetric may disable matrix : 460 transitions.
[2025-06-05 00:05:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:05:02] [INFO ] Computing symmetric may enable matrix : 460 transitions.
[2025-06-05 00:05:02] [INFO ] Applying decomposition
[2025-06-05 00:05:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:05:02] [INFO ] Flatten gal took : 41 ms
[2025-06-05 00:05:02] [INFO ] Computing Do-Not-Accords matrix : 460 transitions.
[2025-06-05 00:05:02] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:05:02] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1807487821841641297
Running compilation step : cd /tmp/ltsmin1807487821841641297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11255138749710188193.txt' '-o' '/tmp/graph11255138749710188193.bin' '-w' '/tmp/graph11255138749710188193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11255138749710188193.bin' '-l' '-1' '-v' '-w' '/tmp/graph11255138749710188193.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:05:02] [INFO ] Decomposing Gal with order
[2025-06-05 00:05:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:05:02] [INFO ] Removed a total of 628 redundant transitions.
[2025-06-05 00:05:02] [INFO ] Flatten gal took : 152 ms
[2025-06-05 00:05:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 70 ms.
[2025-06-05 00:05:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality15863871271528971363.gal : 5 ms
[2025-06-05 00:05:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality14134964089595634689.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/LTLCardinality15863871271528971363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14134964089595634689.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...299
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gu1.Perform_Work_B_1_20+gu1.Perform_Work_B_1_10)+(gu1.Perform_Work_B_1_1+gu1.Perform_Work_B_1_0))+((gu1.Perform_Work_B_1...586
Formula 0 simplified : GF!"((((((gu1.Perform_Work_B_1_20+gu1.Perform_Work_B_1_10)+(gu1.Perform_Work_B_1_1+gu1.Perform_Work_B_1_0))+((gu1.Perform_Work_B_1_1...580
Compilation finished in 1561 ms.
Running link step : cd /tmp/ltsmin1807487821841641297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1807487821841641297;'/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'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.059: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.059: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.140: Initializing POR dependencies: labels 461, guards 460
pins2lts-mc-linux64( 7/ 8), 0.294: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.430: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.432: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.438: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.732: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.927: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 4.180: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 4.180: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 4.181: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 4.814: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 4.852: There are 462 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.852: State length is 346, there are 464 groups
pins2lts-mc-linux64( 0/ 8), 4.852: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.852: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.852: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 4.852: Visible groups: 0 / 464, labels: 1 / 462
pins2lts-mc-linux64( 0/ 8), 4.852: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 4.852: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 5.112: [Blue] ~52 levels ~960 states ~2224 transitions
pins2lts-mc-linux64( 3/ 8), 5.268: [Blue] ~30 levels ~1920 states ~4640 transitions
pins2lts-mc-linux64( 7/ 8), 5.375: [Blue] ~52 levels ~3840 states ~8104 transitions
pins2lts-mc-linux64( 7/ 8), 5.532: [Blue] ~52 levels ~7680 states ~16376 transitions
pins2lts-mc-linux64( 7/ 8), 6.136: [Blue] ~52 levels ~15360 states ~32872 transitions
pins2lts-mc-linux64( 7/ 8), 7.553: [Blue] ~52 levels ~30720 states ~65888 transitions
pins2lts-mc-linux64( 4/ 8), 10.063: [Blue] ~30 levels ~61440 states ~109752 transitions
pins2lts-mc-linux64( 5/ 8), 15.745: [Blue] ~30 levels ~122880 states ~230368 transitions
pins2lts-mc-linux64( 5/ 8), 24.183: [Blue] ~30 levels ~245760 states ~458664 transitions
pins2lts-mc-linux64( 5/ 8), 31.030: [Blue] ~30 levels ~491520 states ~929272 transitions
pins2lts-mc-linux64( 7/ 8), 40.929: [Blue] ~65 levels ~983040 states ~1872440 transitions
pins2lts-mc-linux64( 7/ 8), 60.338: [Blue] ~65 levels ~1966080 states ~3664528 transitions
pins2lts-mc-linux64( 7/ 8), 97.031: [Blue] ~65 levels ~3932160 states ~7103952 transitions
pins2lts-mc-linux64( 7/ 8), 189.964: [Blue] ~65 levels ~7864320 states ~13843600 transitions
pins2lts-mc-linux64( 7/ 8), 394.562: [Blue] ~65 levels ~15728640 states ~27445472 transitions
pins2lts-mc-linux64( 1/ 8), 788.565: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 788.590:
pins2lts-mc-linux64( 0/ 8), 788.590: Explored 26178150 states 53076726 transitions, fanout: 2.028
pins2lts-mc-linux64( 0/ 8), 788.590: Total exploration time 783.720 sec (783.680 sec minimum, 783.700 sec on average)
pins2lts-mc-linux64( 0/ 8), 788.590: States per second: 33402, Transitions per second: 67724
pins2lts-mc-linux64( 0/ 8), 788.590:
pins2lts-mc-linux64( 0/ 8), 788.590: State space has 26179372 states, 8228 are accepting
pins2lts-mc-linux64( 0/ 8), 788.590: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 788.590: blue states: 26178150 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 788.590: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 788.590: all-red states: 11914 (0.05%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 788.590:
pins2lts-mc-linux64( 0/ 8), 788.590: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 788.590:
pins2lts-mc-linux64( 0/ 8), 788.590: Queue width: 8B, total height: 275, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 788.590: Tree memory: 455.7MB, 18.3 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 788.590: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 788.590: Stored 462 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 788.590: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 788.590: Est. total memory use: 455.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1807487821841641297;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1807487821841641297;'/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'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 00:30:42] [INFO ] Flatten gal took : 263 ms
[2025-06-05 00:30:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality672034443376909414.gal : 36 ms
[2025-06-05 00:30:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality7090794848624059887.ltl : 6 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/LTLCardinality672034443376909414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7090794848624059887.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...296
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((Perform_Work_B_1_20+Perform_Work_B_1_10)+(Perform_Work_B_1_1+Perform_Work_B_1_0))+((Perform_Work_B_1_14+Perform_Work_B_1...498
Formula 0 simplified : GF!"((((((Perform_Work_B_1_20+Perform_Work_B_1_10)+(Perform_Work_B_1_1+Perform_Work_B_1_0))+((Perform_Work_B_1_14+Perform_Work_B_1_7...492
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254400635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-S05J20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;