About the Execution of ITS-Tools for CO4-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 403911.00 | 0.00 | 0.00 | FFTFFFFFFFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600507.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 CO4-PT-17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600507
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 248K 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 CO4-PT-17-LTLCardinality-00
FORMULA_NAME CO4-PT-17-LTLCardinality-01
FORMULA_NAME CO4-PT-17-LTLCardinality-02
FORMULA_NAME CO4-PT-17-LTLCardinality-03
FORMULA_NAME CO4-PT-17-LTLCardinality-04
FORMULA_NAME CO4-PT-17-LTLCardinality-05
FORMULA_NAME CO4-PT-17-LTLCardinality-06
FORMULA_NAME CO4-PT-17-LTLCardinality-07
FORMULA_NAME CO4-PT-17-LTLCardinality-08
FORMULA_NAME CO4-PT-17-LTLCardinality-09
FORMULA_NAME CO4-PT-17-LTLCardinality-10
FORMULA_NAME CO4-PT-17-LTLCardinality-11
FORMULA_NAME CO4-PT-17-LTLCardinality-12
FORMULA_NAME CO4-PT-17-LTLCardinality-13
FORMULA_NAME CO4-PT-17-LTLCardinality-14
FORMULA_NAME CO4-PT-17-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748608966693
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 12:42:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:42:48] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-05-30 12:42:48] [INFO ] Transformed 967 places.
[2025-05-30 12:42:48] [INFO ] Transformed 1150 transitions.
[2025-05-30 12:42:48] [INFO ] Found NUPN structural information;
[2025-05-30 12:42:48] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 198 places in 12 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-17-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 178 place count 592 transition count 753
Iterating global reduction 1 with 158 rules applied. Total rules applied 336 place count 592 transition count 753
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 344 place count 592 transition count 745
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 426 place count 510 transition count 663
Iterating global reduction 2 with 82 rules applied. Total rules applied 508 place count 510 transition count 663
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 526 place count 492 transition count 642
Iterating global reduction 2 with 18 rules applied. Total rules applied 544 place count 492 transition count 642
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 547 place count 492 transition count 639
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 550 place count 489 transition count 636
Iterating global reduction 3 with 3 rules applied. Total rules applied 553 place count 489 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 555 place count 487 transition count 634
Iterating global reduction 3 with 2 rules applied. Total rules applied 557 place count 487 transition count 634
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 559 place count 487 transition count 632
Applied a total of 559 rules in 182 ms. Remains 487 /769 variables (removed 282) and now considering 632/912 (removed 280) transitions.
// Phase 1: matrix 632 rows 487 cols
[2025-05-30 12:42:48] [INFO ] Computed 5 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:48] [INFO ] Implicit Places using invariants in 396 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 426 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 486/769 places, 632/912 transitions.
Applied a total of 0 rules in 8 ms. Remains 486 /486 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 629 ms. Remains : 486/769 places, 632/912 transitions.
Support contains 26 out of 486 places after structural reductions.
[2025-05-30 12:42:49] [INFO ] Flatten gal took : 59 ms
[2025-05-30 12:42:49] [INFO ] Flatten gal took : 36 ms
[2025-05-30 12:42:49] [INFO ] Input system was already deterministic with 632 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (59 resets) in 1548 ms. (25 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40000 steps (110 resets) in 504 ms. (79 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40000 steps (43 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (51 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (80 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (82 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (71 resets) in 202 ms. (197 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (65 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (31 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (58 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
// Phase 1: matrix 632 rows 486 cols
[2025-05-30 12:42:50] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/34 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 158/192 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 454/646 variables, 177/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 13/659 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 10/669 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 365/1034 variables, 217/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1034 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 69/1103 variables, 44/480 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1103 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 15/1118 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1118 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1118 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 490 constraints, problems are : Problem set: 0 solved, 7 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/34 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 158/192 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 454/646 variables, 177/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 13/659 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 10/669 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 365/1034 variables, 217/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 69/1103 variables, 44/487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1103 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 15/1118 variables, 10/497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1118 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1118 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 497 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2234 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3237ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 7 properties in 211 ms.
FORMULA CO4-PT-17-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 817 edges and 486 vertex of which 483 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 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 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Graph (trivial) has 531 edges and 486 vertex of which 2 / 486 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 816 edges and 485 vertex of which 482 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 481 transition count 451
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 176 rules applied. Total rules applied 354 place count 306 transition count 450
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 354 place count 306 transition count 390
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 474 place count 246 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 477 place count 243 transition count 387
Iterating global reduction 2 with 3 rules applied. Total rules applied 480 place count 243 transition count 387
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 480 place count 243 transition count 385
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 484 place count 241 transition count 385
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 486 place count 239 transition count 383
Iterating global reduction 2 with 2 rules applied. Total rules applied 488 place count 239 transition count 383
Performed 87 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 662 place count 152 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 670 place count 152 transition count 268
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 672 place count 151 transition count 267
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 676 place count 147 transition count 263
Iterating global reduction 4 with 4 rules applied. Total rules applied 680 place count 147 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 681 place count 147 transition count 262
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 687 place count 144 transition count 259
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 775 place count 100 transition count 262
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 804 place count 100 transition count 233
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 843 place count 61 transition count 155
Iterating global reduction 6 with 39 rules applied. Total rules applied 882 place count 61 transition count 155
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 908 place count 61 transition count 129
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 918 place count 51 transition count 100
Iterating global reduction 7 with 10 rules applied. Total rules applied 928 place count 51 transition count 100
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 935 place count 51 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 938 place count 51 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 940 place count 49 transition count 88
Applied a total of 940 rules in 90 ms. Remains 49 /486 variables (removed 437) and now considering 88/632 (removed 544) transitions.
[2025-05-30 12:42:54] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
// Phase 1: matrix 80 rows 49 cols
[2025-05-30 12:42:54] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 12:42:54] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2025-05-30 12:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:42:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:42:54] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2025-05-30 12:42:54] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2025-05-30 12:42:54] [INFO ] Invariant cache hit.
[2025-05-30 12:42:54] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/128 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 55 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/128 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 75/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 130 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4150ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 4152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/486 places, 88/632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4344 ms. Remains : 49/486 places, 88/632 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA CO4-PT-17-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-01 finished in 4551 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(G(p0)) U (F(p1) U X(X(p2)))))))'
Support contains 5 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 623
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 623
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 475 transition count 621
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 475 transition count 621
Applied a total of 22 rules in 29 ms. Remains 475 /486 variables (removed 11) and now considering 621/632 (removed 11) transitions.
// Phase 1: matrix 621 rows 475 cols
[2025-05-30 12:42:58] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 12:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:59] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2025-05-30 12:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1096 variables, 475/479 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:43:27] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:43:27] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 481 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1096 variables, 475/481 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1096 variables, 620/1101 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1101 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 475/486 places, 621/632 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60543 ms. Remains : 475/486 places, 621/632 transitions.
Stuttering acceptance computed with spot in 549 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLCardinality-02
Product exploration explored 100000 steps with 20000 reset in 222 ms.
Product exploration explored 100000 steps with 20000 reset in 202 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 475 vertex of which 472 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (134 resets) in 778 ms. (51 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (66 resets) in 452 ms. (88 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (45 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (32 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (38 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (137 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
[2025-05-30 12:44:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 80/95 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 273/368 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 12/380 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/390 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 345/735 variables, 160/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/735 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 266/1001 variables, 133/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1001 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 89/1090 variables, 60/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1090 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/1096 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1096 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1096 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 479 constraints, problems are : Problem set: 0 solved, 5 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 80/95 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 273/368 variables, 102/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/380 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 10/390 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 345/735 variables, 160/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/735 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 266/1001 variables, 133/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1001 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
At refinement iteration 16 (OVERLAPS) 89/1090 variables, 60/480 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/484 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/484 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/484 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 484 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1245 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1881ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 644 steps, including 18 resets, run visited all 3 properties in 3 ms. (steps per millisecond=214 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 32 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (X p1)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 475 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 621/621 transitions.
Applied a total of 0 rules in 11 ms. Remains 475 /475 variables (removed 0) and now considering 621/621 (removed 0) transitions.
[2025-05-30 12:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:44:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 12:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:44:04] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2025-05-30 12:44: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/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1096 variables, 475/479 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:33] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:33] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 481 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1096 variables, 475/481 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1096 variables, 620/1101 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1101 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 475/475 places, 621/621 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 475 vertex of which 472 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p2]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (33 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (103 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1307045 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 1
Probabilistic random walk after 1307045 steps, saw 233518 distinct states, run finished after 3008 ms. (steps per millisecond=434 ) properties seen :0
[2025-05-30 12:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/73 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 280/353 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/365 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/375 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 355/730 variables, 166/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/730 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 267/997 variables, 132/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/997 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 93/1090 variables, 63/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1090 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1096 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1096 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1096 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/73 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 280/353 variables, 102/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/365 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/375 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 355/730 variables, 166/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/730 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 267/997 variables, 132/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/997 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 93/1090 variables, 63/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 683ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 20000 reset in 131 ms.
Product exploration explored 100000 steps with 20000 reset in 143 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 621/621 transitions.
Graph (trivial) has 519 edges and 475 vertex of which 2 / 475 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 805 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 166 rules applied. Total rules applied 168 place count 471 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 169 place count 471 transition count 615
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 169 place count 471 transition count 676
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 233 place count 471 transition count 676
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 266 place count 438 transition count 643
Deduced a syphon composed of 196 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 299 place count 438 transition count 643
Performed 56 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 355 place count 438 transition count 710
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 362 place count 438 transition count 703
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 391 place count 409 transition count 668
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 420 place count 409 transition count 668
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 422 place count 407 transition count 665
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 407 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 425 place count 407 transition count 664
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 426 place count 406 transition count 663
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 427 place count 406 transition count 663
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 428 place count 406 transition count 663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 429 place count 406 transition count 662
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 431 place count 404 transition count 660
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 433 place count 404 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 434 place count 404 transition count 660
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 435 place count 403 transition count 659
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 436 place count 403 transition count 659
Performed 75 Post agglomeration using F-continuation condition with reduction of 35 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 75 rules applied. Total rules applied 511 place count 403 transition count 985
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 5 with 74 rules applied. Total rules applied 585 place count 403 transition count 911
Discarding 157 places :
Symmetric choice reduction at 6 with 157 rule applications. Total rules 742 place count 246 transition count 545
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 6 with 157 rules applied. Total rules applied 899 place count 246 transition count 545
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 947 place count 246 transition count 497
Discarding 98 places :
Symmetric choice reduction at 7 with 98 rule applications. Total rules 1045 place count 148 transition count 321
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 7 with 98 rules applied. Total rules applied 1143 place count 148 transition count 321
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1151 place count 148 transition count 313
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1171 place count 128 transition count 273
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1191 place count 128 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1192 place count 128 transition count 298
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1199 place count 128 transition count 291
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1202 place count 125 transition count 273
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1205 place count 125 transition count 273
Deduced a syphon composed of 74 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 1229 place count 125 transition count 249
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1230 place count 124 transition count 248
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1231 place count 124 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1232 place count 124 transition count 269
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1233 place count 123 transition count 261
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1234 place count 123 transition count 261
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1234 rules in 152 ms. Remains 123 /475 variables (removed 352) and now considering 261/621 (removed 360) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:45:10] [INFO ] Redundant transitions in 11 ms returned []
Running 260 sub problems to find dead transitions.
[2025-05-30 12:45:10] [INFO ] Flow matrix only has 253 transitions (discarded 8 similar events)
// Phase 1: matrix 253 rows 123 cols
[2025-05-30 12:45:10] [INFO ] Computed 4 invariants in 2 ms
[2025-05-30 12:45:10] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:45:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:45:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:45:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:45:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 248 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 4 (OVERLAPS) 252/375 variables, 123/131 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 15/146 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/146 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/147 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/147 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/147 constraints. Problems are: Problem set: 172 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 147 constraints, problems are : Problem set: 172 solved, 88 unsolved in 8134 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 123/123 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 172 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 11/60 variables, 4/4 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/8 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 239/299 variables, 60/68 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 15/83 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 88/171 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/171 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 76/375 variables, 63/234 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/234 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/376 variables, 1/235 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/235 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/235 constraints. Problems are: Problem set: 172 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 235 constraints, problems are : Problem set: 172 solved, 88 unsolved in 9057 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 123/123 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/260 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17235ms problems are : Problem set: 172 solved, 88 unsolved
Search for dead transitions found 172 dead transitions in 17236ms
Found 172 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 172 transitions
Dead transitions reduction (with SMT) removed 172 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 123/475 places, 89/621 transitions.
Graph (complete) has 178 edges and 123 vertex of which 50 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 50 /123 variables (removed 73) and now considering 89/89 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/475 places, 89/621 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17416 ms. Remains : 50/475 places, 89/621 transitions.
Built C files in :
/tmp/ltsmin17813641211265244901
[2025-05-30 12:45:27] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17813641211265244901
Running compilation step : cd /tmp/ltsmin17813641211265244901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 952 ms.
Running link step : cd /tmp/ltsmin17813641211265244901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17813641211265244901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6027941933594343061.hoa' '--buchi-type=spotba'
LTSmin run took 272 ms.
FORMULA CO4-PT-17-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLCardinality-02 finished in 149920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Graph (trivial) has 532 edges and 486 vertex of which 2 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 816 edges and 485 vertex of which 482 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 481 transition count 451
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 176 rules applied. Total rules applied 354 place count 306 transition count 450
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 354 place count 306 transition count 390
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 474 place count 246 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 477 place count 243 transition count 387
Iterating global reduction 2 with 3 rules applied. Total rules applied 480 place count 243 transition count 387
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 480 place count 243 transition count 385
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 484 place count 241 transition count 385
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 486 place count 239 transition count 383
Iterating global reduction 2 with 2 rules applied. Total rules applied 488 place count 239 transition count 383
Performed 87 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 662 place count 152 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 670 place count 152 transition count 268
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 672 place count 151 transition count 267
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 677 place count 146 transition count 262
Iterating global reduction 4 with 5 rules applied. Total rules applied 682 place count 146 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 683 place count 146 transition count 261
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 689 place count 143 transition count 258
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 779 place count 98 transition count 261
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 809 place count 98 transition count 231
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 849 place count 58 transition count 151
Iterating global reduction 6 with 40 rules applied. Total rules applied 889 place count 58 transition count 151
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 916 place count 58 transition count 124
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 926 place count 48 transition count 95
Iterating global reduction 7 with 10 rules applied. Total rules applied 936 place count 48 transition count 95
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 943 place count 48 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 945 place count 48 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 947 place count 46 transition count 84
Applied a total of 947 rules in 56 ms. Remains 46 /486 variables (removed 440) and now considering 84/632 (removed 548) transitions.
[2025-05-30 12:45:28] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
// Phase 1: matrix 76 rows 46 cols
[2025-05-30 12:45:28] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 12:45:28] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2025-05-30 12:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:45:28] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:45:28] [INFO ] Redundant transitions in 0 ms returned []
Running 70 sub problems to find dead transitions.
[2025-05-30 12:45:28] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2025-05-30 12:45:28] [INFO ] Invariant cache hit.
[2025-05-30 12:45:28] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 75/121 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 52 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1487 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 75/121 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 70/121 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 122 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2209 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3706ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3708ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/486 places, 84/632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3856 ms. Remains : 46/486 places, 84/632 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-03
Product exploration explored 100000 steps with 9 reset in 69 ms.
Stack based approach found an accepted trace after 725 steps with 69 reset with depth 10 and stack size 10 in 2 ms.
FORMULA CO4-PT-17-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-17-LTLCardinality-03 finished in 4025 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)||G(p1))))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 623
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 623
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 474 transition count 620
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 474 transition count 620
Applied a total of 24 rules in 30 ms. Remains 474 /486 variables (removed 12) and now considering 620/632 (removed 12) transitions.
// Phase 1: matrix 620 rows 474 cols
[2025-05-30 12:45:32] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:32] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 12:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:33] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2025-05-30 12:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:46:01] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:46:01] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 474/486 places, 620/632 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60500 ms. Remains : 474/486 places, 620/632 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-17-LTLCardinality-05
Product exploration explored 100000 steps with 9 reset in 108 ms.
Product exploration explored 100000 steps with 38 reset in 139 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 805 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (76 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (83 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (25 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (30 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (55 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (85 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (133 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 694391 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 6
Probabilistic random walk after 694391 steps, saw 132067 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
[2025-05-30 12:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 76/88 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 258/346 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/354 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 16/370 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 318/688 variables, 144/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 288/976 variables, 136/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/976 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 110/1086 variables, 74/472 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 8/1094 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1094 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1094 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 478 constraints, problems are : Problem set: 0 solved, 6 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 76/88 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 258/346 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/354 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 16/370 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 318/688 variables, 144/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 288/976 variables, 136/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/976 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 110/1086 variables, 74/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 8/1094 variables, 6/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1094 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1094 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 484 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2842ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 64 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 274 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 620/620 transitions.
Graph (trivial) has 514 edges and 474 vertex of which 2 / 474 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 804 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 469 transition count 452
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 328 place count 307 transition count 451
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 328 place count 307 transition count 386
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 458 place count 242 transition count 386
Performed 82 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 622 place count 160 transition count 284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 630 place count 160 transition count 276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 632 place count 159 transition count 275
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 638 place count 153 transition count 269
Iterating global reduction 4 with 6 rules applied. Total rules applied 644 place count 153 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 645 place count 153 transition count 268
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 651 place count 150 transition count 265
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 741 place count 105 transition count 268
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 770 place count 105 transition count 239
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 809 place count 66 transition count 161
Iterating global reduction 6 with 39 rules applied. Total rules applied 848 place count 66 transition count 161
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 873 place count 66 transition count 136
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 881 place count 58 transition count 113
Iterating global reduction 7 with 8 rules applied. Total rules applied 889 place count 58 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 894 place count 58 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 897 place count 58 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 899 place count 56 transition count 103
Applied a total of 899 rules in 37 ms. Remains 56 /474 variables (removed 418) and now considering 103/620 (removed 517) transitions.
[2025-05-30 12:46:40] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 56 cols
[2025-05-30 12:46:40] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 12:46:40] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
[2025-05-30 12:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:46:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:46:41] [INFO ] Redundant transitions in 0 ms returned []
Running 90 sub problems to find dead transitions.
[2025-05-30 12:46:41] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
[2025-05-30 12:46:41] [INFO ] Invariant cache hit.
[2025-05-30 12:46:41] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 93/149 variables, 56/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 62 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 93/149 variables, 56/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 90/151 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 1/150 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 152 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3369 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5608ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5609ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/474 places, 103/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5740 ms. Remains : 56/474 places, 103/620 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (3744 resets) in 349 ms. (114 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (438 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2025-05-30 12:46:47] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
[2025-05-30 12:46:47] [INFO ] Invariant cache hit.
[2025-05-30 12:46:47] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/82 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 38/120 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/123 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/129 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/138 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/147 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/147 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/149 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/82 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/120 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/123 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/129 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/138 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/138 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/147 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/149 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/150 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/150 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/150 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 345 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 58 ms.
Product exploration explored 100000 steps with 22 reset in 72 ms.
Built C files in :
/tmp/ltsmin10280205017850853144
[2025-05-30 12:46:48] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2025-05-30 12:46:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:46:48] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2025-05-30 12:46:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:46:48] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2025-05-30 12:46:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:46:48] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10280205017850853144
Running compilation step : cd /tmp/ltsmin10280205017850853144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin10280205017850853144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10280205017850853144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15155955675945812676.hoa' '--buchi-type=spotba'
LTSmin run took 282 ms.
FORMULA CO4-PT-17-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLCardinality-05 finished in 76193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Graph (trivial) has 523 edges and 486 vertex of which 2 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 816 edges and 485 vertex of which 482 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 481 transition count 458
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 171 rules applied. Total rules applied 342 place count 313 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 344 place count 311 transition count 455
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 344 place count 311 transition count 396
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 462 place count 252 transition count 396
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 464 place count 250 transition count 394
Iterating global reduction 3 with 2 rules applied. Total rules applied 466 place count 250 transition count 394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 466 place count 250 transition count 392
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 470 place count 248 transition count 392
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 471 place count 247 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 472 place count 247 transition count 391
Performed 87 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 646 place count 160 transition count 285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 653 place count 160 transition count 278
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 655 place count 159 transition count 277
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 660 place count 154 transition count 272
Iterating global reduction 5 with 5 rules applied. Total rules applied 665 place count 154 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 666 place count 154 transition count 271
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 672 place count 151 transition count 268
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 760 place count 107 transition count 271
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 789 place count 107 transition count 242
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 828 place count 68 transition count 164
Iterating global reduction 7 with 39 rules applied. Total rules applied 867 place count 68 transition count 164
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 892 place count 68 transition count 139
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 901 place count 59 transition count 113
Iterating global reduction 8 with 9 rules applied. Total rules applied 910 place count 59 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 916 place count 59 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 919 place count 59 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 921 place count 57 transition count 102
Applied a total of 921 rules in 43 ms. Remains 57 /486 variables (removed 429) and now considering 102/632 (removed 530) transitions.
[2025-05-30 12:46:48] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
// Phase 1: matrix 94 rows 57 cols
[2025-05-30 12:46:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-30 12:46:48] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2025-05-30 12:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:46:49] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:46:49] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2025-05-30 12:46:49] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2025-05-30 12:46:49] [INFO ] Invariant cache hit.
[2025-05-30 12:46:49] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 93/150 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/151 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 63 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 93/150 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 89/151 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 152 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3223 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5461ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5461ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/486 places, 102/632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5840 ms. Remains : 57/486 places, 102/632 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 33 ms.
Product exploration explored 100000 steps with 30 reset in 32 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 30839 steps (2832 resets) in 53 ms. (571 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-30 12:46:55] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2025-05-30 12:46:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 12:46:55] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2025-05-30 12:46:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:46:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:46:55] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2025-05-30 12:46:55] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2025-05-30 12:46:55] [INFO ] Invariant cache hit.
[2025-05-30 12:46:55] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 93/150 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/151 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 63 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2284 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 93/150 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 89/151 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 152 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5476ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5476ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5579 ms. Remains : 57/57 places, 102/102 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 32751 steps (3018 resets) in 74 ms. (436 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49 reset in 38 ms.
Product exploration explored 100000 steps with 8 reset in 34 ms.
Built C files in :
/tmp/ltsmin13909446158532391612
[2025-05-30 12:47:01] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2025-05-30 12:47:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:47:01] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2025-05-30 12:47:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:47:01] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2025-05-30 12:47:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:47:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13909446158532391612
Running compilation step : cd /tmp/ltsmin13909446158532391612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin13909446158532391612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13909446158532391612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8005205787807948415.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA CO4-PT-17-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLCardinality-06 finished in 13477 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(F(!p1))||p0)) U X(G(p2))))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 475 transition count 621
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 475 transition count 621
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 472 transition count 618
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 472 transition count 618
Applied a total of 28 rules in 27 ms. Remains 472 /486 variables (removed 14) and now considering 618/632 (removed 14) transitions.
// Phase 1: matrix 618 rows 472 cols
[2025-05-30 12:47:02] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-30 12:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:02] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2025-05-30 12:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:30] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:31] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 472/486 places, 618/632 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 472/486 places, 618/632 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND p1 p0 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-07
Product exploration explored 100000 steps with 33351 reset in 152 ms.
Product exploration explored 100000 steps with 33375 reset in 149 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1 p2)), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (AND p0 p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 140 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p0 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (64 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (93 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (64 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (58 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (82 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (37 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (67 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 798763 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :3 out of 6
Probabilistic random walk after 798763 steps, saw 147705 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :3
[2025-05-30 12:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 57/66 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 251/317 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 437/754 variables, 193/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/766 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/766 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/769 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/769 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 257/1026 variables, 152/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1026 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 52/1078 variables, 32/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1078 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 12/1090 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1090 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 57/66 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 251/317 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 437/754 variables, 193/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/766 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/766 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/769 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/769 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 257/1026 variables, 152/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1026 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 52/1078 variables, 32/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1078 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1090 variables, 8/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1090 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 479 constraints, problems are : Problem set: 0 solved, 3 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1443ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 115 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=57 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1 p2)), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (AND p0 p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 390 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND p1 p0 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 155 ms :[(AND p1 p0 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 514 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 467 transition count 450
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 328 place count 305 transition count 449
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 328 place count 305 transition count 382
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 462 place count 238 transition count 382
Performed 80 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 622 place count 158 transition count 283
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 630 place count 158 transition count 275
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 632 place count 157 transition count 274
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 639 place count 150 transition count 267
Iterating global reduction 4 with 7 rules applied. Total rules applied 646 place count 150 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 647 place count 150 transition count 266
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 655 place count 146 transition count 262
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 743 place count 102 transition count 265
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 771 place count 102 transition count 237
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 810 place count 63 transition count 159
Iterating global reduction 6 with 39 rules applied. Total rules applied 849 place count 63 transition count 159
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 874 place count 63 transition count 134
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 884 place count 53 transition count 105
Iterating global reduction 7 with 10 rules applied. Total rules applied 894 place count 53 transition count 105
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 901 place count 53 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 906 place count 53 transition count 93
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 907 place count 53 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 909 place count 51 transition count 91
Applied a total of 909 rules in 35 ms. Remains 51 /472 variables (removed 421) and now considering 91/618 (removed 527) transitions.
[2025-05-30 12:48:09] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
// Phase 1: matrix 84 rows 51 cols
[2025-05-30 12:48:09] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:48:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 12:48:09] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
[2025-05-30 12:48:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:48:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:48:09] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:48:09] [INFO ] Redundant transitions in 0 ms returned []
Running 78 sub problems to find dead transitions.
[2025-05-30 12:48:09] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
[2025-05-30 12:48:09] [INFO ] Invariant cache hit.
[2025-05-30 12:48:09] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 83/134 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 1/135 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 57 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 83/134 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 78/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 135 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2458 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4185ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 4186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/472 places, 91/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4310 ms. Remains : 51/472 places, 91/618 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1 p2)), (X p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (AND p0 p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 114 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND p1 p0 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 34440 steps (3210 resets) in 61 ms. (555 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1 p2)), (X p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (AND p0 p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 326 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND p1 p0 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 173 ms :[(AND p1 p0 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 173 ms :[(AND p1 p0 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p0) p2)]
Product exploration explored 100000 steps with 1 reset in 57 ms.
Product exploration explored 100000 steps with 14 reset in 51 ms.
Built C files in :
/tmp/ltsmin17216043280109597220
[2025-05-30 12:48:14] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2025-05-30 12:48:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:48:14] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2025-05-30 12:48:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:48:14] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2025-05-30 12:48:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:48:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17216043280109597220
Running compilation step : cd /tmp/ltsmin17216043280109597220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin17216043280109597220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17216043280109597220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13041710176516272650.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA CO4-PT-17-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLCardinality-07 finished in 72913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 474 transition count 620
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 474 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 471 transition count 617
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 471 transition count 617
Applied a total of 30 rules in 23 ms. Remains 471 /486 variables (removed 15) and now considering 617/632 (removed 15) transitions.
// Phase 1: matrix 617 rows 471 cols
[2025-05-30 12:48:15] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:48:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-30 12:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:48:15] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:48:43] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:48:43] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 9 ms to minimize.
(s314 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0timeout
)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 471/486 places, 617/632 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60478 ms. Remains : 471/486 places, 617/632 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-17-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-08 finished in 60666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (!p1||G(!p0))))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Graph (trivial) has 530 edges and 486 vertex of which 2 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 816 edges and 485 vertex of which 482 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 481 transition count 451
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 176 rules applied. Total rules applied 354 place count 306 transition count 450
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 354 place count 306 transition count 390
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 474 place count 246 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 476 place count 244 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 478 place count 244 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 478 place count 244 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 243 transition count 387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 482 place count 241 transition count 385
Iterating global reduction 2 with 2 rules applied. Total rules applied 484 place count 241 transition count 385
Performed 87 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 658 place count 154 transition count 278
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 666 place count 154 transition count 270
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 668 place count 153 transition count 269
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 673 place count 148 transition count 264
Iterating global reduction 4 with 5 rules applied. Total rules applied 678 place count 148 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 679 place count 148 transition count 263
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 685 place count 145 transition count 260
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 773 place count 101 transition count 263
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 802 place count 101 transition count 234
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 841 place count 62 transition count 156
Iterating global reduction 6 with 39 rules applied. Total rules applied 880 place count 62 transition count 156
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 906 place count 62 transition count 130
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 916 place count 52 transition count 101
Iterating global reduction 7 with 10 rules applied. Total rules applied 926 place count 52 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 933 place count 52 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 937 place count 52 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 939 place count 50 transition count 88
Applied a total of 939 rules in 46 ms. Remains 50 /486 variables (removed 436) and now considering 88/632 (removed 544) transitions.
[2025-05-30 12:49:15] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
// Phase 1: matrix 81 rows 50 cols
[2025-05-30 12:49:15] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 12:49:15] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2025-05-30 12:49:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 12:49:16] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:49:16] [INFO ] Redundant transitions in 0 ms returned []
Running 77 sub problems to find dead transitions.
[2025-05-30 12:49:16] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2025-05-30 12:49:16] [INFO ] Invariant cache hit.
[2025-05-30 12:49:16] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:49:16] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 59 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2162 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 80/130 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 77/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 136 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2790 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4965ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 4965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/486 places, 88/632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5103 ms. Remains : 50/486 places, 88/632 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND p1 p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-12
Product exploration explored 100000 steps with 20 reset in 34 ms.
Stack based approach found an accepted trace after 700 steps with 68 reset with depth 7 and stack size 7 in 1 ms.
FORMULA CO4-PT-17-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-17-LTLCardinality-12 finished in 5318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 632/632 transitions.
Graph (trivial) has 530 edges and 486 vertex of which 2 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 816 edges and 485 vertex of which 482 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 481 transition count 451
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 177 rules applied. Total rules applied 355 place count 306 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 356 place count 305 transition count 449
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 356 place count 305 transition count 390
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 474 place count 246 transition count 390
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 477 place count 243 transition count 387
Iterating global reduction 3 with 3 rules applied. Total rules applied 480 place count 243 transition count 387
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 480 place count 243 transition count 385
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 484 place count 241 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 486 place count 239 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 488 place count 239 transition count 383
Performed 87 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 662 place count 152 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 670 place count 152 transition count 268
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 672 place count 151 transition count 267
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 677 place count 146 transition count 262
Iterating global reduction 5 with 5 rules applied. Total rules applied 682 place count 146 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 683 place count 146 transition count 261
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 689 place count 143 transition count 258
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 777 place count 99 transition count 261
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 806 place count 99 transition count 232
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 845 place count 60 transition count 154
Iterating global reduction 7 with 39 rules applied. Total rules applied 884 place count 60 transition count 154
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 911 place count 60 transition count 127
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 921 place count 50 transition count 98
Iterating global reduction 8 with 10 rules applied. Total rules applied 931 place count 50 transition count 98
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 938 place count 50 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 941 place count 50 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 943 place count 48 transition count 86
Applied a total of 943 rules in 33 ms. Remains 48 /486 variables (removed 438) and now considering 86/632 (removed 546) transitions.
[2025-05-30 12:49:21] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
// Phase 1: matrix 78 rows 48 cols
[2025-05-30 12:49:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:21] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 12:49:21] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2025-05-30 12:49:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:49:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:49:21] [INFO ] Redundant transitions in 0 ms returned []
Running 73 sub problems to find dead transitions.
[2025-05-30 12:49:21] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2025-05-30 12:49:21] [INFO ] Invariant cache hit.
[2025-05-30 12:49:21] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 54 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 73/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 127 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2232 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3594ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3594ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/486 places, 86/632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3723 ms. Remains : 48/486 places, 86/632 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-14
Product exploration explored 100000 steps with 10 reset in 38 ms.
Product exploration explored 100000 steps with 3 reset in 59 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1384 steps (129 resets) in 7 ms. (173 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2025-05-30 12:49:25] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2025-05-30 12:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 12:49:25] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2025-05-30 12:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:49:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:49:25] [INFO ] Redundant transitions in 0 ms returned []
Running 73 sub problems to find dead transitions.
[2025-05-30 12:49:25] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2025-05-30 12:49:25] [INFO ] Invariant cache hit.
[2025-05-30 12:49:25] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 54 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1539 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 73/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 127 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2258 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3809ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3809ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3909 ms. Remains : 48/48 places, 86/86 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 947 steps (86 resets) in 7 ms. (118 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 51 reset in 34 ms.
Product exploration explored 100000 steps with 21 reset in 39 ms.
Built C files in :
/tmp/ltsmin18293037751752338599
[2025-05-30 12:49:30] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2025-05-30 12:49:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:49:30] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2025-05-30 12:49:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:49:30] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2025-05-30 12:49:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:49:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18293037751752338599
Running compilation step : cd /tmp/ltsmin18293037751752338599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin18293037751752338599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18293037751752338599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15580192572516441195.hoa' '--buchi-type=spotba'
LTSmin run took 103 ms.
FORMULA CO4-PT-17-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLCardinality-14 finished in 9289 ms.
All properties solved by simple procedures.
Total runtime 402607 ms.
BK_STOP 1748609370604
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-17, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028600507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-17.tgz
mv CO4-PT-17 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;