About the Execution of ITS-Tools for Champagne-PT-H09T0R
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 570333.00 | 0.00 | 0.00 | FFFTFFFTFFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300123.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-H09T0R, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.8K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:43 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 266K 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-H09T0R-LTLCardinality-00
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-01
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-02
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-03
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-04
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-05
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-06
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-07
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-08
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-09
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-10
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-11
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-12
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-13
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-14
FORMULA_NAME Champagne-PT-H09T0R-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749328972752
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 20:42:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 20:42:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 20:42:54] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-07 20:42:54] [INFO ] Transformed 979 places.
[2025-06-07 20:42:54] [INFO ] Transformed 1572 transitions.
[2025-06-07 20:42:54] [INFO ] Found NUPN structural information;
[2025-06-07 20:42:54] [INFO ] Parsed PT model containing 979 places and 1572 transitions and 4420 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H09T0R-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T0R-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H09T0R-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T0R-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T0R-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T0R-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T0R-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 979 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 979/979 places, 1572/1572 transitions.
Discarding 235 places :
Symmetric choice reduction at 0 with 235 rule applications. Total rules 235 place count 744 transition count 1337
Iterating global reduction 0 with 235 rules applied. Total rules applied 470 place count 744 transition count 1337
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 610 place count 604 transition count 1197
Iterating global reduction 0 with 140 rules applied. Total rules applied 750 place count 604 transition count 1197
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 848 place count 506 transition count 888
Iterating global reduction 0 with 98 rules applied. Total rules applied 946 place count 506 transition count 888
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 989 place count 506 transition count 845
Applied a total of 989 rules in 181 ms. Remains 506 /979 variables (removed 473) and now considering 845/1572 (removed 727) transitions.
// Phase 1: matrix 845 rows 506 cols
[2025-06-07 20:42:54] [INFO ] Computed 49 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:42:54] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-06-07 20:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:42:55] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 844 sub problems to find dead transitions.
[2025-06-07 20:42: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/505 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 844 unsolved
At refinement iteration 1 (OVERLAPS) 1/506 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 844 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:14] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:14] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:14] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:15] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:16] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:16] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:16] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:16] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:16] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:16] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:17] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:17] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:17] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:17] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:17] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:17] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:18] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:18] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:19] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:19] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/506 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 506/1351 variables, and 69 constraints, problems are : Problem set: 0 solved, 844 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/506 constraints, PredecessorRefiner: 844/844 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 844 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 844 unsolved
At refinement iteration 1 (OVERLAPS) 1/506 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 844 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/506 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 844 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 844 unsolved
At refinement iteration 4 (OVERLAPS) 845/1351 variables, 506/575 constraints. Problems are: Problem set: 0 solved, 844 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1351 variables, 844/1419 constraints. Problems are: Problem set: 0 solved, 844 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:46] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:46] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:46] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:46] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:46] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:47] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:47] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:47] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:47] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:48] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:49] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:51] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:51] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:52] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:52] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:43:53] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 10 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 1351/1351 variables, and 1435 constraints, problems are : Problem set: 0 solved, 844 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 844/844 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 844 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Starting structural reductions in LTL mode, iteration 1 : 506/979 places, 845/1572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61337 ms. Remains : 506/979 places, 845/1572 transitions.
Support contains 28 out of 506 places after structural reductions.
[2025-06-07 20:43:55] [INFO ] Flatten gal took : 78 ms
[2025-06-07 20:43:55] [INFO ] Flatten gal took : 44 ms
[2025-06-07 20:43:56] [INFO ] Input system was already deterministic with 845 transitions.
Support contains 25 out of 506 places (down from 28) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (72 resets) in 1000 ms. (39 steps per ms) remains 0/13 properties
FORMULA Champagne-PT-H09T0R-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 57 stabilizing places and 57 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' '!(G(F(p0)))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Graph (trivial) has 469 edges and 506 vertex of which 62 / 506 are part of one of the 14 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 457 transition count 725
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 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 1 with 158 rules applied. Total rules applied 228 place count 388 transition count 636
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 271 place count 345 transition count 636
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 271 place count 345 transition count 607
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 329 place count 316 transition count 607
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 341 place count 304 transition count 589
Iterating global reduction 3 with 12 rules applied. Total rules applied 353 place count 304 transition count 589
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 355 place count 304 transition count 587
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 355 place count 304 transition count 581
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 367 place count 298 transition count 581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 368 place count 297 transition count 569
Iterating global reduction 4 with 1 rules applied. Total rules applied 369 place count 297 transition count 569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 370 place count 297 transition count 568
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 5 with 310 rules applied. Total rules applied 680 place count 142 transition count 413
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 682 place count 140 transition count 399
Iterating global reduction 5 with 2 rules applied. Total rules applied 684 place count 140 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 686 place count 140 transition count 397
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 688 place count 138 transition count 395
Applied a total of 688 rules in 145 ms. Remains 138 /506 variables (removed 368) and now considering 395/845 (removed 450) transitions.
[2025-06-07 20:43:56] [INFO ] Flow matrix only has 134 transitions (discarded 261 similar events)
// Phase 1: matrix 134 rows 138 cols
[2025-06-07 20:43:56] [INFO ] Computed 49 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:43:56] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-07 20:43:56] [INFO ] Flow matrix only has 134 transitions (discarded 261 similar events)
[2025-06-07 20:43:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:43:57] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:43:57] [INFO ] Redundant transitions in 25 ms returned []
Running 294 sub problems to find dead transitions.
[2025-06-07 20:43:57] [INFO ] Flow matrix only has 134 transitions (discarded 261 similar events)
[2025-06-07 20:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 2/138 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 133/271 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/272 variables, and 187 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10233 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 2/138 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 133/271 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 294/481 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/272 variables, and 481 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10473 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20750ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 20751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/506 places, 395/845 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21203 ms. Remains : 138/506 places, 395/845 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H09T0R-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLCardinality-02 finished in 21445 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&&X(F(p1))))))'
Support contains 1 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 489 transition count 816
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 489 transition count 816
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 489 transition count 813
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 483 transition count 796
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 483 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 483 transition count 795
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 479 transition count 780
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 479 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 479 transition count 779
Applied a total of 59 rules in 44 ms. Remains 479 /506 variables (removed 27) and now considering 779/845 (removed 66) transitions.
// Phase 1: matrix 779 rows 479 cols
[2025-06-07 20:44:18] [INFO ] Computed 49 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:44:18] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-07 20:44:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:44:18] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 778 sub problems to find dead transitions.
[2025-06-07 20:44:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 3 (OVERLAPS) 779/1258 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 528 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 3 (OVERLAPS) 779/1258 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1258 variables, 778/1306 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1258/1258 variables, and 1306 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 479/506 places, 779/845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60650 ms. Remains : 479/506 places, 779/845 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-06
Stuttering criterion allowed to conclude after 831 steps with 1 reset in 11 ms.
FORMULA Champagne-PT-H09T0R-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLCardinality-06 finished in 60850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 490 transition count 820
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 490 transition count 820
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 490 transition count 818
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 483 transition count 799
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 483 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 483 transition count 797
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 479 transition count 782
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 479 transition count 782
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 479 transition count 781
Applied a total of 59 rules in 42 ms. Remains 479 /506 variables (removed 27) and now considering 781/845 (removed 64) transitions.
// Phase 1: matrix 781 rows 479 cols
[2025-06-07 20:45:18] [INFO ] Computed 49 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:45:19] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-07 20:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:45:19] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2025-06-07 20:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 781/1260 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 528 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/479 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (OVERLAPS) 781/1260 variables, 479/528 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1260 variables, 780/1308 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 1308 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 479/506 places, 781/845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60685 ms. Remains : 479/506 places, 781/845 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T0R-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLCardinality-08 finished in 60804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Graph (trivial) has 470 edges and 506 vertex of which 62 / 506 are part of one of the 14 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 457 transition count 726
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 159 rules applied. Total rules applied 228 place count 389 transition count 635
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 272 place count 345 transition count 635
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 272 place count 345 transition count 605
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 332 place count 315 transition count 605
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 344 place count 303 transition count 581
Iterating global reduction 3 with 12 rules applied. Total rules applied 356 place count 303 transition count 581
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 359 place count 303 transition count 578
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 359 place count 303 transition count 573
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 369 place count 298 transition count 573
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 370 place count 297 transition count 561
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 297 transition count 561
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 297 transition count 560
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 5 with 308 rules applied. Total rules applied 680 place count 143 transition count 406
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 682 place count 141 transition count 392
Iterating global reduction 5 with 2 rules applied. Total rules applied 684 place count 141 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 686 place count 141 transition count 390
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 688 place count 139 transition count 388
Applied a total of 688 rules in 78 ms. Remains 139 /506 variables (removed 367) and now considering 388/845 (removed 457) transitions.
[2025-06-07 20:46:19] [INFO ] Flow matrix only has 129 transitions (discarded 259 similar events)
// Phase 1: matrix 129 rows 139 cols
[2025-06-07 20:46:19] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:19] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-07 20:46:19] [INFO ] Flow matrix only has 129 transitions (discarded 259 similar events)
[2025-06-07 20:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:19] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:46:20] [INFO ] Redundant transitions in 7 ms returned []
Running 296 sub problems to find dead transitions.
[2025-06-07 20:46:20] [INFO ] Flow matrix only has 129 transitions (discarded 259 similar events)
[2025-06-07 20:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 4/139 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 128/267 variables, 139/188 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 188 constraints, problems are : Problem set: 0 solved, 296 unsolved in 10032 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 4/139 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 128/267 variables, 139/188 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 296/484 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 484 constraints, problems are : Problem set: 0 solved, 296 unsolved in 10492 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20568ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 20569ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/506 places, 388/845 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20883 ms. Remains : 139/506 places, 388/845 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLCardinality-09 finished in 20937 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(p1)||p0))))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 490 transition count 817
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 490 transition count 817
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 490 transition count 814
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 484 transition count 796
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 484 transition count 796
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 484 transition count 794
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 480 transition count 779
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 480 transition count 779
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 480 transition count 778
Applied a total of 58 rules in 32 ms. Remains 480 /506 variables (removed 26) and now considering 778/845 (removed 67) transitions.
// Phase 1: matrix 778 rows 480 cols
[2025-06-07 20:46:40] [INFO ] Computed 49 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:40] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-07 20:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:46:41] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 777 sub problems to find dead transitions.
[2025-06-07 20:46:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 778/1258 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 529 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 777 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 3 (OVERLAPS) 778/1258 variables, 480/529 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1258 variables, 777/1306 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1258/1258 variables, and 1306 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 777 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 480/506 places, 778/845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60694 ms. Remains : 480/506 places, 778/845 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Product exploration explored 100000 steps with 33333 reset in 189 ms.
Computed a total of 49 stabilizing places and 49 stable transitions
Computed a total of 49 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H09T0R-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H09T0R-LTLCardinality-10 finished in 61372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p1) U X((F(!p2) U p3))))||p0)))'
Support contains 6 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 491 transition count 821
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 491 transition count 821
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 491 transition count 819
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 485 transition count 801
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 485 transition count 801
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 485 transition count 799
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 482 transition count 785
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 482 transition count 785
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 482 transition count 784
Applied a total of 53 rules in 40 ms. Remains 482 /506 variables (removed 24) and now considering 784/845 (removed 61) transitions.
// Phase 1: matrix 784 rows 482 cols
[2025-06-07 20:47:42] [INFO ] Computed 49 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:47:42] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-07 20:47:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:47:42] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 783 sub problems to find dead transitions.
[2025-06-07 20:47:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:47:59] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:00] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:00] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:00] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:01] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:02] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/1266 variables, and 55 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/482 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (OVERLAPS) 784/1266 variables, 482/537 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1266 variables, 783/1320 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:30] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:30] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:30] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:30] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:31] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:31] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:31] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:32] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:32] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:48:33] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1266 variables, 10/1330 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1266 variables, and 1330 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 482/506 places, 784/845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 482/506 places, 784/845 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-11
Product exploration explored 100000 steps with 1228 reset in 274 ms.
Product exploration explored 100000 steps with 1159 reset in 322 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p3)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 12538 steps (23 resets) in 137 ms. (90 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 p3 p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p3)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F (NOT (OR p1 p3 (NOT p2)))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Support contains 6 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 784/784 transitions.
Applied a total of 0 rules in 11 ms. Remains 482 /482 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2025-06-07 20:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:48:44] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-07 20:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:48:45] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 783 sub problems to find dead transitions.
[2025-06-07 20:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:02] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:02] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:03] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:03] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:03] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/1266 variables, and 55 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/482 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/482 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (OVERLAPS) 784/1266 variables, 482/537 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1266 variables, 783/1320 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:33] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:33] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:33] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:34] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:34] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:34] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:35] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:35] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1266 variables, and 1330 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in LTL mode , in 1 iterations and 60616 ms. Remains : 482/482 places, 784/784 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p3)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 79 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 18485 steps (33 resets) in 151 ms. (121 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 p3 p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p3)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F (NOT (OR p1 p3 (NOT p2)))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 1127 reset in 242 ms.
Product exploration explored 100000 steps with 1224 reset in 258 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2)]
Support contains 6 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 784/784 transitions.
Graph (trivial) has 436 edges and 482 vertex of which 54 / 482 are part of one of the 12 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 440 transition count 740
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 440 transition count 694
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 97 place count 440 transition count 694
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 144 place count 440 transition count 694
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 191 place count 393 transition count 647
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 238 place count 393 transition count 647
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 249 places in 0 ms
Iterating global reduction 2 with 199 rules applied. Total rules applied 437 place count 393 transition count 647
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 591 place count 239 transition count 493
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 2 with 154 rules applied. Total rules applied 745 place count 239 transition count 493
Deduced a syphon composed of 95 places in 0 ms
Applied a total of 745 rules in 106 ms. Remains 239 /482 variables (removed 243) and now considering 493/784 (removed 291) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:49:47] [INFO ] Redundant transitions in 8 ms returned []
Running 492 sub problems to find dead transitions.
[2025-06-07 20:49:47] [INFO ] Flow matrix only has 257 transitions (discarded 236 similar events)
// Phase 1: matrix 257 rows 239 cols
[2025-06-07 20:49:47] [INFO ] Computed 49 invariants in 1 ms
[2025-06-07 20:49:47] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 4 places in 26 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 20:49:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 3 places in 35 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 20:49:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/69 constraints. Problems are: Problem set: 58 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:54] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD159 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD173 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD187 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD201 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD229 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD244 is UNSAT
Problem TDEAD257 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD271 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD272 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Problem TDEAD307 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:55] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:56] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD331 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:56] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD343 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:56] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:56] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/89 constraints. Problems are: Problem set: 86 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD390 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD405 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD431 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD437 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD443 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD459 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:49:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD478 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 9/98 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/98 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 6 (OVERLAPS) 256/495 variables, 239/337 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 38/375 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 0/375 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 9 (OVERLAPS) 1/496 variables, 1/376 constraints. Problems are: Problem set: 95 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 376 constraints, problems are : Problem set: 95 solved, 397 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 239/239 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 96/239 variables, 49/49 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 49/98 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/98 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 256/495 variables, 239/337 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 38/375 constraints. Problems are: Problem set: 95 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 397/772 constraints. Problems are: Problem set: 95 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:50:34] [INFO ] Deduced a trap along path composed of 4 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 1/773 constraints. Problems are: Problem set: 95 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/496 variables, and 773 constraints, problems are : Problem set: 95 solved, 397 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 239/239 constraints, ReadFeed: 38/39 constraints, PredecessorRefiner: 397/492 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60127ms problems are : Problem set: 95 solved, 397 unsolved
Search for dead transitions found 95 dead transitions in 60128ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 239/482 places, 398/784 transitions.
Graph (complete) has 3202 edges and 239 vertex of which 144 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.3 ms
Discarding 95 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 144 /239 variables (removed 95) and now considering 398/398 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/482 places, 398/784 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60263 ms. Remains : 144/482 places, 398/784 transitions.
Built C files in :
/tmp/ltsmin13766586235762991382
[2025-06-07 20:50:47] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13766586235762991382
Running compilation step : cd /tmp/ltsmin13766586235762991382;'/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 1289 ms.
Running link step : cd /tmp/ltsmin13766586235762991382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin13766586235762991382;'/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/stateBased2202802621184829311.hoa' '--buchi-type=spotba'
LTSmin run took 9800 ms.
FORMULA Champagne-PT-H09T0R-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H09T0R-LTLCardinality-11 finished in 196950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Graph (trivial) has 467 edges and 506 vertex of which 62 / 506 are part of one of the 14 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 457 transition count 725
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 160 rules applied. Total rules applied 230 place count 388 transition count 634
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 274 place count 344 transition count 634
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 274 place count 344 transition count 605
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 332 place count 315 transition count 605
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 341 place count 306 transition count 584
Iterating global reduction 3 with 9 rules applied. Total rules applied 350 place count 306 transition count 584
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 353 place count 306 transition count 581
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 353 place count 306 transition count 578
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 359 place count 303 transition count 578
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 316 rules applied. Total rules applied 675 place count 145 transition count 420
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 676 place count 144 transition count 418
Iterating global reduction 4 with 1 rules applied. Total rules applied 677 place count 144 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 678 place count 144 transition count 417
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 680 place count 142 transition count 415
Applied a total of 680 rules in 52 ms. Remains 142 /506 variables (removed 364) and now considering 415/845 (removed 430) transitions.
[2025-06-07 20:50:59] [INFO ] Flow matrix only has 134 transitions (discarded 281 similar events)
// Phase 1: matrix 134 rows 142 cols
[2025-06-07 20:50:59] [INFO ] Computed 49 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:50:59] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-07 20:50:59] [INFO ] Flow matrix only has 134 transitions (discarded 281 similar events)
[2025-06-07 20:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:50:59] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:50:59] [INFO ] Redundant transitions in 3 ms returned []
Running 313 sub problems to find dead transitions.
[2025-06-07 20:50:59] [INFO ] Flow matrix only has 134 transitions (discarded 281 similar events)
[2025-06-07 20:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 2/142 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 133/275 variables, 142/191 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/276 variables, and 191 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10698 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 2/142 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 133/275 variables, 142/191 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 313/504 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/276 variables, and 504 constraints, problems are : Problem set: 0 solved, 313 unsolved in 12210 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22943ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 22944ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/506 places, 415/845 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23208 ms. Remains : 142/506 places, 415/845 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLCardinality-12 finished in 23309 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)))'
Support contains 4 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 845/845 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 490 transition count 817
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 490 transition count 817
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 490 transition count 814
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 484 transition count 796
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 484 transition count 796
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 484 transition count 794
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 481 transition count 791
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 481 transition count 791
Applied a total of 55 rules in 33 ms. Remains 481 /506 variables (removed 25) and now considering 791/845 (removed 54) transitions.
// Phase 1: matrix 791 rows 481 cols
[2025-06-07 20:51:22] [INFO ] Computed 49 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:51:22] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-07 20:51:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:51:22] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2025-06-07 20:51:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/481 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 791/1272 variables, 481/530 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 530 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/481 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 791/1272 variables, 481/530 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1272 variables, 790/1320 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1320 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 481/506 places, 791/845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60651 ms. Remains : 481/506 places, 791/845 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLCardinality-14 finished in 60787 ms.
All properties solved by simple procedures.
Total runtime 569075 ms.
BK_STOP 1749329543085
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H09T0R"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H09T0R, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339300123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H09T0R.tgz
mv Champagne-PT-H09T0R execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;