About the Execution of ITS-Tools for Champagne-PT-H07T0R
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 837581.00 | 0.00 | 0.00 | FFFFFFFFFFFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200076.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 Champagne-PT-H07T0R, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.2K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 119K Jun 5 20:08 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 Champagne-PT-H07T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H07T0R-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749322180832
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 18:49:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 18:49:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:49:42] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-06-07 18:49:42] [INFO ] Transformed 539 places.
[2025-06-07 18:49:42] [INFO ] Transformed 742 transitions.
[2025-06-07 18:49:42] [INFO ] Found NUPN structural information;
[2025-06-07 18:49:42] [INFO ] Parsed PT model containing 539 places and 742 transitions and 1934 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H07T0R-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 742/742 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 415 transition count 618
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 415 transition count 618
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 319 place count 344 transition count 547
Iterating global reduction 0 with 71 rules applied. Total rules applied 390 place count 344 transition count 547
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 435 place count 299 transition count 459
Iterating global reduction 0 with 45 rules applied. Total rules applied 480 place count 299 transition count 459
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 498 place count 299 transition count 441
Applied a total of 498 rules in 95 ms. Remains 299 /539 variables (removed 240) and now considering 441/742 (removed 301) transitions.
// Phase 1: matrix 441 rows 299 cols
[2025-06-07 18:49:42] [INFO ] Computed 27 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:49:42] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-06-07 18:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:49:43] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2025-06-07 18:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:50] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:50] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:50] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:51] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:51] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:51] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:51] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:51] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (OVERLAPS) 441/740 variables, 299/338 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/740 variables, and 338 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:16] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:16] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:16] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:17] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (OVERLAPS) 441/740 variables, 299/342 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 440/782 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:23] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:23] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:23] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:24] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:24] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:25] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:25] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:25] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 8/790 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:31] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:37] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:38] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:38] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:38] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 795 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in LTL mode, iteration 1 : 299/539 places, 441/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60872 ms. Remains : 299/539 places, 441/742 transitions.
Support contains 41 out of 299 places after structural reductions.
[2025-06-07 18:50:43] [INFO ] Flatten gal took : 65 ms
[2025-06-07 18:50:43] [INFO ] Flatten gal took : 42 ms
[2025-06-07 18:50:43] [INFO ] Input system was already deterministic with 441 transitions.
RANDOM walk for 40000 steps (138 resets) in 1060 ms. (37 steps per ms) remains 1/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
[2025-06-07 18:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 283/299 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 441/740 variables, 299/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/740 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 299/299 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 283/299 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 441/740 variables, 299/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/740 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 7 ms.
Computed a total of 33 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||(p0 U p2)||X(p3)))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 280 transition count 413
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 280 transition count 413
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 280 transition count 410
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 270 transition count 397
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 270 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 270 transition count 396
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 265 transition count 375
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 265 transition count 375
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 265 transition count 371
Applied a total of 76 rules in 19 ms. Remains 265 /299 variables (removed 34) and now considering 371/441 (removed 70) transitions.
// Phase 1: matrix 371 rows 265 cols
[2025-06-07 18:50:45] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:50:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 18:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:50:45] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-07 18:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:50] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:50] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:51] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:51] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:51] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:51] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:51] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/636 variables, 265/299 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/636 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/636 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 299 constraints, problems are : Problem set: 0 solved, 370 unsolved in 27563 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/636 variables, 265/299 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/636 variables, 370/669 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:18] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:18] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/636 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:22] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:23] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/636 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:26] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:27] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:27] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:28] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/636 variables, 4/678 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:31] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:32] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:32] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:32] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:32] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:32] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:32] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:32] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/636 variables, 8/686 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:37] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:38] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:38] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:39] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 4/690 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/636 variables, and 690 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57634ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 57636ms
Starting structural reductions in LTL mode, iteration 1 : 265/299 places, 371/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57917 ms. Remains : 265/299 places, 371/441 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-00 finished in 58400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 278 transition count 409
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 278 transition count 409
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 278 transition count 405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 268 transition count 392
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 268 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 268 transition count 391
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 263 transition count 370
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 263 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 263 transition count 366
Applied a total of 81 rules in 25 ms. Remains 263 /299 variables (removed 36) and now considering 366/441 (removed 75) transitions.
// Phase 1: matrix 366 rows 263 cols
[2025-06-07 18:51:43] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:51:43] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-07 18:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:51:44] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-07 18:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 366/629 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 0/629 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 290 constraints, problems are : Problem set: 0 solved, 365 unsolved in 23345 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 366/629 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 365/655 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:16] [INFO ] Deduced a trap along path composed of 9 places in 44 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:22] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:22] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:23] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:23] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:23] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:27] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:28] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:33] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:34] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 665 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53392ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 53394ms
Starting structural reductions in LTL mode, iteration 1 : 263/299 places, 366/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53694 ms. Remains : 263/299 places, 366/441 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-02 finished in 53843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U X(X(X(p1)))))))'
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 278 transition count 409
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 278 transition count 409
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 278 transition count 405
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 269 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 269 transition count 396
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 264 transition count 375
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 264 transition count 375
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 264 transition count 371
Applied a total of 78 rules in 17 ms. Remains 264 /299 variables (removed 35) and now considering 371/441 (removed 70) transitions.
// Phase 1: matrix 371 rows 264 cols
[2025-06-07 18:52:37] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:52:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-07 18:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:52:37] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-07 18:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/635 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 0/635 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 291 constraints, problems are : Problem set: 0 solved, 370 unsolved in 23026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/635 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 370/661 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:10] [INFO ] Deduced a trap along path composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:15] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:16] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:16] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:19] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:20] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:20] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:21] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 4/669 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:24] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:24] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:25] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:25] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/635 variables, 4/673 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/635 variables, and 673 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53075ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 53077ms
Starting structural reductions in LTL mode, iteration 1 : 264/299 places, 371/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53353 ms. Remains : 264/299 places, 371/441 transitions.
Stuttering acceptance computed with spot in 539 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-03
Stuttering criterion allowed to conclude after 305 steps with 1 reset in 6 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-03 finished in 53932 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((X((p1 U p2))||p0)))'
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 280 transition count 411
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 280 transition count 411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 280 transition count 407
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 272 transition count 396
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 272 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 272 transition count 395
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 268 transition count 375
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 268 transition count 375
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 268 transition count 372
Applied a total of 70 rules in 13 ms. Remains 268 /299 variables (removed 31) and now considering 372/441 (removed 69) transitions.
// Phase 1: matrix 372 rows 268 cols
[2025-06-07 18:53:31] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:53:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-07 18:53:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:53:31] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-07 18:53:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:37] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:37] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:37] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:37] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/640 variables, 268/299 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 299 constraints, problems are : Problem set: 0 solved, 371 unsolved in 27159 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/640 variables, 268/299 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 371/670 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:04] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:04] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 4/674 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:12] [INFO ] Deduced a trap along path composed of 9 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:16] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:17] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:18] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:18] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:18] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 5/680 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:22] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:23] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:23] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:24] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/640 variables, and 684 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57206ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 57207ms
Starting structural reductions in LTL mode, iteration 1 : 268/299 places, 372/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57478 ms. Remains : 268/299 places, 372/441 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-05
Stuttering criterion allowed to conclude after 300 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-05 finished in 57575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p0)&&((p1&&X((p1 U (X(!p1)||G(p1))))) U (G((p1&&X((p1 U (X(!p1)||G(p1))))))||(p1&&X((p1 U (X(!p1)||G(p1))))&&(p2 U (p3||G(p2)))))))||X(G(p0)))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 280 transition count 411
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 280 transition count 411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 280 transition count 407
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 273 transition count 397
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 273 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 273 transition count 396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 270 transition count 389
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 270 transition count 389
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 270 transition count 387
Applied a total of 65 rules in 15 ms. Remains 270 /299 variables (removed 29) and now considering 387/441 (removed 54) transitions.
// Phase 1: matrix 387 rows 270 cols
[2025-06-07 18:54:29] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-07 18:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:29] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-06-07 18:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/657 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 0/657 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 297 constraints, problems are : Problem set: 0 solved, 386 unsolved in 25208 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/657 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 386/683 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:04] [INFO ] Deduced a trap along path composed of 9 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:06] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:11] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:16] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 0)
(t5 0)
(t6 0)
(t7 1)
(t8 1)
(t9 1)
(t10 0)
(t11 1)
(t12 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 687 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55265ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 55266ms
Starting structural reductions in LTL mode, iteration 1 : 270/299 places, 387/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55547 ms. Remains : 270/299 places, 387/441 transitions.
Stuttering acceptance computed with spot in 867 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-06
Product exploration explored 100000 steps with 39962 reset in 236 ms.
Product exploration explored 100000 steps with 39992 reset in 217 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X p2), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND p1 p3) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (AND p1 (NOT p3) p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (AND p1 (NOT p3) p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (AND p1 p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (OR (AND p1 p3) (AND p1 p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p3) p2 p0))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 48 factoid took 197 ms. Reduced automaton from 19 states, 97 edges and 4 AP (stutter sensitive) to 19 states, 97 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 910 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (147 resets) in 570 ms. (70 steps per ms) remains 1/26 properties
BEST_FIRST walk for 38820 steps (10 resets) in 178 ms. (216 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X p2), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND p1 p3) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (AND p1 (NOT p3) p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (AND p1 (NOT p3) p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (AND p1 p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (OR (AND p1 p3) (AND p1 p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p3) p2 p0))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p3 p2 p0))), (F (NOT (OR p1 p3 (NOT p2) (NOT p0)))), (F (NOT (OR p1 p3 p2))), (F (NOT (AND (OR (NOT p1) (NOT p3) p0) (OR (NOT p1) (NOT p2) p0)))), (F (NOT (OR (NOT p1) p3 p2))), (F (NOT (AND p1 (NOT p3) p2 p0))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR p3 p2 p0))), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p1) p3 p2 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p3) p2))), (F (NOT (OR p1 p3 (NOT p2) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (AND p1 p3) (AND p1 p2)))), (F (NOT (OR p3 (NOT p2) p0))), (F (NOT (OR (NOT p1) p3 p2 (NOT p0)))), (F (NOT (OR p1 p3 (NOT p2)))), (F (NOT (OR p3 p2))), (F (NOT (OR p1 p3 p2 (NOT p0)))), (F (NOT (AND p1 (NOT p3) p2))), (F (NOT (OR (AND p1 p3 p0) (AND p1 p2 p0)))), (F (NOT (OR (NOT p1) p3 (NOT p2) p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 48 factoid took 1268 ms. Reduced automaton from 19 states, 97 edges and 4 AP (stutter sensitive) to 19 states, 97 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 788 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 791 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 387/387 transitions.
Applied a total of 0 rules in 3 ms. Remains 270 /270 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2025-06-07 18:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:55:30] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-07 18:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:55:30] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-06-07 18:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/657 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 0/657 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 297 constraints, problems are : Problem set: 0 solved, 386 unsolved in 24235 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/657 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 386/683 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:04] [INFO ] Deduced a trap along path composed of 9 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:06] [INFO ] Deduced a trap along path composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:10] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:16] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 687 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54288ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 54289ms
Finished structural reductions in LTL mode , in 1 iterations and 54605 ms. Remains : 270/270 places, 387/387 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X p2), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND p1 p3) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (AND p1 (NOT p3) p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (AND p1 (NOT p3) p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (AND p1 p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (OR (AND p1 p3) (AND p1 p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p3) p2 p0))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 48 factoid took 273 ms. Reduced automaton from 19 states, 97 edges and 4 AP (stutter sensitive) to 19 states, 97 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 794 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 31603 steps (112 resets) in 197 ms. (159 steps per ms) remains 0/26 properties
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X p2), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND p1 p3) (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (AND p1 (NOT p3) p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X p0), (X (AND p1 (NOT p3) p2 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (AND p1 p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (OR (AND p1 p3) (AND p1 p2)))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p3) p2 p0))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p3 p2 p0))), (F (NOT (OR p1 p3 (NOT p2) (NOT p0)))), (F (NOT (OR p1 p3 p2))), (F (NOT (AND (OR (NOT p1) (NOT p3) p0) (OR (NOT p1) (NOT p2) p0)))), (F (NOT (OR (NOT p1) p3 p2))), (F (NOT (AND p1 (NOT p3) p2 p0))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR p3 p2 p0))), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p1) p3 p2 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p3) p2))), (F (NOT (OR p1 p3 (NOT p2) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (AND p1 p3) (AND p1 p2)))), (F (NOT (OR p3 (NOT p2) p0))), (F (NOT (OR (NOT p1) p3 p2 (NOT p0)))), (F (NOT (OR p1 p3 (NOT p2)))), (F (NOT (OR p3 p2))), (F (NOT (OR p1 p3 p2 (NOT p0)))), (F (NOT (AND p1 (NOT p3) p2))), (F (NOT (OR (AND p1 p3 p0) (AND p1 p2 p0)))), (F (NOT (OR (NOT p1) p3 (NOT p2) p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 48 factoid took 1210 ms. Reduced automaton from 19 states, 97 edges and 4 AP (stutter sensitive) to 19 states, 97 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 694 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 710 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 676 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 40018 reset in 247 ms.
Product exploration explored 100000 steps with 40182 reset in 205 ms.
Applying partial POR strategy [true, false, false, false, false, true, false, false, false, false, true, false, false, true, false, false, false, true, false]
Stuttering acceptance computed with spot in 692 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND p0 p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) p1 (NOT p3) (NOT p2))]
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 387/387 transitions.
Graph (trivial) has 245 edges and 270 vertex of which 42 / 270 are part of one of the 9 SCC in 3 ms
Free SCC test removed 33 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 237 transition count 352
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 237 transition count 327
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 51 place count 237 transition count 327
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 76 place count 237 transition count 327
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 101 place count 212 transition count 302
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 126 place count 212 transition count 302
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 103 rules applied. Total rules applied 229 place count 212 transition count 302
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 306 place count 135 transition count 225
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 383 place count 135 transition count 225
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 383 rules in 127 ms. Remains 135 /270 variables (removed 135) and now considering 225/387 (removed 162) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:56:30] [INFO ] Redundant transitions in 7 ms returned []
Running 224 sub problems to find dead transitions.
[2025-06-07 18:56:30] [INFO ] Flow matrix only has 143 transitions (discarded 82 similar events)
// Phase 1: matrix 143 rows 135 cols
[2025-06-07 18:56:30] [INFO ] Computed 27 invariants in 1 ms
[2025-06-07 18:56:30] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:32] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:32] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:32] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 12 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/47 constraints. Problems are: Problem set: 45 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 6/53 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/53 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 142/277 variables, 135/188 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 22/210 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/210 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/211 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/211 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/211 constraints. Problems are: Problem set: 51 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 211 constraints, problems are : Problem set: 51 solved, 173 unsolved in 10665 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 135/135 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 52/135 variables, 27/27 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 26/53 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/53 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 142/277 variables, 135/188 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 22/210 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 173/383 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/383 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/384 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/384 constraints. Problems are: Problem set: 51 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/384 constraints. Problems are: Problem set: 51 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 384 constraints, problems are : Problem set: 51 solved, 173 unsolved in 15579 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 135/135 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 173/224 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26356ms problems are : Problem set: 51 solved, 173 unsolved
Search for dead transitions found 51 dead transitions in 26356ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 135/270 places, 174/387 transitions.
Graph (complete) has 1076 edges and 135 vertex of which 84 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.2 ms
Discarding 51 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 84 /135 variables (removed 51) and now considering 174/174 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/270 places, 174/387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26540 ms. Remains : 84/270 places, 174/387 transitions.
Built C files in :
/tmp/ltsmin9134146611849921832
[2025-06-07 18:56:57] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9134146611849921832
Running compilation step : cd /tmp/ltsmin9134146611849921832;'/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 736 ms.
Running link step : cd /tmp/ltsmin9134146611849921832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9134146611849921832;'/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/stateBased3648970827300220656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 387/387 transitions.
Applied a total of 0 rules in 7 ms. Remains 270 /270 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 270 cols
[2025-06-07 18:57:12] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:57:12] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-07 18:57:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:57:12] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-06-07 18:57:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/657 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 0/657 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 297 constraints, problems are : Problem set: 0 solved, 386 unsolved in 24507 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/657 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 386/683 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:57:47] [INFO ] Deduced a trap along path composed of 9 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:57:48] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:57:53] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:57:58] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 687 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54588ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 54589ms
Finished structural reductions in LTL mode , in 1 iterations and 54970 ms. Remains : 270/270 places, 387/387 transitions.
Built C files in :
/tmp/ltsmin8467184128310810573
[2025-06-07 18:58:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8467184128310810573
Running compilation step : cd /tmp/ltsmin8467184128310810573;'/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 527 ms.
Running link step : cd /tmp/ltsmin8467184128310810573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8467184128310810573;'/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/stateBased5621340238987951244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 18:58:22] [INFO ] Flatten gal took : 45 ms
[2025-06-07 18:58:22] [INFO ] Flatten gal took : 32 ms
[2025-06-07 18:58:22] [INFO ] Time to serialize gal into /tmp/LTL6020123400258707537.gal : 5 ms
[2025-06-07 18:58:22] [INFO ] Time to serialize properties into /tmp/LTL17487706486108356137.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6020123400258707537.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3810644510728907600.hoa' '-atoms' '/tmp/LTL17487706486108356137.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17487706486108356137.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3810644510728907600.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t33, t39, t44, t49, t50, t55, t61, t65, t70, t74, t79, t80, t84, t90, t94, t101...455
Computing Next relation with stutter on 2.3593e+06 deadlock states
Detected timeout of ITS tools.
[2025-06-07 18:58:38] [INFO ] Flatten gal took : 17 ms
[2025-06-07 18:58:38] [INFO ] Flatten gal took : 16 ms
[2025-06-07 18:58:38] [INFO ] Time to serialize gal into /tmp/LTL5259663261576395853.gal : 13 ms
[2025-06-07 18:58:38] [INFO ] Time to serialize properties into /tmp/LTL1806704821223689815.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5259663261576395853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1806704821223689815.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X("(p205!=1)"))U((X(G("(p205!=1)")))||((X("(p205!=1)"))&&((("(p79!=1)")&&(X(("(p79!=1)")U((X("(p79==1)"))||(G("(p79!=1)"))))))U((G...366
Formula 0 simplified : X!"(p205!=1)" R (XF!"(p205!=1)" & (X!"(p205!=1)" | ((!"(p79!=1)" | X(!"(p79!=1)" M X!"(p79==1)")) M (!"(p79!=1)" | X(!"(p79!=1)" M X...216
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t33, t39, t44, t49, t50, t55, t61, t65, t70, t74, t79, t80, t84, t90, t94, t101...455
Computing Next relation with stutter on 2.3593e+06 deadlock states
Detected timeout of ITS tools.
[2025-06-07 18:58:53] [INFO ] Flatten gal took : 16 ms
[2025-06-07 18:58:53] [INFO ] Applying decomposition
[2025-06-07 18:58:53] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17830558215413628988.txt' '-o' '/tmp/graph17830558215413628988.bin' '-w' '/tmp/graph17830558215413628988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17830558215413628988.bin' '-l' '-1' '-v' '-w' '/tmp/graph17830558215413628988.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:58:53] [INFO ] Decomposing Gal with order
[2025-06-07 18:58:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:58:53] [INFO ] Removed a total of 306 redundant transitions.
[2025-06-07 18:58:53] [INFO ] Flatten gal took : 68 ms
[2025-06-07 18:58:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2025-06-07 18:58:53] [INFO ] Time to serialize gal into /tmp/LTL14548599840728098462.gal : 5 ms
[2025-06-07 18:58:53] [INFO ] Time to serialize properties into /tmp/LTL1852376844386225609.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14548599840728098462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1852376844386225609.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X("(i9.u28.p205!=1)"))U((X(G("(i9.u28.p205!=1)")))||((X("(i9.u28.p205!=1)"))&&((("(i4.u11.p79!=1)")&&(X(("(i4.u11.p79!=1)")U((X("(...503
Formula 0 simplified : X!"(i9.u28.p205!=1)" R (XF!"(i9.u28.p205!=1)" & (X!"(i9.u28.p205!=1)" | ((!"(i4.u11.p79!=1)" | X(!"(i4.u11.p79!=1)" M X!"(i4.u11.p79...303
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t49, t79, t122, t181, t226, i0.i1.t251, i1.t300, i2.t286, i3.t271, i4.t261, i5.t241,...716
Computing Next relation with stutter on 2.3593e+06 deadlock states
6 unique states visited
5 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
116 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.22958,79864,1,0,190283,386,3809,147709,250,846,304337
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H07T0R-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Champagne-PT-H07T0R-LTLFireability-06 finished in 265799 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 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Graph (trivial) has 281 edges and 299 vertex of which 46 / 299 are part of one of the 9 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 261 transition count 352
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 96 rules applied. Total rules applied 144 place count 214 transition count 303
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 168 place count 190 transition count 303
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 168 place count 190 transition count 291
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 192 place count 178 transition count 291
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 206 place count 164 transition count 266
Iterating global reduction 3 with 14 rules applied. Total rules applied 220 place count 164 transition count 266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 223 place count 164 transition count 263
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 223 place count 164 transition count 258
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 233 place count 159 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 158 transition count 254
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 158 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 158 transition count 253
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 392 place count 80 transition count 175
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 395 place count 77 transition count 156
Iterating global reduction 5 with 3 rules applied. Total rules applied 398 place count 77 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 401 place count 77 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 403 place count 75 transition count 151
Applied a total of 403 rules in 55 ms. Remains 75 /299 variables (removed 224) and now considering 151/441 (removed 290) transitions.
[2025-06-07 18:58:55] [INFO ] Flow matrix only has 74 transitions (discarded 77 similar events)
// Phase 1: matrix 74 rows 75 cols
[2025-06-07 18:58:55] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:58:55] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-07 18:58:55] [INFO ] Flow matrix only has 74 transitions (discarded 77 similar events)
[2025-06-07 18:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:58:55] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:58:55] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 18:58:55] [INFO ] Flow matrix only has 74 transitions (discarded 77 similar events)
[2025-06-07 18:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 102 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2034 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 96/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 198 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2145 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4192ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/299 places, 151/441 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4422 ms. Remains : 75/299 places, 151/441 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-07 finished in 4476 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' '!(((p0 U (p1||F(p2)))&&X(X(X(p3)))&&F(p4)))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 279 transition count 410
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 279 transition count 410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 279 transition count 406
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 270 transition count 394
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 270 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 270 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 267 transition count 384
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 267 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 267 transition count 382
Applied a total of 71 rules in 28 ms. Remains 267 /299 variables (removed 32) and now considering 382/441 (removed 59) transitions.
// Phase 1: matrix 382 rows 267 cols
[2025-06-07 18:58:59] [INFO ] Computed 27 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:58:59] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-07 18:58:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:58:59] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2025-06-07 18:58: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/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (OVERLAPS) 382/649 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 0/649 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 381 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 294 constraints, problems are : Problem set: 0 solved, 381 unsolved in 23636 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (OVERLAPS) 382/649 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 381/675 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:59:31] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:59:36] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:59:41] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:59:41] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:59:47] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:59:51] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:59:52] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 682 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53695ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 53696ms
Starting structural reductions in LTL mode, iteration 1 : 267/299 places, 382/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54060 ms. Remains : 267/299 places, 382/441 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p3) (NOT p4) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p3), (NOT p4), (AND (NOT p1) (NOT p2)), (NOT p3), (NOT p3), true]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-08
Stuttering criterion allowed to conclude after 1040 steps with 11 reset in 3 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-08 finished in 54373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0 U p1) U p2)&&F(X(X(!(p1 U p2))))))))'
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 278 transition count 409
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 278 transition count 409
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 278 transition count 405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 268 transition count 392
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 268 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 268 transition count 391
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 263 transition count 370
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 263 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 263 transition count 366
Applied a total of 81 rules in 10 ms. Remains 263 /299 variables (removed 36) and now considering 366/441 (removed 75) transitions.
// Phase 1: matrix 366 rows 263 cols
[2025-06-07 18:59:53] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:59:53] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-07 18:59:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:59:54] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-07 18:59:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 366/629 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 0/629 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 290 constraints, problems are : Problem set: 0 solved, 365 unsolved in 21968 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 366/629 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 365/655 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:25] [INFO ] Deduced a trap along path composed of 9 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:29] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:31] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:34] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:35] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:38] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:39] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:39] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:39] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:40] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:40] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:00:40] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 7/667 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 667 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52023ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 52023ms
Starting structural reductions in LTL mode, iteration 1 : 263/299 places, 366/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52331 ms. Remains : 263/299 places, 366/441 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, true, true, true, (NOT p1), (NOT p2), p2, p2]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-09 finished in 52597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((!p1||X(((p2||X(X(!p0))) U (!p1&&(p2||X(X(!p0)))))))))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 279 transition count 413
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 279 transition count 413
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 279 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 270 transition count 398
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 270 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 270 transition count 397
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 267 transition count 384
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 267 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 267 transition count 381
Applied a total of 71 rules in 18 ms. Remains 267 /299 variables (removed 32) and now considering 381/441 (removed 60) transitions.
// Phase 1: matrix 381 rows 267 cols
[2025-06-07 19:00:46] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:00:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-07 19:00:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:00:46] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-07 19:00:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/648 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 0/648 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 294 constraints, problems are : Problem set: 0 solved, 380 unsolved in 23438 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/648 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 380/674 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:19] [INFO ] Deduced a trap along path composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:24] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:25] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:25] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:26] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 4/679 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:30] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:30] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:31] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 3/682 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:36] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:01:37] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 684 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53482ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 53483ms
Starting structural reductions in LTL mode, iteration 1 : 267/299 places, 381/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53758 ms. Remains : 267/299 places, 381/441 transitions.
Stuttering acceptance computed with spot in 651 ms :[p1, (AND (NOT p0) p1), p1, (OR p1 (AND p0 (NOT p2))), p0, p0, true, (AND (NOT p0) p1), p1, p1, false, (AND p0 p1), (AND p0 p1), false, (AND p0 p1), (AND p0 (NOT p2)), (AND p0 p1), (AND p0 p1), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-10
Product exploration explored 100000 steps with 416 reset in 208 ms.
Entered a terminal (fully accepting) state of product in 60990 steps with 265 reset in 139 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-10 finished in 54800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 279 transition count 410
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 279 transition count 410
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 279 transition count 407
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 269 transition count 394
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 269 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 269 transition count 393
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 264 transition count 372
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 264 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 264 transition count 368
Applied a total of 78 rules in 11 ms. Remains 264 /299 variables (removed 35) and now considering 368/441 (removed 73) transitions.
// Phase 1: matrix 368 rows 264 cols
[2025-06-07 19:01:41] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:01:41] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-07 19:01:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:01:41] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-07 19:01:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 368/632 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/632 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 0/632 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 291 constraints, problems are : Problem set: 0 solved, 367 unsolved in 22404 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 368/632 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/632 variables, 367/658 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:13] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:18] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:19] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:21] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:22] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:26] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:27] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:02:27] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 666 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52453ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 52455ms
Starting structural reductions in LTL mode, iteration 1 : 264/299 places, 368/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52833 ms. Remains : 264/299 places, 368/441 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-11
Stuttering criterion allowed to conclude after 247 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-11 finished in 52999 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(p0))&&F(p1))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Graph (trivial) has 276 edges and 299 vertex of which 42 / 299 are part of one of the 8 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 264 transition count 356
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 92 rules applied. Total rules applied 139 place count 218 transition count 310
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 162 place count 196 transition count 309
Reduce places removed 1 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 3 with 3 rules applied. Total rules applied 165 place count 195 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 194 transition count 307
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 166 place count 194 transition count 293
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 194 place count 180 transition count 293
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 206 place count 168 transition count 276
Iterating global reduction 5 with 12 rules applied. Total rules applied 218 place count 168 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 220 place count 168 transition count 274
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 220 place count 168 transition count 269
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 230 place count 163 transition count 269
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 231 place count 162 transition count 265
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 162 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 162 transition count 264
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 7 with 156 rules applied. Total rules applied 389 place count 84 transition count 186
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 392 place count 81 transition count 167
Iterating global reduction 7 with 3 rules applied. Total rules applied 395 place count 81 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 398 place count 81 transition count 164
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 400 place count 79 transition count 162
Applied a total of 400 rules in 42 ms. Remains 79 /299 variables (removed 220) and now considering 162/441 (removed 279) transitions.
[2025-06-07 19:02:34] [INFO ] Flow matrix only has 87 transitions (discarded 75 similar events)
// Phase 1: matrix 87 rows 79 cols
[2025-06-07 19:02:34] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:02:34] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-07 19:02:34] [INFO ] Flow matrix only has 87 transitions (discarded 75 similar events)
[2025-06-07 19:02:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:02:34] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:02:34] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-07 19:02:34] [INFO ] Flow matrix only has 87 transitions (discarded 75 similar events)
[2025-06-07 19:02:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/79 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 86/165 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/166 variables, and 106 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2335 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/79 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 86/165 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 106/212 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/166 variables, and 212 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2422 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4792ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 4793ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/299 places, 162/441 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5217 ms. Remains : 79/299 places, 162/441 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-12 finished in 5325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G(p1)) U ((p2 U p3)||X(!p0))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 280 transition count 411
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 280 transition count 411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 280 transition count 407
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 272 transition count 396
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 272 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 272 transition count 395
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 267 transition count 374
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 267 transition count 374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 267 transition count 370
Applied a total of 73 rules in 11 ms. Remains 267 /299 variables (removed 32) and now considering 370/441 (removed 71) transitions.
// Phase 1: matrix 370 rows 267 cols
[2025-06-07 19:02:39] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:02:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 19:02:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:02:39] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 19:02:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 294 constraints, problems are : Problem set: 0 solved, 369 unsolved in 22906 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 369/663 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:11] [INFO ] Deduced a trap along path composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:16] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:18] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:18] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:18] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:18] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 5/669 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:22] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:22] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:22] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:23] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:24] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:24] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 6/675 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:28] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:03:28] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/637 variables, and 677 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52954ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 52955ms
Starting structural reductions in LTL mode, iteration 1 : 267/299 places, 370/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53257 ms. Remains : 267/299 places, 370/441 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND p0 (NOT p3)), p0, (AND (NOT p1) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/267 stabilizing places and 30/370 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 p0 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 35 factoid took 54 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T0R-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T0R-LTLFireability-14 finished in 53931 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 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 441/441 transitions.
Graph (trivial) has 277 edges and 299 vertex of which 46 / 299 are part of one of the 9 SCC in 0 ms
Free SCC test removed 37 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 261 transition count 352
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 96 rules applied. Total rules applied 144 place count 214 transition count 303
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 168 place count 190 transition count 303
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 168 place count 190 transition count 292
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 190 place count 179 transition count 292
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 203 place count 166 transition count 270
Iterating global reduction 3 with 13 rules applied. Total rules applied 216 place count 166 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 218 place count 166 transition count 268
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 218 place count 166 transition count 263
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 228 place count 161 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 229 place count 160 transition count 259
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 160 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 160 transition count 258
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 387 place count 82 transition count 180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 390 place count 79 transition count 161
Iterating global reduction 5 with 3 rules applied. Total rules applied 393 place count 79 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 396 place count 79 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 398 place count 77 transition count 156
Applied a total of 398 rules in 65 ms. Remains 77 /299 variables (removed 222) and now considering 156/441 (removed 285) transitions.
[2025-06-07 19:03:33] [INFO ] Flow matrix only has 78 transitions (discarded 78 similar events)
// Phase 1: matrix 78 rows 77 cols
[2025-06-07 19:03:33] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:03:33] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-06-07 19:03:33] [INFO ] Flow matrix only has 78 transitions (discarded 78 similar events)
[2025-06-07 19:03:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:03:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:03:33] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-07 19:03:33] [INFO ] Flow matrix only has 78 transitions (discarded 78 similar events)
[2025-06-07 19:03: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/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 77/154 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 104 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 77/154 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 205 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2195 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4415ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 4416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/299 places, 156/441 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4853 ms. Remains : 77/299 places, 156/441 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLFireability-15 finished in 4929 ms.
All properties solved by simple procedures.
Total runtime 836337 ms.
BK_STOP 1749323018413
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H07T0R"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H07T0R, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H07T0R.tgz
mv Champagne-PT-H07T0R execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;