About the Execution of ITS-Tools for DLCround-PT-09b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1162016.00 | 0.00 | 0.00 | FFFTFFTFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067000219.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 DLCround-PT-09b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067000219
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DLCround-PT-09b-LTLCardinality-00
FORMULA_NAME DLCround-PT-09b-LTLCardinality-01
FORMULA_NAME DLCround-PT-09b-LTLCardinality-02
FORMULA_NAME DLCround-PT-09b-LTLCardinality-03
FORMULA_NAME DLCround-PT-09b-LTLCardinality-04
FORMULA_NAME DLCround-PT-09b-LTLCardinality-05
FORMULA_NAME DLCround-PT-09b-LTLCardinality-06
FORMULA_NAME DLCround-PT-09b-LTLCardinality-07
FORMULA_NAME DLCround-PT-09b-LTLCardinality-08
FORMULA_NAME DLCround-PT-09b-LTLCardinality-09
FORMULA_NAME DLCround-PT-09b-LTLCardinality-10
FORMULA_NAME DLCround-PT-09b-LTLCardinality-11
FORMULA_NAME DLCround-PT-09b-LTLCardinality-12
FORMULA_NAME DLCround-PT-09b-LTLCardinality-13
FORMULA_NAME DLCround-PT-09b-LTLCardinality-14
FORMULA_NAME DLCround-PT-09b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748675697856
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 07:14:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 07:14:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:14:59] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2025-05-31 07:14:59] [INFO ] Transformed 3495 places.
[2025-05-31 07:14:59] [INFO ] Transformed 5439 transitions.
[2025-05-31 07:14:59] [INFO ] Found NUPN structural information;
[2025-05-31 07:14:59] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-09b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 3495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Discarding 612 places :
Symmetric choice reduction at 0 with 612 rule applications. Total rules 612 place count 2883 transition count 4827
Iterating global reduction 0 with 612 rules applied. Total rules applied 1224 place count 2883 transition count 4827
Discarding 494 places :
Symmetric choice reduction at 0 with 494 rule applications. Total rules 1718 place count 2389 transition count 4333
Iterating global reduction 0 with 494 rules applied. Total rules applied 2212 place count 2389 transition count 4333
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 2222 place count 2389 transition count 4323
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 2289 place count 2322 transition count 4132
Iterating global reduction 1 with 67 rules applied. Total rules applied 2356 place count 2322 transition count 4132
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 2393 place count 2285 transition count 4095
Iterating global reduction 1 with 37 rules applied. Total rules applied 2430 place count 2285 transition count 4095
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2434 place count 2285 transition count 4091
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2456 place count 2263 transition count 4069
Iterating global reduction 2 with 22 rules applied. Total rules applied 2478 place count 2263 transition count 4069
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2500 place count 2241 transition count 4047
Iterating global reduction 2 with 22 rules applied. Total rules applied 2522 place count 2241 transition count 4047
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2544 place count 2219 transition count 4025
Iterating global reduction 2 with 22 rules applied. Total rules applied 2566 place count 2219 transition count 4025
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2578 place count 2207 transition count 4013
Iterating global reduction 2 with 12 rules applied. Total rules applied 2590 place count 2207 transition count 4013
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2598 place count 2199 transition count 4005
Iterating global reduction 2 with 8 rules applied. Total rules applied 2606 place count 2199 transition count 4005
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2614 place count 2191 transition count 3997
Iterating global reduction 2 with 8 rules applied. Total rules applied 2622 place count 2191 transition count 3997
Applied a total of 2622 rules in 1560 ms. Remains 2191 /3495 variables (removed 1304) and now considering 3997/5439 (removed 1442) transitions.
// Phase 1: matrix 3997 rows 2191 cols
[2025-05-31 07:15:01] [INFO ] Computed 184 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:15:02] [INFO ] Implicit Places using invariants in 1660 ms returned []
[2025-05-31 07:15:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:15:05] [INFO ] Implicit Places using invariants and state equation in 2747 ms returned []
Implicit Place search using SMT with State Equation took 4446 ms to find 0 implicit places.
Running 3996 sub problems to find dead transitions.
[2025-05-31 07:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2190/6188 variables, and 0 constraints, problems are : Problem set: 0 solved, 3996 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2191 constraints, PredecessorRefiner: 3996/3996 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3996 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2190/6188 variables, and 0 constraints, problems are : Problem set: 0 solved, 3996 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2191 constraints, PredecessorRefiner: 0/3996 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62024ms problems are : Problem set: 0 solved, 3996 unsolved
Search for dead transitions found 0 dead transitions in 62055ms
Starting structural reductions in LTL mode, iteration 1 : 2191/3495 places, 3997/5439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68098 ms. Remains : 2191/3495 places, 3997/5439 transitions.
Support contains 34 out of 2191 places after structural reductions.
[2025-05-31 07:16:08] [INFO ] Flatten gal took : 221 ms
[2025-05-31 07:16:08] [INFO ] Flatten gal took : 134 ms
[2025-05-31 07:16:08] [INFO ] Input system was already deterministic with 3997 transitions.
RANDOM walk for 40000 steps (8 resets) in 1275 ms. (31 steps per ms) remains 0/18 properties
FORMULA DLCround-PT-09b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DLCround-PT-09b-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 365 stabilizing places and 365 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))&&F(p1)) U X(X(X(G(!p1))))))'
Support contains 3 out of 2191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2177 transition count 3983
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2177 transition count 3983
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 2171 transition count 3977
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 2171 transition count 3977
Applied a total of 40 rules in 276 ms. Remains 2171 /2191 variables (removed 20) and now considering 3977/3997 (removed 20) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2025-05-31 07:16:09] [INFO ] Computed 184 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:16:11] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2025-05-31 07:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:16:13] [INFO ] Implicit Places using invariants and state equation in 2737 ms returned []
Implicit Place search using SMT with State Equation took 3950 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:16:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61702ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61712ms
Starting structural reductions in LTL mode, iteration 1 : 2171/2191 places, 3977/3997 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65953 ms. Remains : 2171/2191 places, 3977/3997 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-01
Product exploration explored 100000 steps with 20011 reset in 539 ms.
Product exploration explored 100000 steps with 19936 reset in 434 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p1, (NOT p0)]
RANDOM walk for 10873 steps (1 resets) in 115 ms. (93 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[p1, (NOT p0)]
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1906 edges and 2171 vertex of which 530 / 2171 are part of one of the 44 SCC in 7 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 329 place count 1684 transition count 3124
Reduce places removed 328 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 370 rules applied. Total rules applied 699 place count 1356 transition count 3082
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 728 place count 1328 transition count 3081
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 729 place count 1327 transition count 3081
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 182 Pre rules applied. Total rules applied 729 place count 1327 transition count 2899
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 4 with 364 rules applied. Total rules applied 1093 place count 1145 transition count 2899
Discarding 68 places :
Symmetric choice reduction at 4 with 68 rule applications. Total rules 1161 place count 1077 transition count 2315
Iterating global reduction 4 with 68 rules applied. Total rules applied 1229 place count 1077 transition count 2315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1232 place count 1077 transition count 2312
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 1 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 5 with 824 rules applied. Total rules applied 2056 place count 665 transition count 1890
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2066 place count 665 transition count 1880
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2090 place count 641 transition count 1580
Iterating global reduction 6 with 24 rules applied. Total rules applied 2114 place count 641 transition count 1580
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 2138 place count 641 transition count 1556
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2162 place count 629 transition count 1663
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2166 place count 629 transition count 1659
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2170 place count 625 transition count 1575
Iterating global reduction 8 with 4 rules applied. Total rules applied 2174 place count 625 transition count 1575
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2178 place count 625 transition count 1571
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2186 place count 621 transition count 1605
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 9 with 40 rules applied. Total rules applied 2226 place count 621 transition count 1565
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 2246 place count 601 transition count 1525
Iterating global reduction 9 with 20 rules applied. Total rules applied 2266 place count 601 transition count 1525
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 2286 place count 581 transition count 1261
Iterating global reduction 9 with 20 rules applied. Total rules applied 2306 place count 581 transition count 1261
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2326 place count 581 transition count 1241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2327 place count 580 transition count 1240
Applied a total of 2327 rules in 689 ms. Remains 580 /2171 variables (removed 1591) and now considering 1240/3977 (removed 2737) transitions.
[2025-05-31 07:17:18] [INFO ] Flow matrix only has 1212 transitions (discarded 28 similar events)
// Phase 1: matrix 1212 rows 580 cols
[2025-05-31 07:17:18] [INFO ] Computed 184 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:17:18] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-31 07:17:18] [INFO ] Flow matrix only has 1212 transitions (discarded 28 similar events)
[2025-05-31 07:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:17:18] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:17:19] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:17:19] [INFO ] Redundant transitions in 129 ms returned []
Running 1167 sub problems to find dead transitions.
[2025-05-31 07:17:19] [INFO ] Flow matrix only has 1212 transitions (discarded 28 similar events)
[2025-05-31 07:17:19] [INFO ] Invariant cache hit.
[2025-05-31 07:17:19] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1792 variables, and 184 constraints, problems are : Problem set: 0 solved, 1167 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/580 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1167/1167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1792 variables, and 184 constraints, problems are : Problem set: 0 solved, 1167 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/580 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 0/1167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60944ms problems are : Problem set: 0 solved, 1167 unsolved
Search for dead transitions found 0 dead transitions in 60947ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/2171 places, 1240/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62596 ms. Remains : 580/2171 places, 1240/3977 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[p1, (NOT p0)]
RANDOM walk for 1219 steps (0 resets) in 106 ms. (11 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[p1, (NOT p0)]
Stuttering criterion allowed to conclude after 720 steps with 0 reset in 21 ms.
FORMULA DLCround-PT-09b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLCardinality-01 finished in 131600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Graph (trivial) has 1931 edges and 2191 vertex of which 530 / 2191 are part of one of the 44 SCC in 3 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 336 place count 1704 transition count 3137
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 377 rules applied. Total rules applied 713 place count 1369 transition count 3095
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 742 place count 1341 transition count 3094
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 743 place count 1340 transition count 3094
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 178 Pre rules applied. Total rules applied 743 place count 1340 transition count 2916
Deduced a syphon composed of 178 places in 12 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 4 with 356 rules applied. Total rules applied 1099 place count 1162 transition count 2916
Discarding 73 places :
Symmetric choice reduction at 4 with 73 rule applications. Total rules 1172 place count 1089 transition count 2363
Iterating global reduction 4 with 73 rules applied. Total rules applied 1245 place count 1089 transition count 2363
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1248 place count 1089 transition count 2360
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1248 place count 1089 transition count 2352
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1264 place count 1081 transition count 2352
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 1 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 5 with 828 rules applied. Total rules applied 2092 place count 667 transition count 1928
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2102 place count 667 transition count 1918
Renaming transitions due to excessive name length > 1024 char.
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 2129 place count 640 transition count 1579
Iterating global reduction 6 with 27 rules applied. Total rules applied 2156 place count 640 transition count 1579
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 2180 place count 640 transition count 1555
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2204 place count 628 transition count 1662
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2208 place count 628 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2212 place count 624 transition count 1574
Iterating global reduction 8 with 4 rules applied. Total rules applied 2216 place count 624 transition count 1574
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2220 place count 624 transition count 1570
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2228 place count 620 transition count 1604
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 9 with 40 rules applied. Total rules applied 2268 place count 620 transition count 1564
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 2288 place count 600 transition count 1524
Iterating global reduction 9 with 20 rules applied. Total rules applied 2308 place count 600 transition count 1524
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 2328 place count 580 transition count 1260
Iterating global reduction 9 with 20 rules applied. Total rules applied 2348 place count 580 transition count 1260
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2368 place count 580 transition count 1240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2369 place count 579 transition count 1239
Applied a total of 2369 rules in 558 ms. Remains 579 /2191 variables (removed 1612) and now considering 1239/3997 (removed 2758) transitions.
[2025-05-31 07:18:21] [INFO ] Flow matrix only has 1211 transitions (discarded 28 similar events)
// Phase 1: matrix 1211 rows 579 cols
[2025-05-31 07:18:21] [INFO ] Computed 184 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:22] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-05-31 07:18:22] [INFO ] Flow matrix only has 1211 transitions (discarded 28 similar events)
[2025-05-31 07:18:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:22] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:18:22] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:18:22] [INFO ] Redundant transitions in 21 ms returned []
Running 1166 sub problems to find dead transitions.
[2025-05-31 07:18:22] [INFO ] Flow matrix only has 1211 transitions (discarded 28 similar events)
[2025-05-31 07:18:22] [INFO ] Invariant cache hit.
[2025-05-31 07:18:22] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1790 variables, and 184 constraints, problems are : Problem set: 0 solved, 1166 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/579 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1166/1166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1166 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 timeout
0)
(s171 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/1790 variables, and 184 constraints, problems are : Problem set: 0 solved, 1166 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/579 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 0/1166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60834ms problems are : Problem set: 0 solved, 1166 unsolved
Search for dead transitions found 0 dead transitions in 60836ms
Starting structural reductions in SI_LTL mode, iteration 1 : 579/2191 places, 1239/3997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62454 ms. Remains : 579/2191 places, 1239/3997 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-09b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLCardinality-04 finished in 62515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(!p1))||G(p2)))'
Support contains 4 out of 2191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2180 transition count 3986
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2180 transition count 3986
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 2176 transition count 3982
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 2176 transition count 3982
Applied a total of 30 rules in 233 ms. Remains 2176 /2191 variables (removed 15) and now considering 3982/3997 (removed 15) transitions.
// Phase 1: matrix 3982 rows 2176 cols
[2025-05-31 07:19:23] [INFO ] Computed 184 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:25] [INFO ] Implicit Places using invariants in 1337 ms returned []
[2025-05-31 07:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:27] [INFO ] Implicit Places using invariants and state equation in 2527 ms returned []
Implicit Place search using SMT with State Equation took 3868 ms to find 0 implicit places.
Running 3981 sub problems to find dead transitions.
[2025-05-31 07:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2175/6158 variables, and 0 constraints, problems are : Problem set: 0 solved, 3981 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2176 constraints, PredecessorRefiner: 3981/3981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3981 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2175/6158 variables, and 0 constraints, problems are : Problem set: 0 solved, 3981 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2176 constraints, PredecessorRefiner: 0/3981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61619ms problems are : Problem set: 0 solved, 3981 unsolved
Search for dead transitions found 0 dead transitions in 61625ms
Starting structural reductions in LTL mode, iteration 1 : 2176/2191 places, 3982/3997 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65738 ms. Remains : 2176/2191 places, 3982/3997 transitions.
Stuttering acceptance computed with spot in 306 ms :[(AND p1 (NOT p2)), (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-07
Product exploration explored 100000 steps with 9 reset in 662 ms.
Product exploration explored 100000 steps with 10 reset in 848 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 120 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 353 ms. (112 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2025-05-31 07:20:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2038/2176 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2176 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3982/6158 variables, 2176/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6158 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6158 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6158/6158 variables, and 2360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2176/2176 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2038/2176 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2176 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3982/6158 variables, 2176/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6158 variables, 1/2361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6158 variables, 0/2361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6158 variables, 0/2361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6158/6158 variables, and 2361 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1821 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2176/2176 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2954ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 75662 steps, including 85 resets, run visited all 1 properties in 338 ms. (steps per millisecond=223 )
Parikh walk visited 1 properties in 343 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
[2025-05-31 07:20:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:20:39] [INFO ] [Real]Absence check using 184 positive place invariants in 2460 ms returned sat
[2025-05-31 07:20:50] [INFO ] [Real]Absence check using state equation in 10950 ms returned unknown
Could not prove EG p1
Support contains 4 out of 2176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2176/2176 places, 3982/3982 transitions.
Applied a total of 0 rules in 77 ms. Remains 2176 /2176 variables (removed 0) and now considering 3982/3982 (removed 0) transitions.
[2025-05-31 07:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:51] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2025-05-31 07:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:54] [INFO ] Implicit Places using invariants and state equation in 2647 ms returned []
Implicit Place search using SMT with State Equation took 3842 ms to find 0 implicit places.
Running 3981 sub problems to find dead transitions.
[2025-05-31 07:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s420 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0timeout
)
(s421 1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2175/6158 variables, and 0 constraints, problems are : Problem set: 0 solved, 3981 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2176 constraints, PredecessorRefiner: 3981/3981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3981 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2175/6158 variables, and 0 constraints, problems are : Problem set: 0 solved, 3981 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2176 constraints, PredecessorRefiner: 0/3981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61686ms problems are : Problem set: 0 solved, 3981 unsolved
Search for dead transitions found 0 dead transitions in 61695ms
Finished structural reductions in LTL mode , in 1 iterations and 65628 ms. Remains : 2176/2176 places, 3982/3982 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 32233 steps (6 resets) in 329 ms. (97 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
[2025-05-31 07:21:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:22:01] [INFO ] [Real]Absence check using 184 positive place invariants in 2447 ms returned sat
[2025-05-31 07:22:12] [INFO ] [Real]Absence check using state equation in 10995 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 138 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 17 reset in 582 ms.
Product exploration explored 100000 steps with 13 reset in 716 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 160 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 4 out of 2176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2176/2176 places, 3982/3982 transitions.
Graph (trivial) has 1911 edges and 2176 vertex of which 524 / 2176 are part of one of the 43 SCC in 2 ms
Free SCC test removed 481 places
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1695 transition count 3463
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 28 rules applied. Total rules applied 361 place count 1695 transition count 3449
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 361 place count 1695 transition count 3454
Deduced a syphon composed of 356 places in 13 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 371 place count 1695 transition count 3454
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 524 place count 1542 transition count 2797
Deduced a syphon composed of 270 places in 11 ms
Iterating global reduction 2 with 153 rules applied. Total rules applied 677 place count 1542 transition count 2797
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 681 place count 1542 transition count 2793
Performed 583 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 853 places in 1 ms
Iterating global reduction 3 with 583 rules applied. Total rules applied 1264 place count 1542 transition count 2803
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1274 place count 1542 transition count 2793
Renaming transitions due to excessive name length > 1024 char.
Discarding 422 places :
Symmetric choice reduction at 4 with 422 rule applications. Total rules 1696 place count 1120 transition count 2083
Deduced a syphon composed of 456 places in 0 ms
Iterating global reduction 4 with 422 rules applied. Total rules applied 2118 place count 1120 transition count 2083
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2142 place count 1120 transition count 2059
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2152 place count 1110 transition count 2049
Deduced a syphon composed of 446 places in 1 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 2162 place count 1110 transition count 2049
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -211
Deduced a syphon composed of 478 places in 1 ms
Iterating global reduction 5 with 32 rules applied. Total rules applied 2194 place count 1110 transition count 2260
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2212 place count 1110 transition count 2242
Discarding 46 places :
Symmetric choice reduction at 6 with 46 rule applications. Total rules 2258 place count 1064 transition count 2068
Deduced a syphon composed of 436 places in 0 ms
Iterating global reduction 6 with 46 rules applied. Total rules applied 2304 place count 1064 transition count 2068
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2312 place count 1064 transition count 2060
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2320 place count 1056 transition count 2044
Deduced a syphon composed of 428 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2328 place count 1056 transition count 2044
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 432 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2332 place count 1056 transition count 2084
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2336 place count 1052 transition count 2076
Deduced a syphon composed of 428 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2340 place count 1052 transition count 2076
Deduced a syphon composed of 428 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 7 with 43 rules applied. Total rules applied 2383 place count 1052 transition count 2033
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2402 place count 1033 transition count 1995
Deduced a syphon composed of 428 places in 0 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 2421 place count 1033 transition count 1995
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2440 place count 1014 transition count 1742
Deduced a syphon composed of 428 places in 1 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 2459 place count 1014 transition count 1742
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 2487 place count 1014 transition count 1714
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2505 place count 996 transition count 1687
Deduced a syphon composed of 410 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 2523 place count 996 transition count 1687
Deduced a syphon composed of 410 places in 0 ms
Applied a total of 2523 rules in 1395 ms. Remains 996 /2176 variables (removed 1180) and now considering 1687/3982 (removed 2295) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:22:15] [INFO ] Redundant transitions in 34 ms returned []
Running 1686 sub problems to find dead transitions.
[2025-05-31 07:22:15] [INFO ] Flow matrix only has 1660 transitions (discarded 27 similar events)
// Phase 1: matrix 1660 rows 996 cols
[2025-05-31 07:22:15] [INFO ] Computed 184 invariants in 85 ms
[2025-05-31 07:22:15] [INFO ] State equation strengthened by 216 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 995/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1686 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/996 constraints, ReadFeed: 0/216 constraints, PredecessorRefiner: 1686/1356 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1686 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 995/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1686 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/996 constraints, ReadFeed: 0/216 constraints, PredecessorRefiner: 330/1356 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61097ms problems are : Problem set: 0 solved, 1686 unsolved
Search for dead transitions found 0 dead transitions in 61100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 996/2176 places, 1687/3982 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62543 ms. Remains : 996/2176 places, 1687/3982 transitions.
Built C files in :
/tmp/ltsmin8709498509436633804
[2025-05-31 07:23:16] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8709498509436633804
Running compilation step : cd /tmp/ltsmin8709498509436633804;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8709498509436633804;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8709498509436633804;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 2176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2176/2176 places, 3982/3982 transitions.
Applied a total of 0 rules in 84 ms. Remains 2176 /2176 variables (removed 0) and now considering 3982/3982 (removed 0) transitions.
// Phase 1: matrix 3982 rows 2176 cols
[2025-05-31 07:23:19] [INFO ] Computed 184 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:21] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2025-05-31 07:23:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:23] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
Running 3981 sub problems to find dead transitions.
[2025-05-31 07:23:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2175/6158 variables, and 0 constraints, problems are : Problem set: 0 solved, 3981 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2176 constraints, PredecessorRefiner: 3981/3981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3981 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2175/6158 variables, and 0 constraints, problems are : Problem set: 0 solved, 3981 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2176 constraints, PredecessorRefiner: 0/3981 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61623ms problems are : Problem set: 0 solved, 3981 unsolved
Search for dead transitions found 0 dead transitions in 61630ms
Finished structural reductions in LTL mode , in 1 iterations and 65569 ms. Remains : 2176/2176 places, 3982/3982 transitions.
Built C files in :
/tmp/ltsmin606833638519969928
[2025-05-31 07:24:25] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin606833638519969928
Running compilation step : cd /tmp/ltsmin606833638519969928;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin606833638519969928;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin606833638519969928;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:24:28] [INFO ] Flatten gal took : 97 ms
[2025-05-31 07:24:28] [INFO ] Flatten gal took : 93 ms
[2025-05-31 07:24:28] [INFO ] Time to serialize gal into /tmp/LTL2764308186571437874.gal : 30 ms
[2025-05-31 07:24:28] [INFO ] Time to serialize properties into /tmp/LTL18358098084057806636.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2764308186571437874.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3129147378576345825.hoa' '-atoms' '/tmp/LTL18358098084057806636.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18358098084057806636.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3129147378576345825.hoa
Detected timeout of ITS tools.
[2025-05-31 07:24:44] [INFO ] Flatten gal took : 85 ms
[2025-05-31 07:24:44] [INFO ] Flatten gal took : 88 ms
[2025-05-31 07:24:44] [INFO ] Time to serialize gal into /tmp/LTL15246782145734517068.gal : 17 ms
[2025-05-31 07:24:44] [INFO ] Time to serialize properties into /tmp/LTL18019490618850329943.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15246782145734517068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18019490618850329943.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("((p2319==0)||(p2637==1))"))U(X(!("((p616==0)||(p3076==1))"))))||(G("((p3076==0)&&(p616==1))"))))
Formula 0 simplified : (G!"((p2319==0)||(p2637==1))" R X"((p616==0)||(p3076==1))") & F!"((p3076==0)&&(p616==1))"
Detected timeout of ITS tools.
[2025-05-31 07:24:59] [INFO ] Flatten gal took : 72 ms
[2025-05-31 07:24:59] [INFO ] Applying decomposition
[2025-05-31 07:24:59] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1481961594304079109.txt' '-o' '/tmp/graph1481961594304079109.bin' '-w' '/tmp/graph1481961594304079109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1481961594304079109.bin' '-l' '-1' '-v' '-w' '/tmp/graph1481961594304079109.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:24:59] [INFO ] Decomposing Gal with order
[2025-05-31 07:24:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:25:00] [INFO ] Removed a total of 3827 redundant transitions.
[2025-05-31 07:25:00] [INFO ] Flatten gal took : 261 ms
[2025-05-31 07:25:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 82 ms.
[2025-05-31 07:25:00] [INFO ] Time to serialize gal into /tmp/LTL282228252837419190.gal : 32 ms
[2025-05-31 07:25:00] [INFO ] Time to serialize properties into /tmp/LTL17520420015130964358.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL282228252837419190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17520420015130964358.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((F("((i2.u580.p2319==0)||(i18.i1.i17.u635.p2637==1))"))U(X(!("((i5.u139.p616==0)||(i11.u725.p3076==1))"))))||(G("((i11.u725.p3076=...183
Formula 0 simplified : (G!"((i2.u580.p2319==0)||(i18.i1.i17.u635.p2637==1))" R X"((i5.u139.p616==0)||(i11.u725.p3076==1))") & F!"((i11.u725.p3076==0)&&(i5....170
Detected timeout of ITS tools.
Treatment of property DLCround-PT-09b-LTLCardinality-07 finished in 351989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 2191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Graph (trivial) has 1926 edges and 2191 vertex of which 530 / 2191 are part of one of the 44 SCC in 2 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 335 place count 1704 transition count 3138
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 376 rules applied. Total rules applied 711 place count 1370 transition count 3096
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 739 place count 1342 transition count 3096
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 739 place count 1342 transition count 2918
Deduced a syphon composed of 178 places in 13 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1095 place count 1164 transition count 2918
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1168 place count 1091 transition count 2365
Iterating global reduction 3 with 73 rules applied. Total rules applied 1241 place count 1091 transition count 2365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1245 place count 1091 transition count 2361
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 1245 place count 1091 transition count 2352
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1263 place count 1082 transition count 2352
Performed 411 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 411 places in 0 ms
Reduce places removed 411 places and 0 transitions.
Iterating global reduction 4 with 822 rules applied. Total rules applied 2085 place count 671 transition count 1931
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2095 place count 671 transition count 1921
Renaming transitions due to excessive name length > 1024 char.
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 2121 place count 645 transition count 1595
Iterating global reduction 5 with 26 rules applied. Total rules applied 2147 place count 645 transition count 1595
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2170 place count 645 transition count 1572
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -143
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 2204 place count 628 transition count 1715
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2208 place count 628 transition count 1711
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2212 place count 624 transition count 1627
Iterating global reduction 7 with 4 rules applied. Total rules applied 2216 place count 624 transition count 1627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2220 place count 624 transition count 1623
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2228 place count 620 transition count 1657
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 8 with 49 rules applied. Total rules applied 2277 place count 620 transition count 1608
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2296 place count 601 transition count 1570
Iterating global reduction 8 with 19 rules applied. Total rules applied 2315 place count 601 transition count 1570
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2334 place count 582 transition count 1309
Iterating global reduction 8 with 19 rules applied. Total rules applied 2353 place count 582 transition count 1309
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2372 place count 582 transition count 1290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2373 place count 581 transition count 1289
Applied a total of 2373 rules in 380 ms. Remains 581 /2191 variables (removed 1610) and now considering 1289/3997 (removed 2708) transitions.
[2025-05-31 07:25:15] [INFO ] Flow matrix only has 1252 transitions (discarded 37 similar events)
// Phase 1: matrix 1252 rows 581 cols
[2025-05-31 07:25:15] [INFO ] Computed 184 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:16] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-05-31 07:25:16] [INFO ] Flow matrix only has 1252 transitions (discarded 37 similar events)
[2025-05-31 07:25:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:25:16] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:25:17] [INFO ] Redundant transitions in 25 ms returned []
Running 1215 sub problems to find dead transitions.
[2025-05-31 07:25:17] [INFO ] Flow matrix only has 1252 transitions (discarded 37 similar events)
[2025-05-31 07:25:17] [INFO ] Invariant cache hit.
[2025-05-31 07:25:17] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1215 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1833 variables, and 14 constraints, problems are : Problem set: 0 solved, 1215 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/184 constraints, State Equation: 0/581 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 1215/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1215 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1215 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1833 variables, and 184 constraints, problems are : Problem set: 0 solved, 1215 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/581 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 0/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 1215 unsolved
Search for dead transitions found 0 dead transitions in 60749ms
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2191 places, 1289/3997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62172 ms. Remains : 581/2191 places, 1289/3997 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-09
Stuttering criterion allowed to conclude after 259 steps with 0 reset in 8 ms.
FORMULA DLCround-PT-09b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLCardinality-09 finished in 62292 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 2191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Graph (trivial) has 1930 edges and 2191 vertex of which 524 / 2191 are part of one of the 43 SCC in 1 ms
Free SCC test removed 481 places
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 339 place count 1709 transition count 3139
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 380 rules applied. Total rules applied 719 place count 1371 transition count 3097
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 747 place count 1343 transition count 3097
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 747 place count 1343 transition count 2918
Deduced a syphon composed of 179 places in 18 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1105 place count 1164 transition count 2918
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1178 place count 1091 transition count 2365
Iterating global reduction 3 with 73 rules applied. Total rules applied 1251 place count 1091 transition count 2365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1255 place count 1091 transition count 2361
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 1255 place count 1091 transition count 2353
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1271 place count 1083 transition count 2353
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 0 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2099 place count 669 transition count 1929
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2109 place count 669 transition count 1919
Renaming transitions due to excessive name length > 1024 char.
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2136 place count 642 transition count 1580
Iterating global reduction 5 with 27 rules applied. Total rules applied 2163 place count 642 transition count 1580
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2187 place count 642 transition count 1556
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 2215 place count 628 transition count 1681
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2219 place count 628 transition count 1677
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2223 place count 624 transition count 1591
Iterating global reduction 7 with 4 rules applied. Total rules applied 2227 place count 624 transition count 1591
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2231 place count 624 transition count 1587
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2239 place count 620 transition count 1621
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 8 with 41 rules applied. Total rules applied 2280 place count 620 transition count 1580
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2299 place count 601 transition count 1542
Iterating global reduction 8 with 19 rules applied. Total rules applied 2318 place count 601 transition count 1542
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2337 place count 582 transition count 1291
Iterating global reduction 8 with 19 rules applied. Total rules applied 2356 place count 582 transition count 1291
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2375 place count 582 transition count 1272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2376 place count 581 transition count 1271
Applied a total of 2376 rules in 365 ms. Remains 581 /2191 variables (removed 1610) and now considering 1271/3997 (removed 2726) transitions.
[2025-05-31 07:26:18] [INFO ] Flow matrix only has 1240 transitions (discarded 31 similar events)
// Phase 1: matrix 1240 rows 581 cols
[2025-05-31 07:26:18] [INFO ] Computed 184 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:26:18] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-05-31 07:26:18] [INFO ] Flow matrix only has 1240 transitions (discarded 31 similar events)
[2025-05-31 07:26:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:26:18] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-31 07:26:19] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:26:19] [INFO ] Redundant transitions in 27 ms returned []
Running 1198 sub problems to find dead transitions.
[2025-05-31 07:26:19] [INFO ] Flow matrix only has 1240 transitions (discarded 31 similar events)
[2025-05-31 07:26:19] [INFO ] Invariant cache hit.
[2025-05-31 07:26:19] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1821 variables, and 14 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/184 constraints, State Equation: 0/581 constraints, ReadFeed: 0/54 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1821 variables, and 184 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/581 constraints, ReadFeed: 0/54 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60850ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60852ms
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2191 places, 1271/3997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62138 ms. Remains : 581/2191 places, 1271/3997 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-11
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-09b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLCardinality-11 finished in 62194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Graph (trivial) has 1930 edges and 2191 vertex of which 530 / 2191 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 337 place count 1704 transition count 3136
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 378 rules applied. Total rules applied 715 place count 1368 transition count 3094
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 743 place count 1340 transition count 3094
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 743 place count 1340 transition count 2916
Deduced a syphon composed of 178 places in 11 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1099 place count 1162 transition count 2916
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 1173 place count 1088 transition count 2362
Iterating global reduction 3 with 74 rules applied. Total rules applied 1247 place count 1088 transition count 2362
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1251 place count 1088 transition count 2358
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 1251 place count 1088 transition count 2349
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1269 place count 1079 transition count 2349
Performed 413 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 413 places in 1 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 4 with 826 rules applied. Total rules applied 2095 place count 666 transition count 1926
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2105 place count 666 transition count 1916
Renaming transitions due to excessive name length > 1024 char.
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2132 place count 639 transition count 1577
Iterating global reduction 5 with 27 rules applied. Total rules applied 2159 place count 639 transition count 1577
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2183 place count 639 transition count 1553
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2207 place count 627 transition count 1660
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2211 place count 627 transition count 1656
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2215 place count 623 transition count 1572
Iterating global reduction 7 with 4 rules applied. Total rules applied 2219 place count 623 transition count 1572
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2223 place count 623 transition count 1568
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2231 place count 619 transition count 1602
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 2271 place count 619 transition count 1562
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2291 place count 599 transition count 1522
Iterating global reduction 8 with 20 rules applied. Total rules applied 2311 place count 599 transition count 1522
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2331 place count 579 transition count 1258
Iterating global reduction 8 with 20 rules applied. Total rules applied 2351 place count 579 transition count 1258
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2371 place count 579 transition count 1238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2372 place count 578 transition count 1237
Applied a total of 2372 rules in 343 ms. Remains 578 /2191 variables (removed 1613) and now considering 1237/3997 (removed 2760) transitions.
[2025-05-31 07:27:20] [INFO ] Flow matrix only has 1209 transitions (discarded 28 similar events)
// Phase 1: matrix 1209 rows 578 cols
[2025-05-31 07:27:20] [INFO ] Computed 184 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:27:20] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 07:27:20] [INFO ] Flow matrix only has 1209 transitions (discarded 28 similar events)
[2025-05-31 07:27:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:27:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:27:21] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:27:21] [INFO ] Redundant transitions in 25 ms returned []
Running 1165 sub problems to find dead transitions.
[2025-05-31 07:27:21] [INFO ] Flow matrix only has 1209 transitions (discarded 28 similar events)
[2025-05-31 07:27:21] [INFO ] Invariant cache hit.
[2025-05-31 07:27:21] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1787 variables, and 184 constraints, problems are : Problem set: 0 solved, 1165 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/578 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1165/1165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/1787 variables, and 184 constraints, problems are : Problem set: 0 solved, 1165 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/578 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 0/1165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60821ms problems are : Problem set: 0 solved, 1165 unsolved
Search for dead transitions found 0 dead transitions in 60823ms
Starting structural reductions in SI_LTL mode, iteration 1 : 578/2191 places, 1237/3997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62025 ms. Remains : 578/2191 places, 1237/3997 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLCardinality-12 finished in 62078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 2191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2179 transition count 3985
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2179 transition count 3985
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 2174 transition count 3980
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 2174 transition count 3980
Applied a total of 34 rules in 258 ms. Remains 2174 /2191 variables (removed 17) and now considering 3980/3997 (removed 17) transitions.
// Phase 1: matrix 3980 rows 2174 cols
[2025-05-31 07:28:22] [INFO ] Computed 184 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:28:23] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2025-05-31 07:28:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:28:26] [INFO ] Implicit Places using invariants and state equation in 2642 ms returned []
Implicit Place search using SMT with State Equation took 3764 ms to find 0 implicit places.
Running 3979 sub problems to find dead transitions.
[2025-05-31 07:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2173/6154 variables, and 0 constraints, problems are : Problem set: 0 solved, 3979 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2174 constraints, PredecessorRefiner: 3979/3979 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3979 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 2173/6154 variables, and 0 constraints, problems are : Problem set: 0 solved, 3979 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2174 constraints, PredecessorRefiner: 0/3979 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61601ms problems are : Problem set: 0 solved, 3979 unsolved
Search for dead transitions found 0 dead transitions in 61607ms
Starting structural reductions in LTL mode, iteration 1 : 2174/2191 places, 3980/3997 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65639 ms. Remains : 2174/2191 places, 3980/3997 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-13
Product exploration explored 100000 steps with 4 reset in 592 ms.
Product exploration explored 100000 steps with 3 reset in 722 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 528657 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 528657 steps, saw 523670 distinct states, run finished after 3007 ms. (steps per millisecond=175 ) properties seen :0
[2025-05-31 07:29:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 189/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1982/2174 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2174 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3980/6154 variables, 2174/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6154 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6154 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6154/6154 variables, and 2358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2174/2174 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 189/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1982/2174 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:35] [INFO ] Deduced a trap composed of 90 places in 826 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:35] [INFO ] Deduced a trap composed of 91 places in 778 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:36] [INFO ] Deduced a trap composed of 129 places in 825 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:37] [INFO ] Deduced a trap composed of 131 places in 697 ms of which 60 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2174 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2174 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3980/6154 variables, 2174/2362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6154 variables, 1/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6154 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/6154 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6154/6154 variables, and 2363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4904 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2174/2174 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6092ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 347 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=115 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2025-05-31 07:29:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-09b-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-09b-LTLCardinality-13 finished in 78670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Graph (trivial) has 1931 edges and 2191 vertex of which 530 / 2191 are part of one of the 44 SCC in 2 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 336 place count 1704 transition count 3137
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 377 rules applied. Total rules applied 713 place count 1369 transition count 3095
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 741 place count 1341 transition count 3095
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 741 place count 1341 transition count 2917
Deduced a syphon composed of 178 places in 11 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1097 place count 1163 transition count 2917
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 1171 place count 1089 transition count 2363
Iterating global reduction 3 with 74 rules applied. Total rules applied 1245 place count 1089 transition count 2363
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1249 place count 1089 transition count 2359
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 1249 place count 1089 transition count 2350
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1267 place count 1080 transition count 2350
Performed 413 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 413 places in 0 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 4 with 826 rules applied. Total rules applied 2093 place count 667 transition count 1927
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2103 place count 667 transition count 1917
Renaming transitions due to excessive name length > 1024 char.
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2130 place count 640 transition count 1578
Iterating global reduction 5 with 27 rules applied. Total rules applied 2157 place count 640 transition count 1578
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2181 place count 640 transition count 1554
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2205 place count 628 transition count 1661
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2209 place count 628 transition count 1657
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2213 place count 624 transition count 1573
Iterating global reduction 7 with 4 rules applied. Total rules applied 2217 place count 624 transition count 1573
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2221 place count 624 transition count 1569
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2229 place count 620 transition count 1603
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2268 place count 620 transition count 1564
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2287 place count 601 transition count 1526
Iterating global reduction 8 with 19 rules applied. Total rules applied 2306 place count 601 transition count 1526
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2325 place count 582 transition count 1275
Iterating global reduction 8 with 19 rules applied. Total rules applied 2344 place count 582 transition count 1275
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2363 place count 582 transition count 1256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2364 place count 581 transition count 1255
Applied a total of 2364 rules in 335 ms. Remains 581 /2191 variables (removed 1610) and now considering 1255/3997 (removed 2742) transitions.
[2025-05-31 07:29:41] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
// Phase 1: matrix 1226 rows 581 cols
[2025-05-31 07:29:41] [INFO ] Computed 184 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:29:41] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-05-31 07:29:41] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
[2025-05-31 07:29:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:29:41] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:29:42] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:29:42] [INFO ] Redundant transitions in 21 ms returned []
Running 1182 sub problems to find dead transitions.
[2025-05-31 07:29:42] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
[2025-05-31 07:29:42] [INFO ] Invariant cache hit.
[2025-05-31 07:29:42] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
SMT process timed out in 30764ms, After SMT, problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 30767ms
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2191 places, 1255/3997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31987 ms. Remains : 581/2191 places, 1255/3997 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-14
Stuttering criterion allowed to conclude after 1284 steps with 0 reset in 20 ms.
FORMULA DLCround-PT-09b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLCardinality-14 finished in 32087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p2)))))))'
Support contains 6 out of 2191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2191/2191 places, 3997/3997 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2180 transition count 3986
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2180 transition count 3986
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 2175 transition count 3981
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 2175 transition count 3981
Applied a total of 32 rules in 240 ms. Remains 2175 /2191 variables (removed 16) and now considering 3981/3997 (removed 16) transitions.
// Phase 1: matrix 3981 rows 2175 cols
[2025-05-31 07:30:13] [INFO ] Computed 184 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:30:14] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2025-05-31 07:30:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:30:16] [INFO ] Implicit Places using invariants and state equation in 2603 ms returned []
Implicit Place search using SMT with State Equation took 3733 ms to find 0 implicit places.
Running 3980 sub problems to find dead transitions.
[2025-05-31 07:30:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2174/6156 variables, and 0 constraints, problems are : Problem set: 0 solved, 3980 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2175 constraints, PredecessorRefiner: 3980/3980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2174/6156 variables, and 0 constraints, problems are : Problem set: 0 solved, 3980 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2175 constraints, PredecessorRefiner: 0/3980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61637ms problems are : Problem set: 0 solved, 3980 unsolved
Search for dead transitions found 0 dead transitions in 61643ms
Starting structural reductions in LTL mode, iteration 1 : 2175/2191 places, 3981/3997 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65626 ms. Remains : 2175/2191 places, 3981/3997 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-09b-LTLCardinality-15
Product exploration explored 100000 steps with 1 reset in 658 ms.
Product exploration explored 100000 steps with 0 reset in 830 ms.
Computed a total of 364 stabilizing places and 364 stable transitions
Computed a total of 364 stabilizing places and 364 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 91 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p1) p2), false]
RANDOM walk for 40000 steps (8 resets) in 404 ms. (98 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2025-05-31 07:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 404/408 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1767/2175 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2175 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3981/6156 variables, 2175/2359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6156 variables, 0/2359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6156 variables, 0/2359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6156/6156 variables, and 2359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1880 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2175/2175 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 404/408 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1767/2175 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2175 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3981/6156 variables, 2175/2359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6156 variables, 1/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6156 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6156 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6156/6156 variables, and 2360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2175/2175 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3827ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 757 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=108 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 8 factoid took 305 ms. Reduced automaton from 9 states, 23 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
[2025-05-31 07:31:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:31:29] [INFO ] [Real]Absence check using 184 positive place invariants in 2416 ms returned sat
[2025-05-31 07:31:40] [INFO ] [Real]Absence check using state equation in 11110 ms returned unknown
Could not prove EG (NOT p1)
[2025-05-31 07:31:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:31:44] [INFO ] [Real]Absence check using 184 positive place invariants in 2375 ms returned sat
[2025-05-31 07:31:55] [INFO ] [Real]Absence check using state equation in 11079 ms returned unknown
Could not prove EG (NOT p2)
Support contains 4 out of 2175 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2175/2175 places, 3981/3981 transitions.
Graph (trivial) has 1906 edges and 2175 vertex of which 510 / 2175 are part of one of the 44 SCC in 4 ms
Free SCC test removed 466 places
Ensure Unique test removed 501 transitions
Reduce isomorphic transitions removed 501 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 336 place count 1708 transition count 3144
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 377 rules applied. Total rules applied 713 place count 1373 transition count 3102
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 742 place count 1345 transition count 3101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 743 place count 1344 transition count 3101
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 183 Pre rules applied. Total rules applied 743 place count 1344 transition count 2918
Deduced a syphon composed of 183 places in 12 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 4 with 366 rules applied. Total rules applied 1109 place count 1161 transition count 2918
Discarding 64 places :
Symmetric choice reduction at 4 with 64 rule applications. Total rules 1173 place count 1097 transition count 2362
Iterating global reduction 4 with 64 rules applied. Total rules applied 1237 place count 1097 transition count 2362
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1241 place count 1097 transition count 2358
Performed 420 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 420 places in 0 ms
Reduce places removed 420 places and 0 transitions.
Iterating global reduction 5 with 840 rules applied. Total rules applied 2081 place count 677 transition count 1928
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2091 place count 677 transition count 1918
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2115 place count 653 transition count 1618
Iterating global reduction 6 with 24 rules applied. Total rules applied 2139 place count 653 transition count 1618
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 2161 place count 653 transition count 1596
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2163 place count 652 transition count 1595
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -128
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 2191 place count 638 transition count 1723
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2195 place count 638 transition count 1719
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2199 place count 634 transition count 1633
Iterating global reduction 8 with 4 rules applied. Total rules applied 2203 place count 634 transition count 1633
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2207 place count 634 transition count 1629
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2215 place count 630 transition count 1663
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 2251 place count 630 transition count 1627
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2267 place count 614 transition count 1595
Iterating global reduction 9 with 16 rules applied. Total rules applied 2283 place count 614 transition count 1595
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2299 place count 598 transition count 1385
Iterating global reduction 9 with 16 rules applied. Total rules applied 2315 place count 598 transition count 1385
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 2331 place count 598 transition count 1369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2332 place count 597 transition count 1368
Applied a total of 2332 rules in 1361 ms. Remains 597 /2175 variables (removed 1578) and now considering 1368/3981 (removed 2613) transitions.
[2025-05-31 07:31:56] [INFO ] Flow matrix only has 1332 transitions (discarded 36 similar events)
// Phase 1: matrix 1332 rows 597 cols
[2025-05-31 07:31:56] [INFO ] Computed 184 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:31:57] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-05-31 07:31:57] [INFO ] Flow matrix only has 1332 transitions (discarded 36 similar events)
[2025-05-31 07:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:31:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-31 07:31:57] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:31:58] [INFO ] Redundant transitions in 96 ms returned []
Running 1295 sub problems to find dead transitions.
[2025-05-31 07:31:58] [INFO ] Flow matrix only has 1332 transitions (discarded 36 similar events)
[2025-05-31 07:31:58] [INFO ] Invariant cache hit.
[2025-05-31 07:31:58] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/1929 variables, and 13 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/184 constraints, State Equation: 0/597 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/595 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (OVERLAPS) 2/597 variables, 171/184 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/1929 variables, and 184 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/597 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 0/1295 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61203ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 61207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 597/2175 places, 1368/3981 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63635 ms. Remains : 597/2175 places, 1368/3981 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
RANDOM walk for 3760 steps (0 resets) in 484 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (F p2), (F p1)]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
[2025-05-31 07:33:00] [INFO ] Flow matrix only has 1332 transitions (discarded 36 similar events)
[2025-05-31 07:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:33:00] [INFO ] [Real]Absence check using 184 positive place invariants in 71 ms returned sat
[2025-05-31 07:33:01] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2025-05-31 07:33:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:33:02] [INFO ] [Nat]Absence check using 184 positive place invariants in 76 ms returned sat
[2025-05-31 07:33:02] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2025-05-31 07:33:02] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-31 07:33:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 15 ms returned sat
[2025-05-31 07:33:03] [INFO ] Computed and/alt/rep : 793/1515/793 causal constraints (skipped 479 transitions) in 84 ms.
[2025-05-31 07:33:03] [INFO ] Added : 11 causal constraints over 3 iterations in 363 ms. Result :sat
Could not prove EG (NOT p1)
[2025-05-31 07:33:03] [INFO ] Flow matrix only has 1332 transitions (discarded 36 similar events)
[2025-05-31 07:33:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:33:03] [INFO ] [Real]Absence check using 184 positive place invariants in 61 ms returned sat
[2025-05-31 07:33:04] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-05-31 07:33:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:33:04] [INFO ] [Nat]Absence check using 184 positive place invariants in 68 ms returned sat
[2025-05-31 07:33:05] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2025-05-31 07:33:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-31 07:33:05] [INFO ] [Nat]Added 73 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:33:05] [INFO ] Computed and/alt/rep : 793/1515/793 causal constraints (skipped 479 transitions) in 71 ms.
[2025-05-31 07:33:05] [INFO ] Added : 4 causal constraints over 1 iterations in 222 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLCardinality-15 finished in 173065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(!p1))||G(p2)))'
[2025-05-31 07:33:06] [INFO ] Flatten gal took : 263 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16944396570619410958
[2025-05-31 07:33:06] [INFO ] Too many transitions (3997) to apply POR reductions. Disabling POR matrices.
[2025-05-31 07:33:06] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16944396570619410958
Running compilation step : cd /tmp/ltsmin16944396570619410958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-05-31 07:33:06] [INFO ] Applying decomposition
[2025-05-31 07:33:06] [INFO ] Flatten gal took : 214 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15879512579655558059.txt' '-o' '/tmp/graph15879512579655558059.bin' '-w' '/tmp/graph15879512579655558059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15879512579655558059.bin' '-l' '-1' '-v' '-w' '/tmp/graph15879512579655558059.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:33:07] [INFO ] Decomposing Gal with order
[2025-05-31 07:33:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:33:08] [INFO ] Removed a total of 3841 redundant transitions.
[2025-05-31 07:33:08] [INFO ] Flatten gal took : 178 ms
[2025-05-31 07:33:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 72 ms.
[2025-05-31 07:33:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality11612190013396473664.gal : 37 ms
[2025-05-31 07:33:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality1181297948680550779.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11612190013396473664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1181297948680550779.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("((i3.i0.i5.u588.p2319==0)||(i5.u645.p2637==1))"))U(X(!("((i7.u136.p616==0)||(i13.u736.p3076==1))"))))||(G("((i13.u736.p3076==0...181
Formula 0 simplified : (G!"((i3.i0.i5.u588.p2319==0)||(i5.u645.p2637==1))" R X"((i7.u136.p616==0)||(i13.u736.p3076==1))") & F!"((i13.u736.p3076==0)&&(i7.u1...168
Compilation finished in 10758 ms.
Running link step : cd /tmp/ltsmin16944396570619410958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin16944396570619410958;'/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' '--ltl' '((<>((LTLAPp0==true)) U X(!(LTLAPp1==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 62227 ms.
FORMULA DLCround-PT-09b-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1160787 ms.
BK_STOP 1748676859872
--------------------
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="DLCround-PT-09b"
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 DLCround-PT-09b, 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 r072-tall-174860067000219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-09b.tgz
mv DLCround-PT-09b 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 ;