About the Execution of ITS-Tools for MedleyA-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 700559.00 | 0.00 | 0.00 | FFFFFFFFFTFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200236.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 MedleyA-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 158K 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 MedleyA-PT-18-LTLFireability-00
FORMULA_NAME MedleyA-PT-18-LTLFireability-01
FORMULA_NAME MedleyA-PT-18-LTLFireability-02
FORMULA_NAME MedleyA-PT-18-LTLFireability-03
FORMULA_NAME MedleyA-PT-18-LTLFireability-04
FORMULA_NAME MedleyA-PT-18-LTLFireability-05
FORMULA_NAME MedleyA-PT-18-LTLFireability-06
FORMULA_NAME MedleyA-PT-18-LTLFireability-07
FORMULA_NAME MedleyA-PT-18-LTLFireability-08
FORMULA_NAME MedleyA-PT-18-LTLFireability-09
FORMULA_NAME MedleyA-PT-18-LTLFireability-10
FORMULA_NAME MedleyA-PT-18-LTLFireability-11
FORMULA_NAME MedleyA-PT-18-LTLFireability-12
FORMULA_NAME MedleyA-PT-18-LTLFireability-13
FORMULA_NAME MedleyA-PT-18-LTLFireability-14
FORMULA_NAME MedleyA-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748879427531
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 15:50:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 15:50:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:50:31] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2025-06-02 15:50:31] [INFO ] Transformed 252 places.
[2025-06-02 15:50:31] [INFO ] Transformed 543 transitions.
[2025-06-02 15:50:31] [INFO ] Found NUPN structural information;
[2025-06-02 15:50:31] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 208 transition count 470
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 208 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 207 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 207 transition count 469
Applied a total of 90 rules in 121 ms. Remains 207 /252 variables (removed 45) and now considering 469/541 (removed 72) transitions.
// Phase 1: matrix 469 rows 207 cols
[2025-06-02 15:50:32] [INFO ] Computed 7 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:50:32] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-06-02 15:50:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:50:33] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2025-06-02 15:50:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:45] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:46] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:46] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:46] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:46] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:47] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:47] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:47] [INFO ] Deduced a trap composed of 34 places in 344 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:48] [INFO ] Deduced a trap composed of 127 places in 270 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:48] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:50] [INFO ] Deduced a trap composed of 127 places in 275 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:50] [INFO ] Deduced a trap composed of 24 places in 375 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:51] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:51] [INFO ] Deduced a trap composed of 24 places in 325 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:51] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:52] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:52] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:52] [INFO ] Deduced a trap composed of 24 places in 337 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:53] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:53] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:53] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:54] [INFO ] Deduced a trap composed of 109 places in 341 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:54] [INFO ] Deduced a trap composed of 112 places in 315 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:55] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:56] [INFO ] Deduced a trap composed of 24 places in 382 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:56] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:57] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:57] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:58] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:58] [INFO ] Deduced a trap composed of 108 places in 287 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:58] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:59] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:59] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:59] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:50:59] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:00] [INFO ] Deduced a trap composed of 135 places in 283 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:01] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:01] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:02] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:03] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/676 variables, and 47 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 137 places in 302 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:14] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 5 (OVERLAPS) 469/676 variables, 207/262 constraints. Problems are: Problem set: 50 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 418/680 constraints. Problems are: Problem set: 50 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 680 constraints, problems are : Problem set: 50 solved, 418 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 418/468 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60951ms problems are : Problem set: 50 solved, 418 unsolved
Search for dead transitions found 50 dead transitions in 60997ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 207/252 places, 419/541 transitions.
Applied a total of 0 rules in 16 ms. Remains 207 /207 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63231 ms. Remains : 207/252 places, 419/541 transitions.
Support contains 34 out of 207 places after structural reductions.
[2025-06-02 15:51:35] [INFO ] Flatten gal took : 147 ms
[2025-06-02 15:51:35] [INFO ] Flatten gal took : 81 ms
[2025-06-02 15:51:35] [INFO ] Input system was already deterministic with 419 transitions.
RANDOM walk for 40000 steps (1529 resets) in 2940 ms. (13 steps per ms) remains 20/26 properties
BEST_FIRST walk for 4003 steps (32 resets) in 65 ms. (60 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (34 resets) in 88 ms. (44 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (35 resets) in 52 ms. (75 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (35 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (33 resets) in 61 ms. (64 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 85 ms. (46 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (34 resets) in 78 ms. (50 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 71 ms. (55 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (31 resets) in 64 ms. (61 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (35 resets) in 52 ms. (75 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (34 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (34 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (25 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (33 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
// Phase 1: matrix 419 rows 207 cols
[2025-06-02 15:51:36] [INFO ] Computed 7 invariants in 8 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 178/207 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:37] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:37] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:37] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:38] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:38] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:38] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:39] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:39] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:39] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:39] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 419/626 variables, 207/224 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:41] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:41] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/626 variables, and 226 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 179/207 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 12/19 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:42] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 419/626 variables, 207/227 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 18/245 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:46] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/626 variables, and 246 constraints, problems are : Problem set: 2 solved, 18 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 18/20 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10048ms problems are : Problem set: 2 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 419/419 transitions.
Graph (trivial) has 151 edges and 207 vertex of which 4 / 207 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 204 transition count 378
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 79 place count 167 transition count 374
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 165 transition count 371
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 87 place count 162 transition count 371
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 87 place count 162 transition count 363
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 103 place count 154 transition count 363
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 152 transition count 359
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 152 transition count 359
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 161 place count 125 transition count 332
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 125 transition count 329
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 168 place count 121 transition count 321
Iterating global reduction 5 with 4 rules applied. Total rules applied 172 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 175 place count 118 transition count 313
Iterating global reduction 5 with 3 rules applied. Total rules applied 178 place count 118 transition count 313
Performed 8 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 194 place count 110 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 215 place count 110 transition count 331
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 217 place count 108 transition count 329
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 108 transition count 329
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 5 with 4 rules applied. Total rules applied 223 place count 106 transition count 327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 224 place count 105 transition count 323
Iterating global reduction 5 with 1 rules applied. Total rules applied 225 place count 105 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 103 transition count 334
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 250 place count 103 transition count 313
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 280 place count 82 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 290 place count 82 transition count 294
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 291 place count 82 transition count 296
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 294 place count 81 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 295 place count 80 transition count 293
Applied a total of 295 rules in 303 ms. Remains 80 /207 variables (removed 127) and now considering 293/419 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 80/207 places, 293/419 transitions.
RANDOM walk for 40000 steps (5446 resets) in 577 ms. (69 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4002 steps (192 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (176 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (203 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (36 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (208 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (198 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (184 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (201 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (189 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (183 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (188 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (193 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (198 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
[2025-06-02 15:51:47] [INFO ] Flow matrix only has 252 transitions (discarded 41 similar events)
// Phase 1: matrix 252 rows 80 cols
[2025-06-02 15:51:47] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 15:51:47] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:47] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:48] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:48] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:48] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 252/332 variables, 80/91 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 29/120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:48] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/332 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 121 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:49] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 252/332 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 29/122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 140 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3879 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5882ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 6 properties in 26516 ms.
Support contains 19 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 293/293 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 80 transition count 289
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 76 transition count 289
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 76 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 74 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 74 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 73 transition count 283
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 70 transition count 298
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 26 place count 70 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 70 transition count 283
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 70 transition count 280
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 47 place count 67 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 67 transition count 271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 67 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 66 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 66 transition count 269
Applied a total of 55 rules in 62 ms. Remains 66 /80 variables (removed 14) and now considering 269/293 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 66/80 places, 269/293 transitions.
RANDOM walk for 40000 steps (5452 resets) in 504 ms. (79 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (1755 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 272 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (33 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (28 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (47 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1821 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1615 resets) in 108 ms. (366 steps per ms) remains 7/8 properties
[2025-06-02 15:52:20] [INFO ] Flow matrix only has 220 transitions (discarded 49 similar events)
// Phase 1: matrix 220 rows 66 cols
[2025-06-02 15:52:20] [INFO ] Computed 7 invariants in 1 ms
[2025-06-02 15:52:20] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:20] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 199/253 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 32/285 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/286 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/286 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 100 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 199/253 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:22] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 32/285 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/286 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:50] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/286 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 7 unsolved in 33185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34217ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 17567 ms.
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 269/269 transitions.
Graph (trivial) has 14 edges and 66 vertex of which 2 / 66 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 63 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 63 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 18 place count 63 transition count 272
Applied a total of 18 rules in 21 ms. Remains 63 /66 variables (removed 3) and now considering 272/269 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 63/66 places, 272/269 transitions.
RANDOM walk for 40000 steps (5473 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1829 resets) in 104 ms. (380 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (34 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (21 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
[2025-06-02 15:53:12] [INFO ] Flow matrix only has 219 transitions (discarded 53 similar events)
// Phase 1: matrix 219 rows 63 cols
[2025-06-02 15:53:12] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 15:53:12] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:12] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/258 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 24/282 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/282 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 102 constraints, problems are : Problem set: 0 solved, 6 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 204/258 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 24/282 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:15] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/282 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/282 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 109 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2944ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 7007 ms.
Support contains 17 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 272/272 transitions.
Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 63/63 places, 272/272 transitions.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U (p0 U p1))) U X(X((X(G(p0)) U p2)))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 202 transition count 410
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 202 transition count 410
Applied a total of 10 rules in 7 ms. Remains 202 /207 variables (removed 5) and now considering 410/419 (removed 9) transitions.
// Phase 1: matrix 410 rows 202 cols
[2025-06-02 15:53:23] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:53:23] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-02 15:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:53:23] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2025-06-02 15:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:32] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:32] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:32] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:32] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:32] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:32] [INFO ] Deduced a trap composed of 125 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-02 15:53:33] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:33] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:34] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:34] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:34] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:34] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:34] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:35] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:35] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:35] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:35] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:35] [INFO ] Deduced a trap composed of 28 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-02 15:53:35] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:36] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:36] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:36] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:36] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:37] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:37] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:38] [INFO ] Deduced a trap composed of 111 places in 205 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:38] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:38] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:39] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:39] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:39] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:39] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:40] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:40] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:40] [INFO ] Deduced a trap composed of 107 places in 254 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:40] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:41] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:41] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:41] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:44] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:45] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:45] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:46] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:46] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:46] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:46] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:47] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:47] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:47] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:48] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:50] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:50] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:50] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:50] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:51] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:51] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/612 variables, and 64 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:57] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:03] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 410/612 variables, 202/268 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 409/677 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/612 variables, and 677 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 202/207 places, 410/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60711 ms. Remains : 202/207 places, 410/419 transitions.
Stuttering acceptance computed with spot in 661 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-00 finished in 61472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)&&G((p2||X((X(p3) U (p2&&X(p3))))))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 202 transition count 410
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 202 transition count 410
Applied a total of 10 rules in 26 ms. Remains 202 /207 variables (removed 5) and now considering 410/419 (removed 9) transitions.
// Phase 1: matrix 410 rows 202 cols
[2025-06-02 15:54:24] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 15:54:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:25] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2025-06-02 15:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:30] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:30] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:30] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:31] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:31] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:31] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:31] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:31] [INFO ] Deduced a trap composed of 125 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-02 15:54:31] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:32] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:32] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:33] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:33] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:33] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:33] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:33] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:34] [INFO ] Deduced a trap composed of 28 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-02 15:54:34] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:34] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:34] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:34] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:35] [INFO ] Deduced a trap composed of 34 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-02 15:54:35] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:36] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:36] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:36] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:37] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:38] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:38] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:38] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:38] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:39] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:39] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:44] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:44] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:44] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:45] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:45] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:45] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:45] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:47] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:48] [INFO ] Deduced a trap composed of 35 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-02 15:54:48] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:49] [INFO ] Deduced a trap composed of 35 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-02 15:54:49] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:49] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:49] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:51] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:51] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:52] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/612 variables, and 60 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:59] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:00] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:02] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:03] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:03] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:03] [INFO ] Deduced a trap composed of 120 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:04] [INFO ] Deduced a trap composed of 28 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-02 15:55:04] [INFO ] Deduced a trap composed of 130 places in 135 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:07] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:08] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:09] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:14] [INFO ] Deduced a trap composed of 133 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:14] [INFO ] Deduced a trap composed of 134 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:16] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/612 variables, and 75 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/409 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 202/207 places, 410/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60694 ms. Remains : 202/207 places, 410/419 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p3) (NOT p2)), (NOT p2), true, (NOT p3)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-02 finished in 61005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0) U p1))) U G(p2)))'
Support contains 6 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 202 transition count 410
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 202 transition count 410
Applied a total of 10 rules in 6 ms. Remains 202 /207 variables (removed 5) and now considering 410/419 (removed 9) transitions.
// Phase 1: matrix 410 rows 202 cols
[2025-06-02 15:55:25] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:25] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-02 15:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:55:25] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2025-06-02 15:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:32] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:33] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:34] [INFO ] Deduced a trap composed of 125 places in 251 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:34] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:34] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:34] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:35] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:36] [INFO ] Deduced a trap composed of 34 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-02 15:55:36] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 111 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:37] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:38] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:39] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:39] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:39] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:39] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:39] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:40] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:40] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:40] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:40] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:40] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:41] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:46] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:46] [INFO ] Deduced a trap composed of 42 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-02 15:55:46] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:47] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:47] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:48] [INFO ] Deduced a trap composed of 37 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-02 15:55:48] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:48] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:48] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:49] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:49] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:50] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:50] [INFO ] Deduced a trap composed of 108 places in 239 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:51] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:51] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:51] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:54] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:54] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:54] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 17 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/612 variables, and 67 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:59] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:59] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:55:59] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:00] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:00] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:00] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:00] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:00] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:01] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:03] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:06] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:07] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:07] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:10] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:11] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:14] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 409 unsolved
SMT process timed out in 60140ms, After SMT, problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 202/207 places, 410/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 202/207 places, 410/419 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-03
Stuttering criterion allowed to conclude after 5126 steps with 277 reset in 81 ms.
FORMULA MedleyA-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-03 finished in 61114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 201 transition count 408
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 201 transition count 408
Applied a total of 12 rules in 8 ms. Remains 201 /207 variables (removed 6) and now considering 408/419 (removed 11) transitions.
// Phase 1: matrix 408 rows 201 cols
[2025-06-02 15:56:26] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:56:26] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-02 15:56:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:56:27] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-02 15:56:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:36] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:36] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:37] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:37] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:37] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:37] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:38] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:38] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:38] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:38] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:39] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:39] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:40] [INFO ] Deduced a trap composed of 125 places in 196 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:40] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:41] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:41] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:41] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:42] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:42] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:42] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:43] [INFO ] Deduced a trap composed of 125 places in 254 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:43] [INFO ] Deduced a trap composed of 125 places in 280 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:45] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:45] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:45] [INFO ] Deduced a trap composed of 130 places in 255 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:45] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:46] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:46] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:46] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:47] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:47] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:47] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:48] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:48] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:48] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:48] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:48] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:49] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:49] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:49] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:54] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:55] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:55] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:55] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:55] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:56] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:56] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:56] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:56:57] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/609 variables, and 56 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:02] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:03] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:03] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:03] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:04] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:05] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:05] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:08] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:12] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:13] [INFO ] Deduced a trap composed of 107 places in 248 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:13] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:13] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:14] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:14] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:14] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:15] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:15] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 46 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:19] [INFO ] Deduced a trap composed of 134 places in 254 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:20] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:20] [INFO ] Deduced a trap composed of 133 places in 266 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:20] [INFO ] Deduced a trap composed of 140 places in 244 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:21] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:21] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:25] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 40 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/609 variables, and 80 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 0/407 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 201/207 places, 408/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61033 ms. Remains : 201/207 places, 408/419 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-06 finished in 61177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1))))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 201 transition count 408
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 201 transition count 408
Applied a total of 12 rules in 6 ms. Remains 201 /207 variables (removed 6) and now considering 408/419 (removed 11) transitions.
[2025-06-02 15:57:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:57:28] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-02 15:57:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:57:28] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-02 15:57:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:37] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:37] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:37] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:38] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:38] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:38] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:38] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:39] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:39] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:39] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:40] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:40] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:40] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:41] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:42] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:42] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:42] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:42] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:43] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:43] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:44] [INFO ] Deduced a trap composed of 125 places in 238 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:44] [INFO ] Deduced a trap composed of 125 places in 250 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:45] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:45] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:46] [INFO ] Deduced a trap composed of 130 places in 231 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:46] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:46] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:47] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:47] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:47] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:47] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:48] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:48] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:48] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:48] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:49] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:49] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:49] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:50] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:50] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:54] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:55] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:55] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:55] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:56] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:56] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:56] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:57] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:57] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:58] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:57:58] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/609 variables, and 58 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:04] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:07] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:07] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:08] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:08] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:10] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:10] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:11] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:12] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 408/609 variables, 201/268 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 407/675 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/609 variables, and 675 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 201/207 places, 408/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 201/207 places, 408/419 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-08
Product exploration explored 100000 steps with 3835 reset in 394 ms.
Product exploration explored 100000 steps with 3836 reset in 431 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 147 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (1532 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (356 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 413719 steps, run visited all 1 properties in 1078 ms. (steps per millisecond=383 )
Probabilistic random walk after 413719 steps, saw 79880 distinct states, run finished after 1083 ms. (steps per millisecond=382 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 13 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-08 finished in 63547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Graph (trivial) has 217 edges and 207 vertex of which 13 / 207 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 196 transition count 366
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 154 transition count 362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 152 transition count 362
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 91 place count 152 transition count 352
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 142 transition count 352
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 135 transition count 338
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 135 transition count 338
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 134 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 134 transition count 330
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 191 place count 102 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 102 transition count 292
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 202 place count 97 transition count 278
Iterating global reduction 4 with 5 rules applied. Total rules applied 207 place count 97 transition count 278
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 211 place count 93 transition count 266
Iterating global reduction 4 with 4 rules applied. Total rules applied 215 place count 93 transition count 266
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 253 place count 74 transition count 364
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 257 place count 74 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 288 place count 74 transition count 329
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 294 place count 71 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 70 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 297 place count 69 transition count 337
Applied a total of 297 rules in 92 ms. Remains 69 /207 variables (removed 138) and now considering 337/419 (removed 82) transitions.
[2025-06-02 15:58:31] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
// Phase 1: matrix 311 rows 69 cols
[2025-06-02 15:58:31] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:58:31] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 15:58:31] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2025-06-02 15:58:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:58:31] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-02 15:58:31] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:58:31] [INFO ] Redundant transitions in 38 ms returned []
Running 332 sub problems to find dead transitions.
[2025-06-02 15:58:31] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2025-06-02 15:58:31] [INFO ] Invariant cache hit.
[2025-06-02 15:58:31] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:33] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:34] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:34] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:34] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:34] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:34] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:34] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:34] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:35] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:35] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 310/379 variables, 69/93 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 72/165 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (OVERLAPS) 1/380 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:51] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 25.0 8.0))
(t1 0.0)
(t2 0.0)
(t3 1.0)
(t4 0.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 0.0)
(t9 1.0)
(t10 (/ 17.0 8.0))
(t11 1.0)
(t12 (/ 17.0 8.0))
(t13 0.0)
(t14 1.0)
(t15 1.0)
(t16 (/ 9.0 8.0))
(t17 4.0)
(t18 0.0)
(t19 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 167 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 310/379 variables, 69/94 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 72/166 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 332/498 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/380 variables, and 498 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/207 places, 337/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60884 ms. Remains : 69/207 places, 337/419 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-10 finished in 60942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(p1)))&&(F(p2) U p3)))'
Support contains 6 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 201 transition count 408
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 201 transition count 408
Applied a total of 12 rules in 3 ms. Remains 201 /207 variables (removed 6) and now considering 408/419 (removed 11) transitions.
// Phase 1: matrix 408 rows 201 cols
[2025-06-02 15:59:32] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:59:32] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 15:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:59:32] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-02 15:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:41] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:41] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:41] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:42] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:42] [INFO ] Deduced a trap composed of 19 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-02 15:59:42] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:42] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:44] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:44] [INFO ] Deduced a trap composed of 125 places in 204 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:45] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:46] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:46] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:46] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:46] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 125 places in 245 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 125 places in 260 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:49] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:50] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:50] [INFO ] Deduced a trap composed of 130 places in 246 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:50] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:52] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:52] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:52] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:53] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:53] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:53] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:53] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:54] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:54] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:54] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:59] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:00] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:00] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:00] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:00] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:01] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:01] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:01] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:02] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:03] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 34 ms to minimize.
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 30321ms
Starting structural reductions in LTL mode, iteration 1 : 201/207 places, 408/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30803 ms. Remains : 201/207 places, 408/419 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p3), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-11 finished in 31131 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)||X(X(G(p1))))))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 202 transition count 410
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 202 transition count 410
Applied a total of 10 rules in 14 ms. Remains 202 /207 variables (removed 5) and now considering 410/419 (removed 9) transitions.
// Phase 1: matrix 410 rows 202 cols
[2025-06-02 16:00:03] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:03] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-02 16:00:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:04] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2025-06-02 16:00:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:12] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:12] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:13] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:13] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:13] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:13] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:14] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:14] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:14] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:14] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:15] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:15] [INFO ] Deduced a trap composed of 126 places in 275 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:15] [INFO ] Deduced a trap composed of 126 places in 252 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:16] [INFO ] Deduced a trap composed of 141 places in 246 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:17] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:17] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:18] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:18] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:18] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:19] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:19] [INFO ] Deduced a trap composed of 108 places in 302 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:19] [INFO ] Deduced a trap composed of 108 places in 274 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:19] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:20] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:20] [INFO ] Deduced a trap composed of 111 places in 278 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:22] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:22] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:22] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:22] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:23] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:23] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:23] [INFO ] Deduced a trap composed of 131 places in 243 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:29] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:29] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:29] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:30] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:31] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:32] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:32] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:33] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:33] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:33] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:33] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:34] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 28 ms to minimize.
SMT process timed out in 30407ms, After SMT, problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 30409ms
Starting structural reductions in LTL mode, iteration 1 : 202/207 places, 410/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31207 ms. Remains : 202/207 places, 410/419 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-13 finished in 31495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||G(F(p2)))))'
Support contains 6 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 202 transition count 410
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 202 transition count 410
Applied a total of 10 rules in 6 ms. Remains 202 /207 variables (removed 5) and now considering 410/419 (removed 9) transitions.
// Phase 1: matrix 410 rows 202 cols
[2025-06-02 16:00:34] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:35] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-02 16:00:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:35] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2025-06-02 16:00:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:44] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:45] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:45] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:45] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:45] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:45] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:46] [INFO ] Deduced a trap composed of 125 places in 217 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:46] [INFO ] Deduced a trap composed of 125 places in 221 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:46] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:46] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:47] [INFO ] Deduced a trap composed of 108 places in 280 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:48] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:48] [INFO ] Deduced a trap composed of 133 places in 258 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:51] [INFO ] Deduced a trap composed of 108 places in 226 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:51] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:51] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:52] [INFO ] Deduced a trap composed of 111 places in 237 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:52] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:53] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:53] [INFO ] Deduced a trap composed of 134 places in 259 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:54] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:54] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:55] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:55] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:55] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:56] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:56] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:56] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:57] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:57] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:57] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:57] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:57] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:58] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:01] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:01] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:03] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:03] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:04] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:04] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:04] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:05] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:05] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:05] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:05] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 17 ms to minimize.
SMT process timed out in 30244ms, After SMT, problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Starting structural reductions in LTL mode, iteration 1 : 202/207 places, 410/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30982 ms. Remains : 202/207 places, 410/419 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 22 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-14 finished in 31926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(p1)))||G(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 419/419 transitions.
Graph (trivial) has 214 edges and 207 vertex of which 9 / 207 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 199 transition count 369
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 157 transition count 365
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 155 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 154 transition count 364
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 93 place count 154 transition count 353
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 115 place count 143 transition count 353
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 122 place count 136 transition count 339
Iterating global reduction 4 with 7 rules applied. Total rules applied 129 place count 136 transition count 339
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 135 transition count 331
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 135 transition count 331
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 193 place count 104 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 199 place count 104 transition count 294
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 204 place count 99 transition count 280
Iterating global reduction 5 with 5 rules applied. Total rules applied 209 place count 99 transition count 280
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 213 place count 95 transition count 268
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 95 transition count 268
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -118
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 257 place count 75 transition count 386
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 268 place count 75 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 285 place count 75 transition count 358
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 291 place count 72 transition count 355
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 71 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 70 transition count 366
Applied a total of 294 rules in 97 ms. Remains 70 /207 variables (removed 137) and now considering 366/419 (removed 53) transitions.
[2025-06-02 16:01:06] [INFO ] Flow matrix only has 337 transitions (discarded 29 similar events)
// Phase 1: matrix 337 rows 70 cols
[2025-06-02 16:01:06] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:01:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 16:01:07] [INFO ] Flow matrix only has 337 transitions (discarded 29 similar events)
[2025-06-02 16:01:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:01:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-02 16:01:07] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:01:07] [INFO ] Redundant transitions in 12 ms returned []
Running 361 sub problems to find dead transitions.
[2025-06-02 16:01:07] [INFO ] Flow matrix only has 337 transitions (discarded 29 similar events)
[2025-06-02 16:01:07] [INFO ] Invariant cache hit.
[2025-06-02 16:01:07] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:09] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:09] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:09] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:09] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:10] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:10] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:10] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:10] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:10] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:10] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:11] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:11] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:12] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:12] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (OVERLAPS) 336/406 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 72/163 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 1/407 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:31] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:31] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 8 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/407 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 167 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:38] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:40] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:41] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 336/406 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 72/170 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 361/531 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/407 variables, and 531 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/207 places, 366/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60940 ms. Remains : 70/207 places, 366/419 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-15 finished in 61181 ms.
All properties solved by simple procedures.
Total runtime 697044 ms.
BK_STOP 1748880128090
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;