About the Execution of ITS-Tools for Champagne-PT-H07T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 721605.00 | 0.00 | 0.00 | FFFFFFTFFTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200084.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-H07T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.4K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:40 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 144K 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-H07T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H07T1U-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749324155042
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-H07T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 19:22:36] [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 19:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:22:36] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-07 19:22:36] [INFO ] Transformed 701 places.
[2025-06-07 19:22:36] [INFO ] Transformed 931 transitions.
[2025-06-07 19:22:36] [INFO ] Found NUPN structural information;
[2025-06-07 19:22:36] [INFO ] Parsed PT model containing 701 places and 931 transitions and 2312 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Champagne-PT-H07T1U-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T1U-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 931/931 transitions.
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 156 place count 545 transition count 775
Iterating global reduction 0 with 156 rules applied. Total rules applied 312 place count 545 transition count 775
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 407 place count 450 transition count 680
Iterating global reduction 0 with 95 rules applied. Total rules applied 502 place count 450 transition count 680
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 552 place count 400 transition count 630
Iterating global reduction 0 with 50 rules applied. Total rules applied 602 place count 400 transition count 630
Applied a total of 602 rules in 140 ms. Remains 400 /701 variables (removed 301) and now considering 630/931 (removed 301) transitions.
// Phase 1: matrix 630 rows 400 cols
[2025-06-07 19:22:36] [INFO ] Computed 27 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:22:37] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-06-07 19:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:22:37] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 629 sub problems to find dead transitions.
[2025-06-07 19:22: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/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (OVERLAPS) 630/1030 variables, 400/427 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 427 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (OVERLAPS) 630/1030 variables, 400/427 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 629/1056 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:23:32] [INFO ] Deduced a trap along path composed of 13 places in 46 ms of which 6 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1030/1030 variables, and 1057 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Starting structural reductions in LTL mode, iteration 1 : 400/701 places, 630/931 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60977 ms. Remains : 400/701 places, 630/931 transitions.
Support contains 39 out of 400 places after structural reductions.
[2025-06-07 19:23:37] [INFO ] Flatten gal took : 58 ms
[2025-06-07 19:23:37] [INFO ] Flatten gal took : 32 ms
[2025-06-07 19:23:37] [INFO ] Input system was already deterministic with 630 transitions.
Support contains 38 out of 400 places (down from 39) after GAL structural reductions.
RANDOM walk for 29216 steps (65 resets) in 1030 ms. (28 steps per ms) remains 0/35 properties
FORMULA Champagne-PT-H07T1U-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Champagne-PT-H07T1U-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 32 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1)) U X(p2)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 386 transition count 616
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 386 transition count 616
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 378 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 378 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 377 transition count 607
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 377 transition count 607
Applied a total of 46 rules in 33 ms. Remains 377 /400 variables (removed 23) and now considering 607/630 (removed 23) transitions.
// Phase 1: matrix 607 rows 377 cols
[2025-06-07 19:23:38] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:23:39] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-06-07 19:23:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:23:39] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2025-06-07 19:23: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/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 1.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 1.0)
(t33 0.0)
(t34 1.0)
(t35 1.0)
(t36 1.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 1.0)
(t47 1.0)
(t48 0.0)
(t49 1.0)
(t50 1.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 1.0)
(t61 1.0)
(t62 0.0)
(t63 1.0)
(t64 1.0)
(t65 1.0)
(t66 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 404 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 606/1010 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:24:32] [INFO ] Deduced a trap along path composed of 13 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(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 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1011 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 377/400 places, 607/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 377/400 places, 607/630 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), (AND p1 (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-00
Stuttering criterion allowed to conclude after 656 steps with 9 reset in 11 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-00 finished in 61125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X((p1&&X(p2)))||G(p3)||p0)) U p4))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 384 transition count 614
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 384 transition count 614
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 374 transition count 604
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 374 transition count 604
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 372 transition count 602
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 372 transition count 602
Applied a total of 56 rules in 21 ms. Remains 372 /400 variables (removed 28) and now considering 602/630 (removed 28) transitions.
// Phase 1: matrix 602 rows 372 cols
[2025-06-07 19:24:39] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:24:39] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-07 19:24:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:24:40] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2025-06-07 19:24:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/974 variables, 372/399 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 974/974 variables, and 399 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/974 variables, 372/399 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 601/1000 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:25:31] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 974/974 variables, and 1001 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 372/400 places, 602/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60471 ms. Remains : 372/400 places, 602/630 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p4), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-03 finished in 60833 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)&&F(G(p1)))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Graph (trivial) has 406 edges and 400 vertex of which 194 / 400 are part of one of the 26 SCC in 3 ms
Free SCC test removed 168 places
Ensure Unique test removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 231 transition count 403
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 93 rules applied. Total rules applied 137 place count 188 transition count 353
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 162 place count 163 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 162 place count 163 transition count 352
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 162 transition count 352
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 185 place count 141 transition count 283
Iterating global reduction 3 with 21 rules applied. Total rules applied 206 place count 141 transition count 283
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 220 place count 141 transition count 269
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 326 place count 88 transition count 216
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 330 place count 84 transition count 199
Iterating global reduction 4 with 4 rules applied. Total rules applied 334 place count 84 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 338 place count 84 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 340 place count 83 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 348 place count 83 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 349 place count 82 transition count 186
Iterating global reduction 5 with 1 rules applied. Total rules applied 350 place count 82 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 82 transition count 185
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 80 transition count 183
Applied a total of 353 rules in 153 ms. Remains 80 /400 variables (removed 320) and now considering 183/630 (removed 447) transitions.
[2025-06-07 19:25:40] [INFO ] Flow matrix only has 89 transitions (discarded 94 similar events)
// Phase 1: matrix 89 rows 80 cols
[2025-06-07 19:25:40] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:25:40] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 19:25:40] [INFO ] Flow matrix only has 89 transitions (discarded 94 similar events)
[2025-06-07 19:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:25:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:25:40] [INFO ] Redundant transitions in 5 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-07 19:25:40] [INFO ] Flow matrix only has 89 transitions (discarded 94 similar events)
[2025-06-07 19:25:40] [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, 23/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 88/168 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/169 variables, and 107 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2506 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 88/168 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 110/217 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/169 variables, and 217 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2499 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5021ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 5022ms
Starting structural reductions in SI_LTL mode, iteration 1 : 80/400 places, 183/630 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5338 ms. Remains : 80/400 places, 183/630 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-04 finished in 5448 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 (G(p1)||(p1&&G(!p0)))))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 385 transition count 615
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 385 transition count 615
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 376 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 376 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 375 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 375 transition count 605
Applied a total of 50 rules in 25 ms. Remains 375 /400 variables (removed 25) and now considering 605/630 (removed 25) transitions.
// Phase 1: matrix 605 rows 375 cols
[2025-06-07 19:25:46] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:25:46] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-07 19:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:25:46] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-07 19:25: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/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 402 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 604/1006 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:26:32] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:26:32] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:26:33] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 3/1009 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:26:40] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:26:42] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:26:44] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1012 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 375/400 places, 605/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60484 ms. Remains : 375/400 places, 605/630 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p1), (NOT p1), (NOT p0), (AND p0 (NOT p1)), false, (AND (NOT p0) (NOT p1)), true, false, p0, (AND p0 (NOT p1))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-05
Product exploration explored 100000 steps with 20080 reset in 221 ms.
Product exploration explored 100000 steps with 20029 reset in 167 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 131 ms. Reduced automaton from 10 states, 26 edges and 2 AP (stutter sensitive) to 10 states, 26 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (NOT p1), (NOT p0), (AND p0 (NOT p1)), false, (AND (NOT p0) (NOT p1)), true, false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (90 resets) in 409 ms. (97 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
[2025-06-07 19:26:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 334/375 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/980 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 334/375 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/980 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 403 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 605/605 transitions.
Graph (trivial) has 388 edges and 375 vertex of which 202 / 375 are part of one of the 27 SCC in 1 ms
Free SCC test removed 175 places
Drop transitions (Empty/Sink Transition effects.) removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 200 transition count 359
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 76 rules applied. Total rules applied 103 place count 174 transition count 309
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 128 place count 149 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 128 place count 149 transition count 307
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 147 transition count 307
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 152 place count 127 transition count 214
Iterating global reduction 3 with 20 rules applied. Total rules applied 172 place count 127 transition count 214
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 192 place count 127 transition count 194
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 288 place count 79 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 292 place count 77 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 296 place count 77 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 300 place count 77 transition count 144
Free-agglomeration rule applied 43 times.
Iterating global reduction 5 with 43 rules applied. Total rules applied 343 place count 77 transition count 101
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 102 edges and 34 vertex of which 13 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 5 with 127 rules applied. Total rules applied 470 place count 13 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 472 place count 13 transition count 12
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 476 place count 9 transition count 8
Iterating global reduction 7 with 4 rules applied. Total rules applied 480 place count 9 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 481 place count 8 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 483 place count 6 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 484 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 484 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 488 place count 4 transition count 4
Applied a total of 488 rules in 47 ms. Remains 4 /375 variables (removed 371) and now considering 4/605 (removed 601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 4/375 places, 4/605 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 11 factoid took 265 ms. Reduced automaton from 10 states, 26 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T1U-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T1U-LTLFireability-05 finished in 62759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(p1))||p0))||(p2 U X(p2)))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 384 transition count 614
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 384 transition count 614
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 373 transition count 603
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 373 transition count 603
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 371 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 371 transition count 601
Applied a total of 58 rules in 36 ms. Remains 371 /400 variables (removed 29) and now considering 601/630 (removed 29) transitions.
// Phase 1: matrix 601 rows 371 cols
[2025-06-07 19:26:48] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:26:49] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-07 19:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:26:49] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 19:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 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 972/972 variables, and 398 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 600/998 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:27:40] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 999 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 371/400 places, 601/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60460 ms. Remains : 371/400 places, 601/630 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Computed a total of 27 stabilizing places and 27 stable transitions
Detected a total of 27/371 stabilizing places and 27/601 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T1U-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T1U-LTLFireability-06 finished in 60964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1)))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 385 transition count 615
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 385 transition count 615
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 375 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 375 transition count 605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 373 transition count 603
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 373 transition count 603
Applied a total of 54 rules in 24 ms. Remains 373 /400 variables (removed 27) and now considering 603/630 (removed 27) transitions.
// Phase 1: matrix 603 rows 373 cols
[2025-06-07 19:27:49] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:27:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-07 19:27:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:27:50] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-07 19:27:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 976/976 variables, and 400 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 602/1002 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:28:41] [INFO ] Deduced a trap along path composed of 13 places in 29 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)timeout
(s185 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/976 variables, and 1003 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 373/400 places, 603/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60450 ms. Remains : 373/400 places, 603/630 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-07 finished in 60598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Graph (trivial) has 415 edges and 400 vertex of which 208 / 400 are part of one of the 27 SCC in 2 ms
Free SCC test removed 181 places
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 218 transition count 391
Reduce places removed 39 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 88 rules applied. Total rules applied 128 place count 179 transition count 342
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 152 place count 155 transition count 342
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 152 place count 155 transition count 341
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 154 transition count 341
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 177 place count 131 transition count 258
Iterating global reduction 3 with 23 rules applied. Total rules applied 200 place count 131 transition count 258
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 216 place count 131 transition count 242
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 314 place count 82 transition count 193
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 318 place count 78 transition count 176
Iterating global reduction 4 with 4 rules applied. Total rules applied 322 place count 78 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 326 place count 78 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 76 transition count 170
Applied a total of 328 rules in 33 ms. Remains 76 /400 variables (removed 324) and now considering 170/630 (removed 460) transitions.
[2025-06-07 19:28:50] [INFO ] Flow matrix only has 73 transitions (discarded 97 similar events)
// Phase 1: matrix 73 rows 76 cols
[2025-06-07 19:28:50] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:28:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 19:28:50] [INFO ] Flow matrix only has 73 transitions (discarded 97 similar events)
[2025-06-07 19:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:28:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:28:50] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 19:28:50] [INFO ] Flow matrix only has 73 transitions (discarded 97 similar events)
[2025-06-07 19:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 72/148 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 103 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 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/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 72/148 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 199 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4089ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/400 places, 170/630 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4251 ms. Remains : 76/400 places, 170/630 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-08 finished in 4303 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 p1) U X(p2)))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 385 transition count 615
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 385 transition count 615
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 375 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 375 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 374 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 374 transition count 604
Applied a total of 52 rules in 21 ms. Remains 374 /400 variables (removed 26) and now considering 604/630 (removed 26) transitions.
// Phase 1: matrix 604 rows 374 cols
[2025-06-07 19:28:54] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:28:54] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-07 19:28:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:28:55] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2025-06-07 19:28: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/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (OVERLAPS) 604/978 variables, 374/401 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 401 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/374 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (OVERLAPS) 604/978 variables, 374/401 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 603/1004 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:29:46] [INFO ] Deduced a trap along path composed of 13 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1005 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 374/400 places, 604/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60436 ms. Remains : 374/400 places, 604/630 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 163 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 (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 17 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T1U-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T1U-LTLFireability-09 finished in 61033 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 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Graph (trivial) has 412 edges and 400 vertex of which 201 / 400 are part of one of the 26 SCC in 1 ms
Free SCC test removed 175 places
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 224 transition count 395
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 91 rules applied. Total rules applied 133 place count 183 transition count 345
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 159 place count 158 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 157 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 160 place count 157 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 156 transition count 343
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 184 place count 134 transition count 261
Iterating global reduction 4 with 22 rules applied. Total rules applied 206 place count 134 transition count 261
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 222 place count 134 transition count 245
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 326 place count 82 transition count 193
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 329 place count 79 transition count 180
Iterating global reduction 5 with 3 rules applied. Total rules applied 332 place count 79 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 335 place count 79 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 337 place count 78 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 341 place count 78 transition count 176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 342 place count 77 transition count 172
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 77 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 344 place count 77 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 346 place count 75 transition count 169
Applied a total of 346 rules in 33 ms. Remains 75 /400 variables (removed 325) and now considering 169/630 (removed 461) transitions.
[2025-06-07 19:29:55] [INFO ] Flow matrix only has 74 transitions (discarded 95 similar events)
// Phase 1: matrix 74 rows 75 cols
[2025-06-07 19:29:55] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 19:29:55] [INFO ] Flow matrix only has 74 transitions (discarded 95 similar events)
[2025-06-07 19:29:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:29:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:29:55] [INFO ] Redundant transitions in 6 ms returned []
Running 97 sub problems to find dead transitions.
[2025-06-07 19:29:55] [INFO ] Flow matrix only has 74 transitions (discarded 95 similar events)
[2025-06-07 19:29: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, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 102 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 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, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 97/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 199 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2080 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4095ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 4095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/400 places, 169/630 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4249 ms. Remains : 75/400 places, 169/630 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-10 finished in 4294 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||(p1&&F(p2))))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 384 transition count 614
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 384 transition count 614
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 374 transition count 604
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 374 transition count 604
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 372 transition count 602
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 372 transition count 602
Applied a total of 56 rules in 22 ms. Remains 372 /400 variables (removed 28) and now considering 602/630 (removed 28) transitions.
// Phase 1: matrix 602 rows 372 cols
[2025-06-07 19:30:00] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:30:00] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-07 19:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:30:00] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2025-06-07 19:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/974 variables, 372/399 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 974/974 variables, and 399 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/974 variables, 372/399 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 601/1000 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:45] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:47] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:48] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:48] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:48] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/974 variables, 5/1005 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:57] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:58] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:30:58] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 974/974 variables, and 1008 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 372/400 places, 602/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 372/400 places, 602/630 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-13 finished in 60602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&X((G(p1) U p2))) U (G((p0&&X((G(p1) U p2))))||(p0&&X(((G(p1) U p2)&&X(p3)))))))))'
Support contains 5 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 385 transition count 615
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 385 transition count 615
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 375 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 375 transition count 605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 373 transition count 603
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 373 transition count 603
Applied a total of 54 rules in 19 ms. Remains 373 /400 variables (removed 27) and now considering 603/630 (removed 27) transitions.
// Phase 1: matrix 603 rows 373 cols
[2025-06-07 19:31:00] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:31:00] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-07 19:31:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:31:01] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-07 19:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 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 976/976 variables, and 400 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 602/1002 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:46] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/976 variables, 1/1003 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:54] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:58] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:59] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:31:59] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/976 variables, and 1007 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 373/400 places, 603/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60454 ms. Remains : 373/400 places, 603/630 transitions.
Stuttering acceptance computed with spot in 599 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p2 (NOT p1) (NOT p3))]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-14
Stuttering criterion allowed to conclude after 608 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T1U-LTLFireability-14 finished in 61086 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(G((G(F((!p0||G(F(p1))||(p2&&F(p1))))) U p2)))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 630/630 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 383 transition count 613
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 383 transition count 613
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 372 transition count 602
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 372 transition count 602
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 370 transition count 600
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 370 transition count 600
Applied a total of 60 rules in 22 ms. Remains 370 /400 variables (removed 30) and now considering 600/630 (removed 30) transitions.
// Phase 1: matrix 600 rows 370 cols
[2025-06-07 19:32:01] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:32:01] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-07 19:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:32:02] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2025-06-07 19:32:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 970/970 variables, and 397 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/970 variables, 599/996 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:32:53] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/970 variables, and 997 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 370/400 places, 600/630 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60454 ms. Remains : 370/400 places, 600/630 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p2)]
Running random walk in product with property : Champagne-PT-H07T1U-LTLFireability-15
Product exploration explored 100000 steps with 252 reset in 215 ms.
Product exploration explored 100000 steps with 246 reset in 244 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (89 resets) in 183 ms. (217 steps per ms) remains 1/5 properties
BEST_FIRST walk for 22088 steps (4 resets) in 38 ms. (566 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 600/600 transitions.
Applied a total of 0 rules in 11 ms. Remains 370 /370 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2025-06-07 19:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:33:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-07 19:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:33:04] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2025-06-07 19:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 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 970/970 variables, and 397 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/970 variables, 599/996 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:33:56] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/970 variables, and 997 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in LTL mode , in 1 iterations and 60419 ms. Remains : 370/370 places, 600/600 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (87 resets) in 144 ms. (275 steps per ms) remains 1/5 properties
BEST_FIRST walk for 33001 steps (7 resets) in 41 ms. (785 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 257 reset in 196 ms.
Product exploration explored 100000 steps with 248 reset in 205 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p2)]
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 600/600 transitions.
Graph (trivial) has 374 edges and 370 vertex of which 184 / 370 are part of one of the 25 SCC in 1 ms
Free SCC test removed 159 places
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 211 transition count 425
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 54 place count 211 transition count 400
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 54 place count 211 transition count 400
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 79 place count 211 transition count 400
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 121 place count 169 transition count 301
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 163 place count 169 transition count 301
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 180 place count 169 transition count 284
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 57 rules applied. Total rules applied 237 place count 169 transition count 284
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 270 place count 136 transition count 251
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 33 rules applied. Total rules applied 303 place count 136 transition count 251
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 305 place count 136 transition count 267
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 307 place count 134 transition count 263
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 309 place count 134 transition count 263
Deduced a syphon composed of 52 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 322 place count 134 transition count 250
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 324 place count 132 transition count 238
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 326 place count 132 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 328 place count 132 transition count 236
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 328 rules in 40 ms. Remains 132 /370 variables (removed 238) and now considering 236/600 (removed 364) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:34:06] [INFO ] Redundant transitions in 2 ms returned []
Running 235 sub problems to find dead transitions.
[2025-06-07 19:34:06] [INFO ] Flow matrix only has 147 transitions (discarded 89 similar events)
// Phase 1: matrix 147 rows 132 cols
[2025-06-07 19:34:06] [INFO ] Computed 27 invariants in 0 ms
[2025-06-07 19:34:06] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 29 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 19:34:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 4 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 26 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 19:34:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:08] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/47 constraints. Problems are: Problem set: 42 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:34:09] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 6/53 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/53 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 146/278 variables, 132/185 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 21/206 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/206 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/207 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/207 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/207 constraints. Problems are: Problem set: 54 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 207 constraints, problems are : Problem set: 54 solved, 181 unsolved in 10508 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 132/132 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 54 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 53/132 variables, 27/27 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 26/53 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/53 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 146/278 variables, 132/185 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 21/206 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 181/387 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/387 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/388 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/388 constraints. Problems are: Problem set: 54 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/388 constraints. Problems are: Problem set: 54 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 388 constraints, problems are : Problem set: 54 solved, 181 unsolved in 16531 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 132/132 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 181/235 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27064ms problems are : Problem set: 54 solved, 181 unsolved
Search for dead transitions found 54 dead transitions in 27065ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 132/370 places, 182/600 transitions.
Graph (complete) has 1051 edges and 132 vertex of which 80 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.2 ms
Discarding 52 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 80 /132 variables (removed 52) and now considering 182/182 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/370 places, 182/600 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27126 ms. Remains : 80/370 places, 182/600 transitions.
Built C files in :
/tmp/ltsmin13199722423369640954
[2025-06-07 19:34:33] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13199722423369640954
Running compilation step : cd /tmp/ltsmin13199722423369640954;'/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 949 ms.
Running link step : cd /tmp/ltsmin13199722423369640954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13199722423369640954;'/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/stateBased6851119364995538488.hoa' '--buchi-type=spotba'
LTSmin run took 1621 ms.
FORMULA Champagne-PT-H07T1U-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H07T1U-LTLFireability-15 finished in 154860 ms.
All properties solved by simple procedures.
Total runtime 720394 ms.
BK_STOP 1749324876647
--------------------
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-H07T1U"
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-H07T1U, 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-174931339200084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H07T1U.tgz
mv Champagne-PT-H07T1U 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 ;