About the Execution of ITS-Tools for DLCround-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1885813.00 | 0.00 | 0.00 | FFFTFFFFFFFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860066900172.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-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860066900172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 813K 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-06b-LTLFireability-00
FORMULA_NAME DLCround-PT-06b-LTLFireability-01
FORMULA_NAME DLCround-PT-06b-LTLFireability-02
FORMULA_NAME DLCround-PT-06b-LTLFireability-03
FORMULA_NAME DLCround-PT-06b-LTLFireability-04
FORMULA_NAME DLCround-PT-06b-LTLFireability-05
FORMULA_NAME DLCround-PT-06b-LTLFireability-06
FORMULA_NAME DLCround-PT-06b-LTLFireability-07
FORMULA_NAME DLCround-PT-06b-LTLFireability-08
FORMULA_NAME DLCround-PT-06b-LTLFireability-09
FORMULA_NAME DLCround-PT-06b-LTLFireability-10
FORMULA_NAME DLCround-PT-06b-LTLFireability-11
FORMULA_NAME DLCround-PT-06b-LTLFireability-12
FORMULA_NAME DLCround-PT-06b-LTLFireability-13
FORMULA_NAME DLCround-PT-06b-LTLFireability-14
FORMULA_NAME DLCround-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748668984448
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 05:23:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 05:23:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:23:05] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-05-31 05:23:05] [INFO ] Transformed 2340 places.
[2025-05-31 05:23:05] [INFO ] Transformed 3456 transitions.
[2025-05-31 05:23:05] [INFO ] Found NUPN structural information;
[2025-05-31 05:23:05] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-06b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Discarding 402 places :
Symmetric choice reduction at 0 with 402 rule applications. Total rules 402 place count 1938 transition count 3054
Iterating global reduction 0 with 402 rules applied. Total rules applied 804 place count 1938 transition count 3054
Discarding 312 places :
Symmetric choice reduction at 0 with 312 rule applications. Total rules 1116 place count 1626 transition count 2742
Iterating global reduction 0 with 312 rules applied. Total rules applied 1428 place count 1626 transition count 2742
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1434 place count 1626 transition count 2736
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 1485 place count 1575 transition count 2618
Iterating global reduction 1 with 51 rules applied. Total rules applied 1536 place count 1575 transition count 2618
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 1566 place count 1545 transition count 2588
Iterating global reduction 1 with 30 rules applied. Total rules applied 1596 place count 1545 transition count 2588
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1600 place count 1545 transition count 2584
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1614 place count 1531 transition count 2570
Iterating global reduction 2 with 14 rules applied. Total rules applied 1628 place count 1531 transition count 2570
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1642 place count 1517 transition count 2556
Iterating global reduction 2 with 14 rules applied. Total rules applied 1656 place count 1517 transition count 2556
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1669 place count 1504 transition count 2543
Iterating global reduction 2 with 13 rules applied. Total rules applied 1682 place count 1504 transition count 2543
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1690 place count 1496 transition count 2535
Iterating global reduction 2 with 8 rules applied. Total rules applied 1698 place count 1496 transition count 2535
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1703 place count 1491 transition count 2530
Iterating global reduction 2 with 5 rules applied. Total rules applied 1708 place count 1491 transition count 2530
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1713 place count 1486 transition count 2525
Iterating global reduction 2 with 5 rules applied. Total rules applied 1718 place count 1486 transition count 2525
Applied a total of 1718 rules in 1128 ms. Remains 1486 /2340 variables (removed 854) and now considering 2525/3456 (removed 931) transitions.
// Phase 1: matrix 2525 rows 1486 cols
[2025-05-31 05:23:07] [INFO ] Computed 109 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:08] [INFO ] Implicit Places using invariants in 1540 ms returned []
[2025-05-31 05:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:10] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 3440 ms to find 0 implicit places.
Running 2524 sub problems to find dead transitions.
[2025-05-31 05:23:10] [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 1485/4011 variables, and 0 constraints, problems are : Problem set: 0 solved, 2524 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1486 constraints, PredecessorRefiner: 2524/2524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2524 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 1485/4011 variables, and 0 constraints, problems are : Problem set: 0 solved, 2524 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1486 constraints, PredecessorRefiner: 0/2524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60998ms problems are : Problem set: 0 solved, 2524 unsolved
Search for dead transitions found 0 dead transitions in 61019ms
Starting structural reductions in LTL mode, iteration 1 : 1486/2340 places, 2525/3456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65621 ms. Remains : 1486/2340 places, 2525/3456 transitions.
Support contains 48 out of 1486 places after structural reductions.
[2025-05-31 05:24:12] [INFO ] Flatten gal took : 148 ms
[2025-05-31 05:24:12] [INFO ] Flatten gal took : 97 ms
[2025-05-31 05:24:12] [INFO ] Input system was already deterministic with 2525 transitions.
RANDOM walk for 40000 steps (8 resets) in 1556 ms. (25 steps per ms) remains 3/37 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
[2025-05-31 05:24:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 405/414 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1486 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1486 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2525/4011 variables, 1486/1595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4011 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/4011 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4011/4011 variables, and 1595 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1486/1486 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 405/414 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1486 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1486 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2525/4011 variables, 1486/1595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4011 variables, 3/1598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:24:16] [INFO ] Deduced a trap composed of 118 places in 287 ms of which 30 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/4011 variables, 1/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4011 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/4011 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4011/4011 variables, and 1599 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2427 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1486/1486 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4488ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 764 ms.
Support contains 5 out of 1486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Graph (trivial) has 1346 edges and 1486 vertex of which 387 / 1486 are part of one of the 31 SCC in 5 ms
Free SCC test removed 356 places
Drop transitions (Empty/Sink Transition effects.) removed 405 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 415 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 266 place count 1130 transition count 1845
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 299 rules applied. Total rules applied 565 place count 865 transition count 1811
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 588 place count 843 transition count 1810
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 589 place count 842 transition count 1810
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 589 place count 842 transition count 1703
Deduced a syphon composed of 107 places in 3 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 803 place count 735 transition count 1703
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 861 place count 677 transition count 1393
Iterating global reduction 4 with 58 rules applied. Total rules applied 919 place count 677 transition count 1393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 922 place count 677 transition count 1390
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 922 place count 677 transition count 1382
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 938 place count 669 transition count 1382
Performed 252 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 252 places in 1 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 5 with 504 rules applied. Total rules applied 1442 place count 417 transition count 1123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1449 place count 417 transition count 1116
Renaming transitions due to excessive name length > 1024 char.
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1467 place count 399 transition count 948
Iterating global reduction 6 with 18 rules applied. Total rules applied 1485 place count 399 transition count 948
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1502 place count 399 transition count 931
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 1504 place count 398 transition count 930
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1505 place count 397 transition count 920
Iterating global reduction 7 with 1 rules applied. Total rules applied 1506 place count 397 transition count 920
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1507 place count 397 transition count 919
Performed 36 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 1579 place count 361 transition count 1207
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1592 place count 361 transition count 1194
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 1609 place count 344 transition count 873
Iterating global reduction 9 with 17 rules applied. Total rules applied 1626 place count 344 transition count 873
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 9 with 42 rules applied. Total rules applied 1668 place count 344 transition count 831
Drop transitions (Redundant composition of simpler transitions.) removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 10 with 91 rules applied. Total rules applied 1759 place count 344 transition count 740
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1766 place count 337 transition count 669
Iterating global reduction 10 with 7 rules applied. Total rules applied 1773 place count 337 transition count 669
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1780 place count 337 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1788 place count 333 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1793 place count 333 transition count 685
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 12 with 23 rules applied. Total rules applied 1816 place count 333 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1824 place count 329 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1830 place count 329 transition count 685
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 13 with 23 rules applied. Total rules applied 1853 place count 329 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1861 place count 325 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1867 place count 325 transition count 685
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 14 with 23 rules applied. Total rules applied 1890 place count 325 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1898 place count 321 transition count 689
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1904 place count 321 transition count 683
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1925 place count 321 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1933 place count 317 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1939 place count 317 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 16 with 22 rules applied. Total rules applied 1961 place count 317 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1969 place count 313 transition count 689
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1975 place count 313 transition count 683
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1996 place count 313 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2004 place count 309 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2010 place count 309 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2031 place count 309 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2039 place count 305 transition count 692
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2045 place count 305 transition count 686
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2066 place count 305 transition count 665
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2074 place count 301 transition count 694
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2080 place count 301 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 20 with 22 rules applied. Total rules applied 2102 place count 301 transition count 666
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2110 place count 297 transition count 693
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2116 place count 297 transition count 687
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2137 place count 297 transition count 666
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2145 place count 293 transition count 694
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2151 place count 293 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 22 with 22 rules applied. Total rules applied 2173 place count 293 transition count 666
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2181 place count 289 transition count 693
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2187 place count 289 transition count 687
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2208 place count 289 transition count 666
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2216 place count 285 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 2221 place count 285 transition count 686
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 24 with 22 rules applied. Total rules applied 2243 place count 285 transition count 664
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2251 place count 281 transition count 683
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2255 place count 281 transition count 679
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2274 place count 281 transition count 660
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 2282 place count 277 transition count 679
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2286 place count 277 transition count 675
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2305 place count 277 transition count 656
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2313 place count 273 transition count 676
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2317 place count 273 transition count 672
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 2337 place count 273 transition count 652
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2345 place count 269 transition count 671
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2349 place count 269 transition count 667
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 2368 place count 269 transition count 648
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 2376 place count 265 transition count 668
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2380 place count 265 transition count 664
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 29 with 20 rules applied. Total rules applied 2400 place count 265 transition count 644
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2408 place count 261 transition count 666
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2412 place count 261 transition count 662
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 30 with 20 rules applied. Total rules applied 2432 place count 261 transition count 642
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2440 place count 257 transition count 665
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2444 place count 257 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 2463 place count 257 transition count 642
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 2471 place count 253 transition count 662
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2475 place count 253 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 32 with 20 rules applied. Total rules applied 2495 place count 253 transition count 638
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 2503 place count 249 transition count 658
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 2507 place count 249 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 33 with 20 rules applied. Total rules applied 2527 place count 249 transition count 634
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 2535 place count 245 transition count 653
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 2539 place count 245 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 2558 place count 245 transition count 630
Free-agglomeration rule applied 29 times.
Iterating global reduction 34 with 29 rules applied. Total rules applied 2587 place count 245 transition count 601
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 222 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 225 transitions.
Graph (complete) has 627 edges and 216 vertex of which 154 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.0 ms
Discarding 62 places :
Also discarding 0 output transitions
Iterating post reduction 34 with 255 rules applied. Total rules applied 2842 place count 154 transition count 376
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 35 with 62 rules applied. Total rules applied 2904 place count 154 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 36 with 27 rules applied. Total rules applied 2931 place count 154 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 36 with 1 rules applied. Total rules applied 2932 place count 153 transition count 286
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 36 with 5 rules applied. Total rules applied 2937 place count 148 transition count 286
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 37 with 72 rules applied. Total rules applied 3009 place count 100 transition count 262
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 37 with 65 rules applied. Total rules applied 3074 place count 100 transition count 197
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 38 with 75 rules applied. Total rules applied 3149 place count 50 transition count 172
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 70 transitions.
Graph (trivial) has 9 edges and 50 vertex of which 8 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 71 rules applied. Total rules applied 3220 place count 46 transition count 102
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 40 transitions.
Graph (complete) has 82 edges and 43 vertex of which 29 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 39 with 44 rules applied. Total rules applied 3264 place count 29 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 40 with 8 rules applied. Total rules applied 3272 place count 29 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 6 rules applied. Total rules applied 3278 place count 25 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3282 place count 25 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 42 with 9 rules applied. Total rules applied 3291 place count 19 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 42 with 9 rules applied. Total rules applied 3300 place count 19 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 43 with 9 rules applied. Total rules applied 3309 place count 19 transition count 21
Graph (complete) has 33 edges and 19 vertex of which 11 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 43 with 1 rules applied. Total rules applied 3310 place count 11 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 44 with 8 rules applied. Total rules applied 3318 place count 11 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 45 with 1 Pre rules applied. Total rules applied 3318 place count 11 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 45 with 2 rules applied. Total rules applied 3320 place count 10 transition count 12
Applied a total of 3320 rules in 758 ms. Remains 10 /1486 variables (removed 1476) and now considering 12/2525 (removed 2513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 758 ms. Remains : 10/1486 places, 12/2525 transitions.
RANDOM walk for 236 steps (0 resets) in 5 ms. (39 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-06b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 226 stabilizing places and 226 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(G(p1))))))))'
Support contains 1 out of 1486 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 : 1486/1486 places, 2525/2525 transitions.
Graph (trivial) has 1349 edges and 1486 vertex of which 372 / 1486 are part of one of the 32 SCC in 2 ms
Free SCC test removed 340 places
Ensure Unique test removed 365 transitions
Reduce isomorphic transitions removed 365 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 272 place count 1145 transition count 1888
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 305 rules applied. Total rules applied 577 place count 874 transition count 1854
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 600 place count 852 transition count 1853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 851 transition count 1853
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 109 Pre rules applied. Total rules applied 601 place count 851 transition count 1744
Deduced a syphon composed of 109 places in 4 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 819 place count 742 transition count 1744
Discarding 56 places :
Symmetric choice reduction at 4 with 56 rule applications. Total rules 875 place count 686 transition count 1436
Iterating global reduction 4 with 56 rules applied. Total rules applied 931 place count 686 transition count 1436
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 934 place count 686 transition count 1433
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 934 place count 686 transition count 1425
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 950 place count 678 transition count 1425
Performed 255 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 255 places in 1 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 5 with 510 rules applied. Total rules applied 1460 place count 423 transition count 1163
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1467 place count 423 transition count 1156
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1485 place count 405 transition count 991
Iterating global reduction 6 with 18 rules applied. Total rules applied 1503 place count 405 transition count 991
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1520 place count 405 transition count 974
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1524 place count 403 transition count 972
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1525 place count 402 transition count 962
Iterating global reduction 7 with 1 rules applied. Total rules applied 1526 place count 402 transition count 962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1527 place count 402 transition count 961
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1561 place count 385 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1562 place count 385 transition count 1089
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1565 place count 382 transition count 1043
Iterating global reduction 9 with 3 rules applied. Total rules applied 1568 place count 382 transition count 1043
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1590 place count 382 transition count 1021
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 10 with 29 rules applied. Total rules applied 1619 place count 382 transition count 992
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1631 place count 370 transition count 968
Iterating global reduction 10 with 12 rules applied. Total rules applied 1643 place count 370 transition count 968
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1655 place count 358 transition count 846
Iterating global reduction 10 with 12 rules applied. Total rules applied 1667 place count 358 transition count 846
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1679 place count 358 transition count 834
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1680 place count 357 transition count 833
Applied a total of 1680 rules in 286 ms. Remains 357 /1486 variables (removed 1129) and now considering 833/2525 (removed 1692) transitions.
[2025-05-31 05:24:19] [INFO ] Flow matrix only has 809 transitions (discarded 24 similar events)
// Phase 1: matrix 809 rows 357 cols
[2025-05-31 05:24:19] [INFO ] Computed 109 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:24:19] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-05-31 05:24:19] [INFO ] Flow matrix only has 809 transitions (discarded 24 similar events)
[2025-05-31 05:24:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:24:20] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-31 05:24:20] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:24:20] [INFO ] Redundant transitions in 50 ms returned []
Running 774 sub problems to find dead transitions.
[2025-05-31 05:24:20] [INFO ] Flow matrix only has 809 transitions (discarded 24 similar events)
[2025-05-31 05:24:20] [INFO ] Invariant cache hit.
[2025-05-31 05:24:20] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (OVERLAPS) 2/357 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 4 (OVERLAPS) 808/1165 variables, 357/466 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 51/517 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1165/1166 variables, and 517 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 357/357 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (OVERLAPS) 2/357 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 4 (OVERLAPS) 808/1165 variables, 357/466 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 51/517 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1165 variables, 774/1291 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/1166 variables, and 1291 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 357/357 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 357/1486 places, 833/2525 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61280 ms. Remains : 357/1486 places, 833/2525 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-00 finished in 61498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(p1))))))'
Support contains 3 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1468 transition count 2507
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1468 transition count 2507
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1457 transition count 2496
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1457 transition count 2496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1457 transition count 2495
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 1452 transition count 2490
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 1452 transition count 2490
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 1448 transition count 2486
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 1448 transition count 2486
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 1444 transition count 2482
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 1444 transition count 2482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 1440 transition count 2478
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 1440 transition count 2478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 1436 transition count 2474
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 1436 transition count 2474
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 1433 transition count 2471
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1431 transition count 2469
Applied a total of 111 rules in 451 ms. Remains 1431 /1486 variables (removed 55) and now considering 2469/2525 (removed 56) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2025-05-31 05:25:21] [INFO ] Computed 109 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:25:21] [INFO ] Implicit Places using invariants in 530 ms returned []
[2025-05-31 05:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:25:23] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2025-05-31 05:25:23] [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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60691ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 60697ms
Starting structural reductions in LTL mode, iteration 1 : 1431/1486 places, 2469/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62949 ms. Remains : 1431/1486 places, 2469/2525 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-01
Product exploration explored 100000 steps with 17 reset in 515 ms.
Product exploration explored 100000 steps with 11 reset in 536 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 33184 steps (7 resets) in 276 ms. (119 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-05-31 05:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:26:27] [INFO ] [Real]Absence check using 109 positive place invariants in 448 ms returned sat
[2025-05-31 05:26:40] [INFO ] [Real]Absence check using state equation in 12879 ms returned sat
[2025-05-31 05:26:40] [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 05:26:41] [INFO ] [Nat]Absence check using 109 positive place invariants in 415 ms returned sat
[2025-05-31 05:26:53] [INFO ] [Nat]Absence check using state equation in 11926 ms returned sat
[2025-05-31 05:26:53] [INFO ] Computed and/alt/rep : 2307/3937/2307 causal constraints (skipped 161 transitions) in 110 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-31 05:26:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p0))
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1431/1431 places, 2469/2469 transitions.
Applied a total of 0 rules in 44 ms. Remains 1431 /1431 variables (removed 0) and now considering 2469/2469 (removed 0) transitions.
[2025-05-31 05:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:26:56] [INFO ] Implicit Places using invariants in 552 ms returned []
[2025-05-31 05:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:26:57] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2025-05-31 05:26:57] [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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 60715ms
Finished structural reductions in LTL mode , in 1 iterations and 62562 ms. Remains : 1431/1431 places, 2469/2469 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 24342 steps (4 resets) in 144 ms. (167 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-05-31 05:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:28:00] [INFO ] [Real]Absence check using 109 positive place invariants in 446 ms returned sat
[2025-05-31 05:28:13] [INFO ] [Real]Absence check using state equation in 12995 ms returned sat
[2025-05-31 05:28:13] [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 05:28:14] [INFO ] [Nat]Absence check using 109 positive place invariants in 416 ms returned sat
[2025-05-31 05:28:26] [INFO ] [Nat]Absence check using state equation in 11883 ms returned sat
[2025-05-31 05:28:26] [INFO ] Computed and/alt/rep : 2307/3937/2307 causal constraints (skipped 161 transitions) in 124 ms.
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15 reset in 376 ms.
Product exploration explored 100000 steps with 9 reset in 452 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1431/1431 places, 2469/2469 transitions.
Graph (trivial) has 1293 edges and 1431 vertex of which 375 / 1431 are part of one of the 33 SCC in 3 ms
Free SCC test removed 342 places
Ensure Unique test removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Performed 231 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 231 rules applied. Total rules applied 232 place count 1089 transition count 2101
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 254 place count 1089 transition count 2090
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 254 place count 1089 transition count 2095
Deduced a syphon composed of 252 places in 4 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 264 place count 1089 transition count 2095
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 384 place count 969 transition count 1708
Deduced a syphon composed of 179 places in 3 ms
Iterating global reduction 2 with 120 rules applied. Total rules applied 504 place count 969 transition count 1708
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 508 place count 969 transition count 1704
Performed 357 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 536 places in 0 ms
Iterating global reduction 3 with 357 rules applied. Total rules applied 865 place count 969 transition count 1710
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 872 place count 969 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Discarding 267 places :
Symmetric choice reduction at 4 with 267 rule applications. Total rules 1139 place count 702 transition count 1295
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 4 with 267 rules applied. Total rules applied 1406 place count 702 transition count 1295
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1422 place count 702 transition count 1279
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1429 place count 695 transition count 1272
Deduced a syphon composed of 279 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1436 place count 695 transition count 1272
Performed 31 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 5 with 31 rules applied. Total rules applied 1467 place count 695 transition count 1511
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1482 place count 695 transition count 1496
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 1525 place count 652 transition count 1351
Deduced a syphon composed of 271 places in 0 ms
Iterating global reduction 6 with 43 rules applied. Total rules applied 1568 place count 652 transition count 1351
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1600 place count 652 transition count 1319
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1608 place count 644 transition count 1303
Deduced a syphon composed of 263 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1616 place count 644 transition count 1303
Deduced a syphon composed of 263 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 1648 place count 644 transition count 1271
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1660 place count 632 transition count 1247
Deduced a syphon composed of 263 places in 0 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1672 place count 632 transition count 1247
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1684 place count 620 transition count 1121
Deduced a syphon composed of 263 places in 1 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1696 place count 620 transition count 1121
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1714 place count 620 transition count 1103
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1726 place count 608 transition count 1085
Deduced a syphon composed of 251 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 1738 place count 608 transition count 1085
Deduced a syphon composed of 251 places in 0 ms
Applied a total of 1738 rules in 642 ms. Remains 608 /1431 variables (removed 823) and now considering 1085/2469 (removed 1384) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:28:30] [INFO ] Redundant transitions in 13 ms returned []
Running 1084 sub problems to find dead transitions.
[2025-05-31 05:28:30] [INFO ] Flow matrix only has 1063 transitions (discarded 22 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2025-05-31 05:28:30] [INFO ] Computed 109 invariants in 18 ms
[2025-05-31 05:28:30] [INFO ] State equation strengthened by 134 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (OVERLAPS) 1/608 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:28:57] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:28:57] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:28:58] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:28:58] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:28:59] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD241 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD244 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD247 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:00] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD256 is UNSAT
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 608/1671 variables, and 124 constraints, problems are : Problem set: 28 solved, 1056 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 0/608 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 1084/920 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 1056 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 1056 unsolved
At refinement iteration 1 (OVERLAPS) 27/608 variables, 109/109 constraints. Problems are: Problem set: 28 solved, 1056 unsolved
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 15/124 constraints. Problems are: Problem set: 191 solved, 893 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Problem TDEAD292 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD306 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Problem TDEAD315 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD334 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD343 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD348 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD354 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD359 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD365 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD370 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD376 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Problem TDEAD381 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD387 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD392 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD398 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD292 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/608 variables, 20/144 constraints. Problems are: Problem set: 211 solved, 873 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Problem TDEAD420 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD425 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD431 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD436 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD442 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD447 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD453 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD458 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD464 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD469 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD475 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD480 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD486 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD491 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD497 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD502 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD508 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD513 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD519 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:18] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD420 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD524 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 20/164 constraints. Problems are: Problem set: 231 solved, 853 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD530 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD535 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD541 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD546 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD552 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD557 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD563 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD568 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD574 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD579 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD585 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD590 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD596 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD601 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD607 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD616 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD625 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD634 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD643 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:24] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD530 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD652 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 20/184 constraints. Problems are: Problem set: 251 solved, 833 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD661 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD667 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD673 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:29] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD679 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD685 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD691 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD697 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD703 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD709 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD715 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD721 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD727 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD733 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD739 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD745 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD751 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD757 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD763 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:29:30] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
SMT process timed out in 60593ms, After SMT, problems are : Problem set: 269 solved, 815 unsolved
Search for dead transitions found 269 dead transitions in 60595ms
Found 269 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 269 transitions
Dead transitions reduction (with SMT) removed 269 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 608/1431 places, 816/2469 transitions.
Graph (complete) has 1483 edges and 608 vertex of which 373 are kept as prefixes of interest. Removing 235 places using SCC suffix rule.2 ms
Discarding 235 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 373 transition count 861
Deduced a syphon composed of 20 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 19 place count 373 transition count 847
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 373 transition count 862
Deduced a syphon composed of 21 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 373 transition count 861
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 21 rules in 61 ms. Remains 373 /608 variables (removed 235) and now considering 861/816 (removed -45) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 373/1431 places, 861/2469 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61322 ms. Remains : 373/1431 places, 861/2469 transitions.
Built C files in :
/tmp/ltsmin15007815406390454919
[2025-05-31 05:29:31] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15007815406390454919
Running compilation step : cd /tmp/ltsmin15007815406390454919;'/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/ltsmin15007815406390454919;'/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/ltsmin15007815406390454919;'/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 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1431/1431 places, 2469/2469 transitions.
Applied a total of 0 rules in 39 ms. Remains 1431 /1431 variables (removed 0) and now considering 2469/2469 (removed 0) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2025-05-31 05:29:34] [INFO ] Computed 109 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:34] [INFO ] Implicit Places using invariants in 541 ms returned []
[2025-05-31 05:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:35] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2025-05-31 05:29:35] [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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60721ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 60727ms
Finished structural reductions in LTL mode , in 1 iterations and 62566 ms. Remains : 1431/1431 places, 2469/2469 transitions.
Built C files in :
/tmp/ltsmin9784295520603988794
[2025-05-31 05:30:36] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9784295520603988794
Running compilation step : cd /tmp/ltsmin9784295520603988794;'/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/ltsmin9784295520603988794;'/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/ltsmin9784295520603988794;'/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 05:30:39] [INFO ] Flatten gal took : 74 ms
[2025-05-31 05:30:40] [INFO ] Flatten gal took : 66 ms
[2025-05-31 05:30:40] [INFO ] Time to serialize gal into /tmp/LTL13091610862447438229.gal : 20 ms
[2025-05-31 05:30:40] [INFO ] Time to serialize properties into /tmp/LTL2628556868174063929.prop : 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/LTL13091610862447438229.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7972656676621096081.hoa' '-atoms' '/tmp/LTL2628556868174063929.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/LTL2628556868174063929.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7972656676621096081.hoa
Detected timeout of ITS tools.
[2025-05-31 05:30:55] [INFO ] Flatten gal took : 57 ms
[2025-05-31 05:30:55] [INFO ] Flatten gal took : 55 ms
[2025-05-31 05:30:55] [INFO ] Time to serialize gal into /tmp/LTL3859217187648035141.gal : 11 ms
[2025-05-31 05:30:55] [INFO ] Time to serialize properties into /tmp/LTL4450610086500235704.ltl : 2 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/LTL3859217187648035141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4450610086500235704.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(p538==1)")||(F("((p144==1)&&(p1393==1))")))))))
Formula 0 simplified : XXX(!"(p538==1)" & G!"((p144==1)&&(p1393==1))")
Detected timeout of ITS tools.
[2025-05-31 05:31:10] [INFO ] Flatten gal took : 49 ms
[2025-05-31 05:31:10] [INFO ] Applying decomposition
[2025-05-31 05:31:10] [INFO ] Flatten gal took : 51 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/graph3544204123420458178.txt' '-o' '/tmp/graph3544204123420458178.bin' '-w' '/tmp/graph3544204123420458178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3544204123420458178.bin' '-l' '-1' '-v' '-w' '/tmp/graph3544204123420458178.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:31:10] [INFO ] Decomposing Gal with order
[2025-05-31 05:31:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:31:10] [INFO ] Removed a total of 2179 redundant transitions.
[2025-05-31 05:31:10] [INFO ] Flatten gal took : 170 ms
[2025-05-31 05:31:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 52 ms.
[2025-05-31 05:31:11] [INFO ] Time to serialize gal into /tmp/LTL1012664586435601856.gal : 19 ms
[2025-05-31 05:31:11] [INFO ] Time to serialize properties into /tmp/LTL8408182093335388998.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/LTL1012664586435601856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8408182093335388998.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 : !((X(X(X(("(i6.u118.p538==1)")||(F("((i1.u32.p144==1)&&(i5.u362.p1393==1))")))))))
Formula 0 simplified : XXX(!"(i6.u118.p538==1)" & G!"((i1.u32.p144==1)&&(i5.u362.p1393==1))")
Detected timeout of ITS tools.
Treatment of property DLCround-PT-06b-LTLFireability-01 finished in 365209 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||(!p1&&X(p1))||X(G(p1)))) U (X(G((!p0||(!p1&&X(p1))||X(G(p1)))))||(p2&&X((!p0||(!p1&&X(p1))||X(G(p1))))))))'
Support contains 4 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1471 transition count 2510
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1471 transition count 2510
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1463 transition count 2502
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1463 transition count 2502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1463 transition count 2501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1460 transition count 2498
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1460 transition count 2498
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1458 transition count 2496
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1458 transition count 2496
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1456 transition count 2494
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1456 transition count 2494
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1454 transition count 2492
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1454 transition count 2492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1452 transition count 2490
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1452 transition count 2490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1450 transition count 2488
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1450 transition count 2488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1449 transition count 2487
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1449 transition count 2487
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 1448 transition count 2486
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 1448 transition count 2486
Applied a total of 77 rules in 462 ms. Remains 1448 /1486 variables (removed 38) and now considering 2486/2525 (removed 39) transitions.
// Phase 1: matrix 2486 rows 1448 cols
[2025-05-31 05:31:26] [INFO ] Computed 109 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:31:27] [INFO ] Implicit Places using invariants in 598 ms returned []
[2025-05-31 05:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:31:28] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
Running 2485 sub problems to find dead transitions.
[2025-05-31 05:31:28] [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 1447/3934 variables, and 0 constraints, problems are : Problem set: 0 solved, 2485 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1448 constraints, PredecessorRefiner: 2485/2485 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2485 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 1447/3934 variables, and 0 constraints, problems are : Problem set: 0 solved, 2485 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1448 constraints, PredecessorRefiner: 0/2485 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60709ms problems are : Problem set: 0 solved, 2485 unsolved
Search for dead transitions found 0 dead transitions in 60713ms
Starting structural reductions in LTL mode, iteration 1 : 1448/1486 places, 2486/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63059 ms. Remains : 1448/1486 places, 2486/2525 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 385 ms.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Computed a total of 214 stabilizing places and 214 stable transitions
Computed a total of 214 stabilizing places and 214 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 22 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-03 finished in 64227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Graph (trivial) has 1352 edges and 1486 vertex of which 393 / 1486 are part of one of the 32 SCC in 1 ms
Free SCC test removed 361 places
Ensure Unique test removed 389 transitions
Reduce isomorphic transitions removed 389 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 266 place count 1124 transition count 1870
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 299 rules applied. Total rules applied 565 place count 859 transition count 1836
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 587 place count 837 transition count 1836
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 587 place count 837 transition count 1730
Deduced a syphon composed of 106 places in 3 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 799 place count 731 transition count 1730
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 857 place count 673 transition count 1411
Iterating global reduction 3 with 58 rules applied. Total rules applied 915 place count 673 transition count 1411
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 918 place count 673 transition count 1408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 918 place count 673 transition count 1401
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 932 place count 666 transition count 1401
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 0 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 498 rules applied. Total rules applied 1430 place count 417 transition count 1145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1437 place count 417 transition count 1138
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1456 place count 398 transition count 963
Iterating global reduction 5 with 19 rules applied. Total rules applied 1475 place count 398 transition count 963
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1494 place count 398 transition count 944
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 6 with 2 rules applied. Total rules applied 1496 place count 397 transition count 943
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1497 place count 396 transition count 933
Iterating global reduction 6 with 1 rules applied. Total rules applied 1498 place count 396 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1499 place count 396 transition count 932
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1531 place count 380 transition count 1057
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1535 place count 376 transition count 995
Iterating global reduction 7 with 4 rules applied. Total rules applied 1539 place count 376 transition count 995
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1568 place count 376 transition count 966
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 1598 place count 376 transition count 936
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1612 place count 362 transition count 908
Iterating global reduction 8 with 14 rules applied. Total rules applied 1626 place count 362 transition count 908
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1640 place count 348 transition count 766
Iterating global reduction 8 with 14 rules applied. Total rules applied 1654 place count 348 transition count 766
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1668 place count 348 transition count 752
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1669 place count 347 transition count 751
Applied a total of 1669 rules in 166 ms. Remains 347 /1486 variables (removed 1139) and now considering 751/2525 (removed 1774) transitions.
[2025-05-31 05:32:30] [INFO ] Flow matrix only has 729 transitions (discarded 22 similar events)
// Phase 1: matrix 729 rows 347 cols
[2025-05-31 05:32:30] [INFO ] Computed 109 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:32:30] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-31 05:32:30] [INFO ] Flow matrix only has 729 transitions (discarded 22 similar events)
[2025-05-31 05:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:32:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 05:32:31] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:32:31] [INFO ] Redundant transitions in 9 ms returned []
Running 691 sub problems to find dead transitions.
[2025-05-31 05:32:31] [INFO ] Flow matrix only has 729 transitions (discarded 22 similar events)
[2025-05-31 05:32:31] [INFO ] Invariant cache hit.
[2025-05-31 05:32:31] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 728/1075 variables, 347/456 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1075 variables, 40/496 constraints. Problems are: Problem set: 0 solved, 691 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 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1075/1076 variables, and 496 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 347/347 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 728/1075 variables, 347/456 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1075 variables, 40/496 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1075 variables, 691/1187 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1075/1076 variables, and 1187 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 347/347 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1486 places, 751/2525 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60990 ms. Remains : 347/1486 places, 751/2525 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-04
Stuttering criterion allowed to conclude after 359 steps with 0 reset in 17 ms.
FORMULA DLCround-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-04 finished in 61063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Graph (trivial) has 1351 edges and 1486 vertex of which 393 / 1486 are part of one of the 32 SCC in 1 ms
Free SCC test removed 361 places
Ensure Unique test removed 389 transitions
Reduce isomorphic transitions removed 389 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 265 place count 1124 transition count 1871
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 298 rules applied. Total rules applied 563 place count 860 transition count 1837
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 585 place count 838 transition count 1837
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 585 place count 838 transition count 1731
Deduced a syphon composed of 106 places in 4 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 797 place count 732 transition count 1731
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 855 place count 674 transition count 1412
Iterating global reduction 3 with 58 rules applied. Total rules applied 913 place count 674 transition count 1412
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 916 place count 674 transition count 1409
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 916 place count 674 transition count 1402
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 930 place count 667 transition count 1402
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 0 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 498 rules applied. Total rules applied 1428 place count 418 transition count 1146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1435 place count 418 transition count 1139
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1454 place count 399 transition count 964
Iterating global reduction 5 with 19 rules applied. Total rules applied 1473 place count 399 transition count 964
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1492 place count 399 transition count 945
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1494 place count 398 transition count 944
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1495 place count 397 transition count 934
Iterating global reduction 6 with 1 rules applied. Total rules applied 1496 place count 397 transition count 934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1497 place count 397 transition count 933
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1529 place count 381 transition count 1058
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1533 place count 377 transition count 996
Iterating global reduction 7 with 4 rules applied. Total rules applied 1537 place count 377 transition count 996
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1566 place count 377 transition count 967
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 1596 place count 377 transition count 937
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1610 place count 363 transition count 909
Iterating global reduction 8 with 14 rules applied. Total rules applied 1624 place count 363 transition count 909
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1638 place count 349 transition count 767
Iterating global reduction 8 with 14 rules applied. Total rules applied 1652 place count 349 transition count 767
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1666 place count 349 transition count 753
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1667 place count 348 transition count 752
Applied a total of 1667 rules in 150 ms. Remains 348 /1486 variables (removed 1138) and now considering 752/2525 (removed 1773) transitions.
[2025-05-31 05:33:31] [INFO ] Flow matrix only has 730 transitions (discarded 22 similar events)
// Phase 1: matrix 730 rows 348 cols
[2025-05-31 05:33:31] [INFO ] Computed 109 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:33:31] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-31 05:33:31] [INFO ] Flow matrix only has 730 transitions (discarded 22 similar events)
[2025-05-31 05:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:33:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 05:33:32] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:33:32] [INFO ] Redundant transitions in 8 ms returned []
Running 692 sub problems to find dead transitions.
[2025-05-31 05:33:32] [INFO ] Flow matrix only has 730 transitions (discarded 22 similar events)
[2025-05-31 05:33:32] [INFO ] Invariant cache hit.
[2025-05-31 05:33:32] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (OVERLAPS) 1/348 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (OVERLAPS) 729/1077 variables, 348/457 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1077 variables, 40/497 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1077/1078 variables, and 497 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 348/348 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (OVERLAPS) 1/348 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (OVERLAPS) 729/1077 variables, 348/457 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1077 variables, 40/497 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 692/1189 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1077/1078 variables, and 1189 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 348/348 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Starting structural reductions in SI_LTL mode, iteration 1 : 348/1486 places, 752/2525 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60982 ms. Remains : 348/1486 places, 752/2525 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-05
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 7 ms.
FORMULA DLCround-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-05 finished in 61066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U ((F(G(p2)) U p3)&&X(X(p3)))))'
Support contains 5 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1468 transition count 2507
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1468 transition count 2507
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1457 transition count 2496
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1457 transition count 2496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1457 transition count 2495
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 1452 transition count 2490
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 1452 transition count 2490
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 1448 transition count 2486
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 1448 transition count 2486
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 1444 transition count 2482
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 1444 transition count 2482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 1440 transition count 2478
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 1440 transition count 2478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 1436 transition count 2474
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 1436 transition count 2474
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 1433 transition count 2471
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1431 transition count 2469
Applied a total of 111 rules in 459 ms. Remains 1431 /1486 variables (removed 55) and now considering 2469/2525 (removed 56) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2025-05-31 05:34:32] [INFO ] Computed 109 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:34:33] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-05-31 05:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:34:34] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2025-05-31 05:34:34] [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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60668ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 60674ms
Starting structural reductions in LTL mode, iteration 1 : 1431/1486 places, 2469/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63011 ms. Remains : 1431/1486 places, 2469/2525 transitions.
Stuttering acceptance computed with spot in 1112 ms :[(NOT p3), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 422 ms.
Product exploration explored 100000 steps with 2 reset in 556 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1431 stabilizing places and 213/2469 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (OR p0 p1)), (X (OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p3) (NOT p2) p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (AND (NOT p3) p0 p1)), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (OR (AND p3 p2 p0) (AND p3 p2 p1)))), (X (NOT (OR (AND p3 (NOT p2) p0) (AND p3 (NOT p2) p1)))), (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1))), (X p1), (X p0), (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (AND (NOT p3) p0 p1))), (X (X (AND (NOT p3) p1))), (X (X (OR (AND p3 p1) (AND p0 p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (OR (AND p3 p2 p0) (AND p3 p2 p1))))), (X (X (NOT (OR (AND p3 (NOT p2) p0) (AND p3 (NOT p2) p1))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 204 ms. Reduced automaton from 26 states, 82 edges and 4 AP (stutter sensitive) to 24 states, 63 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 962 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 362 ms. (110 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
[2025-05-31 05:35:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 234/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1192/1431 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1431 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2469/3900 variables, 1431/1540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3900 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3900 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3900/3900 variables, and 1540 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1431/1431 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 234/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1192/1431 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:35:41] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1431 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2469/3900 variables, 1431/1541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3900 variables, 4/1545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3900 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/3900 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3900/3900 variables, and 1545 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1431/1431 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4060ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 416 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=208 )
Parikh walk visited 4 properties in 927 ms.
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (OR p0 p1)), (X (OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p3) (NOT p2) p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (AND (NOT p3) p0 p1)), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (OR (AND p3 p2 p0) (AND p3 p2 p1)))), (X (NOT (OR (AND p3 (NOT p2) p0) (AND p3 (NOT p2) p1)))), (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1))), (X p1), (X p0), (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (AND (NOT p3) p0 p1))), (X (X (AND (NOT p3) p1))), (X (X (OR (AND p3 p1) (AND p0 p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (OR (AND p3 p2 p0) (AND p3 p2 p1))))), (X (X (NOT (OR (AND p3 (NOT p2) p0) (AND p3 (NOT p2) p1))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p3))), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (F (NOT (OR (AND p0 p1) (AND p1 p3)))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p3)))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (OR (NOT p0) p1) (OR p1 (NOT p3))))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p1) (NOT p2) p3)))), (F (NOT (OR p1 p3))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F p2), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT p0)), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (F (NOT (AND (OR (NOT p0) (NOT p2) (NOT p3)) (OR (NOT p1) (NOT p2) (NOT p3))))), (F (NOT (AND (OR (NOT p0) p2 (NOT p3)) (OR (NOT p1) p2 (NOT p3))))), (F p3)]
Knowledge based reduction with 39 factoid took 1019 ms. Reduced automaton from 24 states, 63 edges and 4 AP (stutter sensitive) to 24 states, 63 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1039 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 1045 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
[2025-05-31 05:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:35:48] [INFO ] [Real]Absence check using 109 positive place invariants in 505 ms returned sat
[2025-05-31 05:36:02] [INFO ] [Real]Absence check using state equation in 13772 ms returned unknown
Could not prove EG (NOT p3)
Support contains 5 out of 1431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1431/1431 places, 2469/2469 transitions.
Applied a total of 0 rules in 37 ms. Remains 1431 /1431 variables (removed 0) and now considering 2469/2469 (removed 0) transitions.
[2025-05-31 05:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:36:02] [INFO ] Implicit Places using invariants in 551 ms returned []
[2025-05-31 05:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:36:04] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2025-05-31 05:36:04] [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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60659ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 60664ms
Finished structural reductions in LTL mode , in 1 iterations and 62509 ms. Remains : 1431/1431 places, 2469/2469 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1431 stabilizing places and 213/2469 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 p3) (AND p1 p2 p3)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p3))))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p0 p1) (AND p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p1)), (X (X (NOT (OR (AND p0 p2 p3) (AND p1 p2 p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 201 ms. Reduced automaton from 24 states, 63 edges and 4 AP (stutter sensitive) to 24 states, 63 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1046 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
[2025-05-31 05:37:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 234/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1192/1431 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1431 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2469/3900 variables, 1431/1540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3900 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3900 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3900/3900 variables, and 1540 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1467 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1431/1431 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 234/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1192/1431 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1431 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2469/3900 variables, 1431/1540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3900 variables, 4/1544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3900 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3900 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3900/3900 variables, and 1544 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2295 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1431/1431 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3774ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 359 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=179 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 235 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 p3) (AND p1 p2 p3)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p3))))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p0 p1) (AND p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p1)), (X (X (NOT (OR (AND p0 p2 p3) (AND p1 p2 p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p1)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p3 p1))), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) p1))), (F (NOT (AND p0 (NOT p3) p1))), (F p3), (F (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p2) p3 (NOT p1))))), (F (NOT (OR p0 p3 p1))), (F p2), (F (NOT (AND (OR (NOT p0) p2 (NOT p3)) (OR p2 (NOT p3) (NOT p1))))), (F (NOT p0)), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p3) p1)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (OR (NOT p0) (NOT p2) (NOT p3)) (OR (NOT p2) (NOT p3) (NOT p1))))), (F (NOT (OR (AND p0 p1) (AND p3 p1))))]
Knowledge based reduction with 32 factoid took 988 ms. Reduced automaton from 24 states, 63 edges and 4 AP (stutter sensitive) to 24 states, 63 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1012 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 989 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
[2025-05-31 05:37:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:37:14] [INFO ] [Real]Absence check using 109 positive place invariants in 492 ms returned sat
[2025-05-31 05:37:28] [INFO ] [Real]Absence check using state equation in 13762 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 1037 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 405 ms.
Entered a terminal (fully accepting) state of product in 14531 steps with 15 reset in 53 ms.
FORMULA DLCround-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-06 finished in 177320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0)) U (G(F(p1)) U p2))))))'
Support contains 4 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1468 transition count 2507
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1468 transition count 2507
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1457 transition count 2496
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1457 transition count 2496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1457 transition count 2495
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 1452 transition count 2490
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 1452 transition count 2490
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 1448 transition count 2486
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 1448 transition count 2486
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 1444 transition count 2482
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 1444 transition count 2482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 1440 transition count 2478
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 1440 transition count 2478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 1436 transition count 2474
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 1436 transition count 2474
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 1433 transition count 2471
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1431 transition count 2469
Applied a total of 111 rules in 452 ms. Remains 1431 /1486 variables (removed 55) and now considering 2469/2525 (removed 56) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2025-05-31 05:37:30] [INFO ] Computed 109 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:37:30] [INFO ] Implicit Places using invariants in 569 ms returned []
[2025-05-31 05:37:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:37:32] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2025-05-31 05:37:32] [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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60669ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 60674ms
Starting structural reductions in LTL mode, iteration 1 : 1431/1486 places, 2469/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62987 ms. Remains : 1431/1486 places, 2469/2525 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-07
Product exploration explored 100000 steps with 20 reset in 423 ms.
Product exploration explored 100000 steps with 15 reset in 543 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 1 factoid took 225 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 05:38:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:38:36] [INFO ] [Real]Absence check using 109 positive place invariants in 227 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 1 factoid took 253 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-07 finished in 66738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X((G(F(p1)) U !p1)))))))'
Support contains 2 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1468 transition count 2507
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1468 transition count 2507
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1458 transition count 2497
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1458 transition count 2497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1458 transition count 2496
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 1453 transition count 2491
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 1453 transition count 2491
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 1449 transition count 2487
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 1449 transition count 2487
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 1445 transition count 2483
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 1445 transition count 2483
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 1441 transition count 2479
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 1441 transition count 2479
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 1437 transition count 2475
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 1437 transition count 2475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 1434 transition count 2472
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1432 transition count 2470
Applied a total of 109 rules in 464 ms. Remains 1432 /1486 variables (removed 54) and now considering 2470/2525 (removed 55) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2025-05-31 05:38:37] [INFO ] Computed 109 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:38:37] [INFO ] Implicit Places using invariants in 585 ms returned []
[2025-05-31 05:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:38:38] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
Running 2469 sub problems to find dead transitions.
[2025-05-31 05:38:38] [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 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 2469/2469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2469 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 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 0/2469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60656ms problems are : Problem set: 0 solved, 2469 unsolved
Search for dead transitions found 0 dead transitions in 60660ms
Starting structural reductions in LTL mode, iteration 1 : 1432/1486 places, 2470/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63015 ms. Remains : 1432/1486 places, 2470/2525 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 11 reset in 384 ms.
Product exploration explored 100000 steps with 2 reset in 467 ms.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Detected a total of 215/1432 stabilizing places and 215/2470 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
RANDOM walk for 10824 steps (1 resets) in 67 ms. (159 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
[2025-05-31 05:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:39:43] [INFO ] [Real]Absence check using 109 positive place invariants in 470 ms returned sat
[2025-05-31 05:39:55] [INFO ] [Real]Absence check using state equation in 12615 ms returned sat
[2025-05-31 05:39:55] [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 05:39:56] [INFO ] [Nat]Absence check using 109 positive place invariants in 510 ms returned sat
[2025-05-31 05:40:10] [INFO ] [Nat]Absence check using state equation in 13729 ms returned unknown
Could not prove EG (AND (NOT p0) p1)
Support contains 2 out of 1432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1432/1432 places, 2470/2470 transitions.
Applied a total of 0 rules in 38 ms. Remains 1432 /1432 variables (removed 0) and now considering 2470/2470 (removed 0) transitions.
[2025-05-31 05:40:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:40:11] [INFO ] Implicit Places using invariants in 561 ms returned []
[2025-05-31 05:40:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:40:12] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Running 2469 sub problems to find dead transitions.
[2025-05-31 05:40:12] [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 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 2469/2469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2469 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 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 0/2469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60675ms problems are : Problem set: 0 solved, 2469 unsolved
Search for dead transitions found 0 dead transitions in 60679ms
Finished structural reductions in LTL mode , in 1 iterations and 62584 ms. Remains : 1432/1432 places, 2470/2470 transitions.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Detected a total of 215/1432 stabilizing places and 215/2470 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
RANDOM walk for 12294 steps (1 resets) in 80 ms. (151 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
[2025-05-31 05:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:41:15] [INFO ] [Real]Absence check using 109 positive place invariants in 468 ms returned sat
[2025-05-31 05:41:28] [INFO ] [Real]Absence check using state equation in 12423 ms returned sat
[2025-05-31 05:41:28] [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 05:41:29] [INFO ] [Nat]Absence check using 109 positive place invariants in 493 ms returned sat
[2025-05-31 05:41:43] [INFO ] [Nat]Absence check using state equation in 13765 ms returned unknown
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 383 ms.
Product exploration explored 100000 steps with 23 reset in 443 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p1), p1, p1, p1, (NOT p1), (NOT p1)]
Support contains 2 out of 1432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1432/1432 places, 2470/2470 transitions.
Graph (trivial) has 1294 edges and 1432 vertex of which 389 / 1432 are part of one of the 32 SCC in 2 ms
Free SCC test removed 357 places
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 1075 transition count 2084
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 249 place count 1075 transition count 2073
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 249 place count 1075 transition count 2077
Deduced a syphon composed of 246 places in 4 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 258 place count 1075 transition count 2077
Discarding 118 places :
Symmetric choice reduction at 2 with 118 rule applications. Total rules 376 place count 957 transition count 1683
Deduced a syphon composed of 177 places in 3 ms
Iterating global reduction 2 with 118 rules applied. Total rules applied 494 place count 957 transition count 1683
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 498 place count 957 transition count 1679
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 527 places in 1 ms
Iterating global reduction 3 with 350 rules applied. Total rules applied 848 place count 957 transition count 1686
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 855 place count 957 transition count 1679
Renaming transitions due to excessive name length > 1024 char.
Discarding 262 places :
Symmetric choice reduction at 4 with 262 rule applications. Total rules 1117 place count 695 transition count 1267
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 4 with 262 rules applied. Total rules applied 1379 place count 695 transition count 1267
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1397 place count 695 transition count 1249
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1404 place count 688 transition count 1242
Deduced a syphon composed of 276 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1411 place count 688 transition count 1242
Performed 30 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 5 with 30 rules applied. Total rules applied 1441 place count 688 transition count 1474
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1456 place count 688 transition count 1459
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 1497 place count 647 transition count 1316
Deduced a syphon composed of 269 places in 0 ms
Iterating global reduction 6 with 41 rules applied. Total rules applied 1538 place count 647 transition count 1316
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1570 place count 647 transition count 1284
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1578 place count 639 transition count 1268
Deduced a syphon composed of 261 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1586 place count 639 transition count 1268
Deduced a syphon composed of 261 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 7 with 36 rules applied. Total rules applied 1622 place count 639 transition count 1232
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1636 place count 625 transition count 1204
Deduced a syphon composed of 261 places in 0 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 1650 place count 625 transition count 1204
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1664 place count 611 transition count 1058
Deduced a syphon composed of 261 places in 1 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 1678 place count 611 transition count 1058
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1699 place count 611 transition count 1037
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1713 place count 597 transition count 1016
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 1727 place count 597 transition count 1016
Deduced a syphon composed of 247 places in 0 ms
Applied a total of 1727 rules in 370 ms. Remains 597 /1432 variables (removed 835) and now considering 1016/2470 (removed 1454) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:41:44] [INFO ] Redundant transitions in 12 ms returned []
Running 1015 sub problems to find dead transitions.
[2025-05-31 05:41:44] [INFO ] Flow matrix only has 996 transitions (discarded 20 similar events)
// Phase 1: matrix 996 rows 597 cols
[2025-05-31 05:41:44] [INFO ] Computed 109 invariants in 16 ms
[2025-05-31 05:41:44] [INFO ] State equation strengthened by 130 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:10] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:10] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Problem TDEAD188 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD234 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:13] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:13] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:13] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/129 constraints. Problems are: Problem set: 188 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1593 variables, and 129 constraints, problems are : Problem set: 188 solved, 827 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 0/597 constraints, ReadFeed: 0/130 constraints, PredecessorRefiner: 1015/852 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 188 solved, 827 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 188 solved, 827 unsolved
At refinement iteration 1 (OVERLAPS) 159/597 variables, 109/109 constraints. Problems are: Problem set: 188 solved, 827 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/129 constraints. Problems are: Problem set: 188 solved, 827 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD309 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Problem TDEAD315 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Problem TDEAD326 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD331 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD337 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD348 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD353 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD359 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD364 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD370 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD375 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD381 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD386 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD392 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD397 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD408 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 20/149 constraints. Problems are: Problem set: 208 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD425 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD430 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD436 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD441 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD447 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD452 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD458 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD463 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD469 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:28] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD474 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD480 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD485 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD491 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD496 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD502 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD507 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD513 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD518 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD524 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 20/169 constraints. Problems are: Problem set: 228 solved, 787 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD529 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD535 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD540 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD546 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD551 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD557 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD562 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD568 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD573 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD579 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD585 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD591 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD597 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD603 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD609 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD615 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD621 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:35] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD627 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD633 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD529 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD639 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 20/189 constraints. Problems are: Problem set: 248 solved, 767 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD645 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:39] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD651 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD657 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD663 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD669 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD675 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD681 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD687 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD693 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD699 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD705 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD711 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD717 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD723 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD729 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD735 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD741 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD747 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD753 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:42:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD645 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD759 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 20/209 constraints. Problems are: Problem set: 268 solved, 747 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 597/1593 variables, and 209 constraints, problems are : Problem set: 268 solved, 747 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 0/597 constraints, ReadFeed: 0/130 constraints, PredecessorRefiner: 163/852 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 268 solved, 747 unsolved
Search for dead transitions found 268 dead transitions in 60538ms
Found 268 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 268 transitions
Dead transitions reduction (with SMT) removed 268 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 597/1432 places, 748/2470 transitions.
Graph (complete) has 1378 edges and 597 vertex of which 359 are kept as prefixes of interest. Removing 238 places using SCC suffix rule.1 ms
Discarding 238 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 359 transition count 785
Deduced a syphon composed of 13 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 26 place count 359 transition count 764
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 359 transition count 795
Deduced a syphon composed of 16 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 51 place count 359 transition count 773
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 359 transition count 803
Deduced a syphon composed of 19 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 75 place count 359 transition count 782
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 359 transition count 813
Deduced a syphon composed of 22 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 95 place count 359 transition count 796
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 359 transition count 819
Deduced a syphon composed of 24 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 114 place count 359 transition count 802
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 359 transition count 825
Deduced a syphon composed of 26 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 133 place count 359 transition count 808
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 135 place count 359 transition count 831
Deduced a syphon composed of 28 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 145 place count 359 transition count 821
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 359 transition count 834
Deduced a syphon composed of 29 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 156 place count 359 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 157 place count 359 transition count 838
Deduced a syphon composed of 30 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 168 place count 359 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 169 place count 359 transition count 840
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 179 place count 359 transition count 830
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 359 transition count 844
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 191 place count 359 transition count 833
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 359 transition count 846
Deduced a syphon composed of 33 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 202 place count 359 transition count 836
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 359 transition count 850
Deduced a syphon composed of 34 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 214 place count 359 transition count 839
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 215 place count 359 transition count 852
Deduced a syphon composed of 35 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 225 place count 359 transition count 842
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 226 place count 359 transition count 856
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 226 rules in 306 ms. Remains 359 /597 variables (removed 238) and now considering 856/748 (removed -108) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 359/1432 places, 856/2470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61239 ms. Remains : 359/1432 places, 856/2470 transitions.
Built C files in :
/tmp/ltsmin13737616853092448486
[2025-05-31 05:42:45] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13737616853092448486
Running compilation step : cd /tmp/ltsmin13737616853092448486;'/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/ltsmin13737616853092448486;'/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/ltsmin13737616853092448486;'/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 2 out of 1432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1432/1432 places, 2470/2470 transitions.
Applied a total of 0 rules in 42 ms. Remains 1432 /1432 variables (removed 0) and now considering 2470/2470 (removed 0) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2025-05-31 05:42:48] [INFO ] Computed 109 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:42:49] [INFO ] Implicit Places using invariants in 574 ms returned []
[2025-05-31 05:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:42:50] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
Running 2469 sub problems to find dead transitions.
[2025-05-31 05:42:50] [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 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 2469/2469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2469 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 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 0/2469 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60665ms problems are : Problem set: 0 solved, 2469 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Finished structural reductions in LTL mode , in 1 iterations and 62582 ms. Remains : 1432/1432 places, 2470/2470 transitions.
Built C files in :
/tmp/ltsmin17734623158316540046
[2025-05-31 05:43:51] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17734623158316540046
Running compilation step : cd /tmp/ltsmin17734623158316540046;'/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/ltsmin17734623158316540046;'/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/ltsmin17734623158316540046;'/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 05:43:54] [INFO ] Flatten gal took : 47 ms
[2025-05-31 05:43:54] [INFO ] Flatten gal took : 48 ms
[2025-05-31 05:43:54] [INFO ] Time to serialize gal into /tmp/LTL3532547009287602777.gal : 13 ms
[2025-05-31 05:43:54] [INFO ] Time to serialize properties into /tmp/LTL5178155026240994850.prop : 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/LTL3532547009287602777.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5845202593274209054.hoa' '-atoms' '/tmp/LTL5178155026240994850.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...317
Loading property file /tmp/LTL5178155026240994850.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5845202593274209054.hoa
Detected timeout of ITS tools.
[2025-05-31 05:44:09] [INFO ] Flatten gal took : 44 ms
[2025-05-31 05:44:09] [INFO ] Flatten gal took : 45 ms
[2025-05-31 05:44:09] [INFO ] Time to serialize gal into /tmp/LTL6115651155277502894.gal : 8 ms
[2025-05-31 05:44:09] [INFO ] Time to serialize properties into /tmp/LTL10074190884208386905.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/LTL6115651155277502894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10074190884208386905.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...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p201==1)")||(X(X(X((G(F("(p1368!=1)")))U("(p1368==1)"))))))))
Formula 0 simplified : F(!"(p201==1)" & XXX(FG!"(p1368!=1)" R !"(p1368==1)"))
Detected timeout of ITS tools.
[2025-05-31 05:44:24] [INFO ] Flatten gal took : 43 ms
[2025-05-31 05:44:24] [INFO ] Applying decomposition
[2025-05-31 05:44:24] [INFO ] Flatten gal took : 42 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/graph5511848583881419657.txt' '-o' '/tmp/graph5511848583881419657.bin' '-w' '/tmp/graph5511848583881419657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5511848583881419657.bin' '-l' '-1' '-v' '-w' '/tmp/graph5511848583881419657.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:44:25] [INFO ] Decomposing Gal with order
[2025-05-31 05:44:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:44:25] [INFO ] Removed a total of 2135 redundant transitions.
[2025-05-31 05:44:25] [INFO ] Flatten gal took : 91 ms
[2025-05-31 05:44:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 24 ms.
[2025-05-31 05:44:25] [INFO ] Time to serialize gal into /tmp/LTL12665845783652403658.gal : 15 ms
[2025-05-31 05:44:25] [INFO ] Time to serialize properties into /tmp/LTL10614661703994887629.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/LTL12665845783652403658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10614661703994887629.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...256
Read 1 LTL properties
Checking formula 0 : !((G(("(i2.u40.p201==1)")||(X(X(X((G(F("(i5.u351.p1368!=1)")))U("(i5.u351.p1368==1)"))))))))
Formula 0 simplified : F(!"(i2.u40.p201==1)" & XXX(FG!"(i5.u351.p1368!=1)" R !"(i5.u351.p1368==1)"))
Detected timeout of ITS tools.
Treatment of property DLCround-PT-06b-LTLFireability-08 finished in 363853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||G(p1)))) U ((p0 U p1) U (!p0 U p2))))'
Support contains 4 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1468 transition count 2507
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1468 transition count 2507
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1458 transition count 2497
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1458 transition count 2497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1458 transition count 2496
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1454 transition count 2492
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1454 transition count 2492
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 1450 transition count 2488
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 1450 transition count 2488
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 1446 transition count 2484
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 1446 transition count 2484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 1442 transition count 2480
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 1442 transition count 2480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 1438 transition count 2476
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 1438 transition count 2476
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 1435 transition count 2473
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 1435 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 1434 transition count 2472
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1433 transition count 2471
Applied a total of 107 rules in 455 ms. Remains 1433 /1486 variables (removed 53) and now considering 2471/2525 (removed 54) transitions.
// Phase 1: matrix 2471 rows 1433 cols
[2025-05-31 05:44:40] [INFO ] Computed 109 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:44:41] [INFO ] Implicit Places using invariants in 553 ms returned []
[2025-05-31 05:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:44:42] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
Running 2470 sub problems to find dead transitions.
[2025-05-31 05:44:42] [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 1432/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 2470 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1433 constraints, PredecessorRefiner: 2470/2470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2470 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 1432/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 2470 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1433 constraints, PredecessorRefiner: 0/2470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60682ms problems are : Problem set: 0 solved, 2470 unsolved
Search for dead transitions found 0 dead transitions in 60688ms
Starting structural reductions in LTL mode, iteration 1 : 1433/1486 places, 2471/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62939 ms. Remains : 1433/1486 places, 2471/2525 transitions.
Stuttering acceptance computed with spot in 608 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-10 finished in 63586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(p1))) U X(X((p2&&X(p2)))))))'
Support contains 3 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1470 transition count 2509
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1470 transition count 2509
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 1461 transition count 2500
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 1461 transition count 2500
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 1456 transition count 2495
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 1456 transition count 2495
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1452 transition count 2491
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1452 transition count 2491
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 1448 transition count 2487
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 1448 transition count 2487
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 1444 transition count 2483
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 1444 transition count 2483
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 1440 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 1440 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 1437 transition count 2476
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 1437 transition count 2476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 1436 transition count 2475
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 1436 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 1435 transition count 2474
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 1435 transition count 2474
Applied a total of 102 rules in 446 ms. Remains 1435 /1486 variables (removed 51) and now considering 2474/2525 (removed 51) transitions.
// Phase 1: matrix 2474 rows 1435 cols
[2025-05-31 05:45:44] [INFO ] Computed 109 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:45:45] [INFO ] Implicit Places using invariants in 557 ms returned []
[2025-05-31 05:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:45:46] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Running 2473 sub problems to find dead transitions.
[2025-05-31 05:45:46] [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 1434/3909 variables, and 0 constraints, problems are : Problem set: 0 solved, 2473 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 2473/2473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2473 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 1434/3909 variables, and 0 constraints, problems are : Problem set: 0 solved, 2473 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 0/2473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60642ms problems are : Problem set: 0 solved, 2473 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Starting structural reductions in LTL mode, iteration 1 : 1435/1486 places, 2474/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62965 ms. Remains : 1435/1486 places, 2474/2525 transitions.
Stuttering acceptance computed with spot in 570 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 640 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 13 states, 32 edges and 3 AP (stutter sensitive) to 13 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 521 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2025-05-31 05:46:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1268/1435 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1435 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2474/3909 variables, 1435/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3909 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3909 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3909/3909 variables, and 1544 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1435/1435 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) 165/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1268/1435 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1435 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2474/3909 variables, 1435/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3909 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3909 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3909 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3909/3909 variables, and 1545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1435/1435 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1945ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22718 steps, including 40 resets, run visited all 1 properties in 66 ms. (steps per millisecond=344 )
Parikh walk visited 1 properties in 65 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0) p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 6 factoid took 517 ms. Reduced automaton from 13 states, 30 edges and 3 AP (stutter sensitive) to 13 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 595 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 595 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2025-05-31 05:46:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:46:54] [INFO ] [Real]Absence check using 109 positive place invariants in 533 ms returned sat
[2025-05-31 05:47:08] [INFO ] [Real]Absence check using state equation in 13752 ms returned unknown
Could not prove EG (NOT p2)
Support contains 3 out of 1435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1435/1435 places, 2474/2474 transitions.
Applied a total of 0 rules in 40 ms. Remains 1435 /1435 variables (removed 0) and now considering 2474/2474 (removed 0) transitions.
[2025-05-31 05:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:08] [INFO ] Implicit Places using invariants in 537 ms returned []
[2025-05-31 05:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:09] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
Running 2473 sub problems to find dead transitions.
[2025-05-31 05:47:10] [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)
(timeout
s913 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1434/3909 variables, and 0 constraints, problems are : Problem set: 0 solved, 2473 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 2473/2473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2473 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 1434/3909 variables, and 0 constraints, problems are : Problem set: 0 solved, 2473 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 0/2473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60676ms problems are : Problem set: 0 solved, 2473 unsolved
Search for dead transitions found 0 dead transitions in 60681ms
Finished structural reductions in LTL mode , in 1 iterations and 62533 ms. Remains : 1435/1435 places, 2474/2474 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 13 states, 30 edges and 3 AP (stutter sensitive) to 13 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 582 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2025-05-31 05:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1268/1435 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1435 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2474/3909 variables, 1435/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3909 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3909 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3909/3909 variables, and 1544 constraints, problems are : Problem set: 0 solved, 1 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1435/1435 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) 165/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1268/1435 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1435 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2474/3909 variables, 1435/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3909 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3909 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3909 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3909/3909 variables, and 1545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1435/1435 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1920ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 29391 steps, including 52 resets, run visited all 1 properties in 96 ms. (steps per millisecond=306 )
Parikh walk visited 1 properties in 96 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0) p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 478 ms. Reduced automaton from 13 states, 30 edges and 3 AP (stutter sensitive) to 13 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 588 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 588 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2025-05-31 05:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:48:16] [INFO ] [Real]Absence check using 109 positive place invariants in 534 ms returned sat
[2025-05-31 05:48:30] [INFO ] [Real]Absence check using state equation in 13739 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 578 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 397 ms.
Product exploration explored 100000 steps with 0 reset in 491 ms.
Built C files in :
/tmp/ltsmin17495759745031229522
[2025-05-31 05:48:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17495759745031229522
Running compilation step : cd /tmp/ltsmin17495759745031229522;'/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/ltsmin17495759745031229522;'/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/ltsmin17495759745031229522;'/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 3 out of 1435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1435/1435 places, 2474/2474 transitions.
Applied a total of 0 rules in 40 ms. Remains 1435 /1435 variables (removed 0) and now considering 2474/2474 (removed 0) transitions.
[2025-05-31 05:48:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:35] [INFO ] Implicit Places using invariants in 565 ms returned []
[2025-05-31 05:48:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:36] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
Running 2473 sub problems to find dead transitions.
[2025-05-31 05:48:36] [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)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1434/3909 variables, and 0 constraints, problems are : Problem set: 0 solved, 2473 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 2473/2473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2473 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 1434/3909 variables, and 0 constraints, problems are : Problem set: 0 solved, 2473 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1435 constraints, PredecessorRefiner: 0/2473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60677ms problems are : Problem set: 0 solved, 2473 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Finished structural reductions in LTL mode , in 1 iterations and 62589 ms. Remains : 1435/1435 places, 2474/2474 transitions.
Built C files in :
/tmp/ltsmin14316309136525283246
[2025-05-31 05:49:37] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14316309136525283246
Running compilation step : cd /tmp/ltsmin14316309136525283246;'/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/ltsmin14316309136525283246;'/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/ltsmin14316309136525283246;'/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 05:49:40] [INFO ] Flatten gal took : 43 ms
[2025-05-31 05:49:40] [INFO ] Flatten gal took : 43 ms
[2025-05-31 05:49:40] [INFO ] Time to serialize gal into /tmp/LTL1334193742612011326.gal : 8 ms
[2025-05-31 05:49:40] [INFO ] Time to serialize properties into /tmp/LTL15617770279120079727.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/LTL1334193742612011326.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16612427810785669390.hoa' '-atoms' '/tmp/LTL15617770279120079727.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...319
Loading property file /tmp/LTL15617770279120079727.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16612427810785669390.hoa
Detected timeout of ITS tools.
[2025-05-31 05:49:55] [INFO ] Flatten gal took : 38 ms
[2025-05-31 05:49:55] [INFO ] Flatten gal took : 39 ms
[2025-05-31 05:49:55] [INFO ] Time to serialize gal into /tmp/LTL8368020837100381627.gal : 8 ms
[2025-05-31 05:49:55] [INFO ] Time to serialize properties into /tmp/LTL13659595051851363827.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/LTL8368020837100381627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13659595051851363827.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...276
Read 1 LTL properties
Checking formula 0 : !((X((F(("(p1621==1)")&&(X("(p664==1)"))))U(X(X(("(p682==1)")&&(X("(p682==1)"))))))))
Formula 0 simplified : X(G(!"(p1621==1)" | X!"(p664==1)") R XX(!"(p682==1)" | X!"(p682==1)"))
Detected timeout of ITS tools.
[2025-05-31 05:50:10] [INFO ] Flatten gal took : 39 ms
[2025-05-31 05:50:10] [INFO ] Applying decomposition
[2025-05-31 05:50:10] [INFO ] Flatten gal took : 39 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/graph16806276354931107419.txt' '-o' '/tmp/graph16806276354931107419.bin' '-w' '/tmp/graph16806276354931107419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16806276354931107419.bin' '-l' '-1' '-v' '-w' '/tmp/graph16806276354931107419.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:50:11] [INFO ] Decomposing Gal with order
[2025-05-31 05:50:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:50:11] [INFO ] Removed a total of 2172 redundant transitions.
[2025-05-31 05:50:11] [INFO ] Flatten gal took : 78 ms
[2025-05-31 05:50:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 16 ms.
[2025-05-31 05:50:11] [INFO ] Time to serialize gal into /tmp/LTL2477849890471288514.gal : 13 ms
[2025-05-31 05:50:11] [INFO ] Time to serialize properties into /tmp/LTL13369116979262402570.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/LTL2477849890471288514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13369116979262402570.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(("(i11.u402.p1621==1)")&&(X("(i9.u151.p664==1)"))))U(X(X(("(i9.u155.p682==1)")&&(X("(i9.u155.p682==1)"))))))))
Formula 0 simplified : X(G(!"(i11.u402.p1621==1)" | X!"(i9.u151.p664==1)") R XX(!"(i9.u155.p682==1)" | X!"(i9.u155.p682==1)"))
Detected timeout of ITS tools.
Treatment of property DLCround-PT-06b-LTLFireability-11 finished in 282416 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((G(F(p0)) U (p1 U X(p2)))))'
Support contains 4 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1468 transition count 2507
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1468 transition count 2507
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1457 transition count 2496
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1457 transition count 2496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1457 transition count 2495
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 1452 transition count 2490
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 1452 transition count 2490
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 1448 transition count 2486
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 1448 transition count 2486
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 1444 transition count 2482
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 1444 transition count 2482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 1440 transition count 2478
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 1440 transition count 2478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 1436 transition count 2474
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 1436 transition count 2474
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 1433 transition count 2471
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1431 transition count 2469
Applied a total of 111 rules in 464 ms. Remains 1431 /1486 variables (removed 55) and now considering 2469/2525 (removed 56) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2025-05-31 05:50:26] [INFO ] Computed 109 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:27] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-05-31 05:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:28] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2025-05-31 05:50:28] [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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60677ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Starting structural reductions in LTL mode, iteration 1 : 1431/1486 places, 2469/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62926 ms. Remains : 1431/1486 places, 2469/2525 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-12
Product exploration explored 100000 steps with 17 reset in 383 ms.
Stack based approach found an accepted trace after 79435 steps with 12 reset with depth 3937 and stack size 3937 in 358 ms.
FORMULA DLCround-PT-06b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCround-PT-06b-LTLFireability-12 finished in 63916 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)&&(F(G(!p1)) U p2)))'
Support contains 4 out of 1486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Graph (trivial) has 1347 edges and 1486 vertex of which 387 / 1486 are part of one of the 32 SCC in 2 ms
Free SCC test removed 355 places
Ensure Unique test removed 381 transitions
Reduce isomorphic transitions removed 381 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 1130 transition count 1880
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 297 rules applied. Total rules applied 561 place count 867 transition count 1846
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 583 place count 845 transition count 1846
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 583 place count 845 transition count 1737
Deduced a syphon composed of 109 places in 4 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 801 place count 736 transition count 1737
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 857 place count 680 transition count 1429
Iterating global reduction 3 with 56 rules applied. Total rules applied 913 place count 680 transition count 1429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 916 place count 680 transition count 1426
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 916 place count 680 transition count 1418
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 932 place count 672 transition count 1418
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 0 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 498 rules applied. Total rules applied 1430 place count 423 transition count 1162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1438 place count 423 transition count 1154
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1456 place count 405 transition count 986
Iterating global reduction 5 with 18 rules applied. Total rules applied 1474 place count 405 transition count 986
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1492 place count 405 transition count 968
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1496 place count 403 transition count 966
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1497 place count 402 transition count 956
Iterating global reduction 6 with 1 rules applied. Total rules applied 1498 place count 402 transition count 956
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1499 place count 402 transition count 955
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1533 place count 385 transition count 1086
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1537 place count 381 transition count 1024
Iterating global reduction 7 with 4 rules applied. Total rules applied 1541 place count 381 transition count 1024
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1570 place count 381 transition count 995
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1598 place count 381 transition count 967
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1611 place count 368 transition count 941
Iterating global reduction 8 with 13 rules applied. Total rules applied 1624 place count 368 transition count 941
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1637 place count 355 transition count 809
Iterating global reduction 8 with 13 rules applied. Total rules applied 1650 place count 355 transition count 809
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1663 place count 355 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1664 place count 354 transition count 795
Applied a total of 1664 rules in 173 ms. Remains 354 /1486 variables (removed 1132) and now considering 795/2525 (removed 1730) transitions.
[2025-05-31 05:51:30] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
// Phase 1: matrix 765 rows 354 cols
[2025-05-31 05:51:30] [INFO ] Computed 109 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:51:30] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 05:51:30] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
[2025-05-31 05:51:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:51:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 05:51:30] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:51:31] [INFO ] Redundant transitions in 10 ms returned []
Running 732 sub problems to find dead transitions.
[2025-05-31 05:51:31] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
[2025-05-31 05:51:31] [INFO ] Invariant cache hit.
[2025-05-31 05:51:31] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (OVERLAPS) 764/1118 variables, 354/463 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 40/503 constraints. Problems are: Problem set: 0 solved, 732 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 1118/1119 variables, and 503 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 354/354 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (OVERLAPS) 764/1118 variables, 354/463 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 40/503 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 732/1235 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1118/1119 variables, and 1235 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 354/354 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 354/1486 places, 795/2525 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61019 ms. Remains : 354/1486 places, 795/2525 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), p1, (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-13 finished in 61161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&F(X(p2))&&(!(p0 U p3)||p3))))'
Support contains 6 out of 1486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1486/1486 places, 2525/2525 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1468 transition count 2507
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1468 transition count 2507
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1458 transition count 2497
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1458 transition count 2497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1458 transition count 2496
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1454 transition count 2492
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1454 transition count 2492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1451 transition count 2489
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1451 transition count 2489
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1448 transition count 2486
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1448 transition count 2486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 1445 transition count 2483
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 1445 transition count 2483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 1442 transition count 2480
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 1440 transition count 2478
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 1440 transition count 2478
Applied a total of 93 rules in 389 ms. Remains 1440 /1486 variables (removed 46) and now considering 2478/2525 (removed 47) transitions.
// Phase 1: matrix 2478 rows 1440 cols
[2025-05-31 05:52:31] [INFO ] Computed 109 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:52:32] [INFO ] Implicit Places using invariants in 542 ms returned []
[2025-05-31 05:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:52:33] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
Running 2477 sub problems to find dead transitions.
[2025-05-31 05:52:33] [INFO ] Invariant cache hit.
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 Real declared 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 2477/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2477 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 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 0/2477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60671ms problems are : Problem set: 0 solved, 2477 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Starting structural reductions in LTL mode, iteration 1 : 1440/1486 places, 2478/2525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62878 ms. Remains : 1440/1486 places, 2478/2525 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, p3, (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-15 finished in 63151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X((G(F(p1)) U !p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(p1))) U X(X((p2&&X(p2)))))))'
[2025-05-31 05:53:35] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15367240490882247589
[2025-05-31 05:53:35] [INFO ] Too many transitions (2525) to apply POR reductions. Disabling POR matrices.
[2025-05-31 05:53:35] [INFO ] Applying decomposition
[2025-05-31 05:53:35] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15367240490882247589
Running compilation step : cd /tmp/ltsmin15367240490882247589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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 05:53:35] [INFO ] Flatten gal took : 43 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/graph9634422808465464544.txt' '-o' '/tmp/graph9634422808465464544.bin' '-w' '/tmp/graph9634422808465464544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9634422808465464544.bin' '-l' '-1' '-v' '-w' '/tmp/graph9634422808465464544.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:53:35] [INFO ] Decomposing Gal with order
[2025-05-31 05:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:53:35] [INFO ] Removed a total of 2170 redundant transitions.
[2025-05-31 05:53:35] [INFO ] Flatten gal took : 84 ms
[2025-05-31 05:53:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 22 ms.
[2025-05-31 05:53:35] [INFO ] Time to serialize gal into /tmp/LTLFireability7092970493065663369.gal : 15 ms
[2025-05-31 05:53:35] [INFO ] Time to serialize properties into /tmp/LTLFireability4203266115897230120.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/LTLFireability7092970493065663369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4203266115897230120.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...276
Read 3 LTL properties
Checking formula 0 : !((X(X(X(("(i7.u132.p538==1)")||(F("((i2.u35.p144==1)&&(i6.u385.p1393==1))")))))))
Formula 0 simplified : XXX(!"(i7.u132.p538==1)" & G!"((i2.u35.p144==1)&&(i6.u385.p1393==1))")
Compilation finished in 5148 ms.
Running link step : cd /tmp/ltsmin15367240490882247589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin15367240490882247589;'/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' 'X(X(X(((LTLAPp0==true)||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 25037 ms.
FORMULA DLCround-PT-06b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin15367240490882247589;'/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' '[](((LTLAPp2==true)||X(X(X(([](<>((LTLAPp3==true))) U !(LTLAPp3==true)))))))' '--buchi-type=spotba'
LTSmin run took 11335 ms.
FORMULA DLCround-PT-06b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin15367240490882247589;'/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' 'X((<>(((LTLAPp4==true)&&X((LTLAPp5==true)))) U X(X(((LTLAPp6==true)&&X((LTLAPp6==true)))))))' '--buchi-type=spotba'
LTSmin run took 13429 ms.
FORMULA DLCround-PT-06b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1884635 ms.
BK_STOP 1748670870261
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DLCround-PT-06b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860066900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06b.tgz
mv DLCround-PT-06b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;