About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ???T??TT???????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264100426.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 RingSingleMessageInMbox-PT-d1m020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264100426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-15
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749076160610
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 22:29:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 22:29:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 22:29:22] [INFO ] Load time of PNML (sax parser for PT used): 447 ms
[2025-06-04 22:29:22] [INFO ] Transformed 6690 places.
[2025-06-04 22:29:22] [INFO ] Transformed 11934 transitions.
[2025-06-04 22:29:22] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 607 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 4305 places in 31 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 65 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1067 places :
Symmetric choice reduction at 1 with 1067 rule applications. Total rules 1186 place count 1301 transition count 10355
Iterating global reduction 1 with 1067 rules applied. Total rules applied 2253 place count 1301 transition count 10355
Ensure Unique test removed 426 transitions
Reduce isomorphic transitions removed 426 transitions.
Iterating post reduction 1 with 426 rules applied. Total rules applied 2679 place count 1301 transition count 9929
Discarding 860 places :
Symmetric choice reduction at 2 with 860 rule applications. Total rules 3539 place count 441 transition count 9069
Iterating global reduction 2 with 860 rules applied. Total rules applied 4399 place count 441 transition count 9069
Ensure Unique test removed 6948 transitions
Reduce isomorphic transitions removed 6948 transitions.
Iterating post reduction 2 with 6948 rules applied. Total rules applied 11347 place count 441 transition count 2121
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 11361 place count 427 transition count 2107
Iterating global reduction 3 with 14 rules applied. Total rules applied 11375 place count 427 transition count 2107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11377 place count 427 transition count 2105
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 11384 place count 420 transition count 2098
Iterating global reduction 4 with 7 rules applied. Total rules applied 11391 place count 420 transition count 2098
Applied a total of 11391 rules in 385 ms. Remains 420 /2385 variables (removed 1965) and now considering 2098/11934 (removed 9836) transitions.
// Phase 1: matrix 2098 rows 420 cols
[2025-06-04 22:29:23] [INFO ] Computed 3 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:29:23] [INFO ] Implicit Places using invariants in 619 ms returned []
[2025-06-04 22:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:29:24] [INFO ] State equation strengthened by 1721 read => feed constraints.
[2025-06-04 22:29:33] [INFO ] Implicit Places using invariants and state equation in 10230 ms returned []
Implicit Place search using SMT with State Equation took 10889 ms to find 0 implicit places.
Running 2097 sub problems to find dead transitions.
[2025-06-04 22:29:33] [INFO ] Invariant cache hit.
[2025-06-04 22:29:34] [INFO ] State equation strengthened by 1721 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
SMT process timed out in 35222ms, After SMT, problems are : Problem set: 0 solved, 2097 unsolved
Search for dead transitions found 0 dead transitions in 35261ms
Starting structural reductions in LTL mode, iteration 1 : 420/2385 places, 2098/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46565 ms. Remains : 420/2385 places, 2098/11934 transitions.
Support contains 65 out of 420 places after structural reductions.
[2025-06-04 22:30:09] [INFO ] Flatten gal took : 165 ms
[2025-06-04 22:30:09] [INFO ] Flatten gal took : 102 ms
[2025-06-04 22:30:09] [INFO ] Input system was already deterministic with 2098 transitions.
Reduction of identical properties reduced properties to check from 63 to 61
RANDOM walk for 40000 steps (6807 resets) in 3306 ms. (12 steps per ms) remains 10/61 properties
BEST_FIRST walk for 40004 steps (621 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (672 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (942 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (791 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (686 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (649 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (698 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (678 resets) in 343 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (622 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (773 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
[2025-06-04 22:30:11] [INFO ] Invariant cache hit.
[2025-06-04 22:30:11] [INFO ] State equation strengthened by 1721 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/135 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/142 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 44/186 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1024/1210 variables, 186/189 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1210 variables, 647/836 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1210 variables, 0/836 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 10 (OVERLAPS) 1308/2518 variables, 234/1070 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2518 variables, 1074/2144 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2518/2518 variables, and 2144 constraints, problems are : Problem set: 8 solved, 2 unsolved in 3124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 1721/1721 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 112/116 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/123 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 46/169 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:15] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:15] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:15] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 3/6 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 408/577 variables, 169/175 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 31/206 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:15] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:15] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 2/208 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 0/208 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1938/2515 variables, 248/456 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2515 variables, 1690/2146 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2515 variables, 2/2148 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2515 variables, 0/2148 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/2518 variables, 3/2151 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2518 variables, 0/2151 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2518 variables, 0/2151 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2518/2518 variables, and 2151 constraints, problems are : Problem set: 8 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 1721/1721 constraints, PredecessorRefiner: 2/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8315ms problems are : Problem set: 8 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 367 transition count 610
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 367 transition count 610
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 119 place count 367 transition count 597
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 188 place count 298 transition count 528
Iterating global reduction 1 with 69 rules applied. Total rules applied 257 place count 298 transition count 528
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 297 place count 298 transition count 488
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 413 place count 182 transition count 372
Iterating global reduction 2 with 116 rules applied. Total rules applied 529 place count 182 transition count 372
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 625 place count 182 transition count 276
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 628 place count 179 transition count 237
Iterating global reduction 3 with 3 rules applied. Total rules applied 631 place count 179 transition count 237
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 633 place count 177 transition count 235
Iterating global reduction 3 with 2 rules applied. Total rules applied 635 place count 177 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 177 transition count 234
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 640 place count 173 transition count 230
Iterating global reduction 4 with 4 rules applied. Total rules applied 644 place count 173 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 648 place count 173 transition count 226
Applied a total of 648 rules in 87 ms. Remains 173 /420 variables (removed 247) and now considering 226/2098 (removed 1872) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 173/420 places, 226/2098 transitions.
RANDOM walk for 40000 steps (8476 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2885 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1494 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1738604 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :1 out of 2
Probabilistic random walk after 1738604 steps, saw 761196 distinct states, run finished after 3007 ms. (steps per millisecond=578 ) properties seen :1
// Phase 1: matrix 226 rows 173 cols
[2025-06-04 22:30:22] [INFO ] Computed 3 invariants in 2 ms
[2025-06-04 22:30:22] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.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) 76/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/319 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 28/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 77/396 variables, 43/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 34/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/399 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:23] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 173/173 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.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) 76/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/319 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 28/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 77/396 variables, 43/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 34/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/399 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/399 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 173/173 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 226/226 transitions.
Graph (complete) has 554 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 172 transition count 217
Applied a total of 10 rules in 28 ms. Remains 172 /173 variables (removed 1) and now considering 217/226 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 172/173 places, 217/226 transitions.
RANDOM walk for 40000 steps (8456 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1527 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2037273 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :0 out of 1
Probabilistic random walk after 2037273 steps, saw 892376 distinct states, run finished after 3001 ms. (steps per millisecond=678 ) properties seen :0
// Phase 1: matrix 217 rows 172 cols
[2025-06-04 22:30:26] [INFO ] Computed 4 invariants in 7 ms
[2025-06-04 22:30:26] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.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, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 215/382 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/386 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/389 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 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 75.0 s and query timeout 7500.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, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 215/382 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/386 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/389 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/389 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 610 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 761ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 217/217 transitions.
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 172/172 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 217/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 172 /172 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-06-04 22:30:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:30:27] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-04 22:30:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:30:29] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-04 22:30:38] [INFO ] Implicit Places using invariants and state equation in 10820 ms returned []
Implicit Place search using SMT with State Equation took 10988 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:30:38] [INFO ] Redundant transitions in 10 ms returned []
Running 216 sub problems to find dead transitions.
[2025-06-04 22:30:38] [INFO ] Invariant cache hit.
[2025-06-04 22:30:38] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:40] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:41] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Problem TDEAD160 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:41] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 3 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:41] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 204 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 4 (OVERLAPS) 217/389 variables, 172/180 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 53/233 constraints. Problems are: Problem set: 36 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:45] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:45] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:45] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:30:45] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 5 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 4/237 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/237 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/389 variables, 0/237 constraints. Problems are: Problem set: 46 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 237 constraints, problems are : Problem set: 46 solved, 170 unsolved in 26661 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 43/172 variables, 4/4 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/12 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 217/389 variables, 172/184 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 53/237 constraints. Problems are: Problem set: 46 solved, 170 unsolved
Problem TDEAD156 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 170/407 constraints. Problems are: Problem set: 47 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:31:19] [INFO ] Deduced a trap along path composed of 9 places in 42 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/408 constraints. Problems are: Problem set: 47 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 408 constraints, problems are : Problem set: 47 solved, 169 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 170/216 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56801ms problems are : Problem set: 47 solved, 169 unsolved
Search for dead transitions found 47 dead transitions in 56803ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 172/172 places, 170/217 transitions.
Graph (complete) has 434 edges and 172 vertex of which 129 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 126 transition count 151
Applied a total of 22 rules in 9 ms. Remains 126 /172 variables (removed 46) and now considering 151/170 (removed 19) transitions.
// Phase 1: matrix 151 rows 126 cols
[2025-06-04 22:31:35] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:31:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 22:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:31:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-04 22:31:36] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/172 places, 151/217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68299 ms. Remains : 126/172 places, 151/217 transitions.
RANDOM walk for 40000 steps (8401 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1515 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2191374 steps, run timeout after 3001 ms. (steps per millisecond=730 ) properties seen :0 out of 1
Probabilistic random walk after 2191374 steps, saw 946544 distinct states, run finished after 3001 ms. (steps per millisecond=730 ) properties seen :0
[2025-06-04 22:31:39] [INFO ] Invariant cache hit.
[2025-06-04 22:31:39] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.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) 108/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 160/270 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 43/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/277 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 44/44 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 90.0 s and query timeout 9000.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) 108/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 160/270 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 43/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/277 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/277 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 151/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 151/151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 151/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2025-06-04 22:31:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:31:39] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 22:31:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:31:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-04 22:31:40] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:31:40] [INFO ] Redundant transitions in 8 ms returned []
Running 150 sub problems to find dead transitions.
[2025-06-04 22:31:40] [INFO ] Invariant cache hit.
[2025-06-04 22:31:40] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 151/277 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 44/171 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 171 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 151/277 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 44/171 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 150/321 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:31:59] [INFO ] Deduced a trap along path composed of 9 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 322 constraints, problems are : Problem set: 0 solved, 150 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39411ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 39411ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39917 ms. Remains : 126/126 places, 151/151 transitions.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 22:32:19] [INFO ] Flatten gal took : 58 ms
[2025-06-04 22:32:19] [INFO ] Flatten gal took : 62 ms
[2025-06-04 22:32:19] [INFO ] Input system was already deterministic with 2098 transitions.
Computed a total of 126 stabilizing places and 992 stable transitions
Graph (complete) has 2943 edges and 420 vertex of which 419 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 372 transition count 910
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 372 transition count 910
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 123 place count 372 transition count 883
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 187 place count 308 transition count 819
Iterating global reduction 1 with 64 rules applied. Total rules applied 251 place count 308 transition count 819
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 356 place count 308 transition count 714
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 448 place count 216 transition count 622
Iterating global reduction 2 with 92 rules applied. Total rules applied 540 place count 216 transition count 622
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 2 with 164 rules applied. Total rules applied 704 place count 216 transition count 458
Applied a total of 704 rules in 21 ms. Remains 216 /420 variables (removed 204) and now considering 458/2098 (removed 1640) transitions.
// Phase 1: matrix 458 rows 216 cols
[2025-06-04 22:32:19] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:32:19] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-04 22:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:32:20] [INFO ] State equation strengthened by 259 read => feed constraints.
[2025-06-04 22:32:21] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-04 22:32:21] [INFO ] Invariant cache hit.
[2025-06-04 22:32:21] [INFO ] State equation strengthened by 259 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 4 (OVERLAPS) 458/674 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 259/478 constraints. Problems are: Problem set: 24 solved, 433 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 674/674 variables, and 478 constraints, problems are : Problem set: 24 solved, 433 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 433 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 17/208 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 3 (OVERLAPS) 8/216 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 458/674 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 259/478 constraints. Problems are: Problem set: 24 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 433/911 constraints. Problems are: Problem set: 24 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 911 constraints, problems are : Problem set: 24 solved, 433 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 433/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 24 solved, 433 unsolved
Search for dead transitions found 24 dead transitions in 60396ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/420 places, 434/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 422
Applied a total of 36 rules in 5 ms. Remains 192 /216 variables (removed 24) and now considering 422/434 (removed 12) transitions.
// Phase 1: matrix 422 rows 192 cols
[2025-06-04 22:33:22] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:33:22] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-04 22:33:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:33:22] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-04 22:33:26] [INFO ] Implicit Places using invariants and state equation in 4704 ms returned []
Implicit Place search using SMT with State Equation took 4818 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 192/420 places, 422/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67173 ms. Remains : 192/420 places, 422/2098 transitions.
[2025-06-04 22:33:26] [INFO ] Flatten gal took : 13 ms
[2025-06-04 22:33:27] [INFO ] Flatten gal took : 13 ms
[2025-06-04 22:33:27] [INFO ] Input system was already deterministic with 422 transitions.
[2025-06-04 22:33:27] [INFO ] Flatten gal took : 13 ms
[2025-06-04 22:33:27] [INFO ] Flatten gal took : 12 ms
[2025-06-04 22:33:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8797752208210237407.gal : 8 ms
[2025-06-04 22:33:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11269464010099245748.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8797752208210237407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11269464010099245748.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 22:33:57] [INFO ] Flatten gal took : 18 ms
[2025-06-04 22:33:57] [INFO ] Applying decomposition
[2025-06-04 22:33:57] [INFO ] Flatten gal took : 12 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/graph6156218805428530058.txt' '-o' '/tmp/graph6156218805428530058.bin' '-w' '/tmp/graph6156218805428530058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6156218805428530058.bin' '-l' '-1' '-v' '-w' '/tmp/graph6156218805428530058.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:33:57] [INFO ] Decomposing Gal with order
[2025-06-04 22:33:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:33:57] [INFO ] Removed a total of 344 redundant transitions.
[2025-06-04 22:33:57] [INFO ] Flatten gal took : 70 ms
[2025-06-04 22:33:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 235 labels/synchronizations in 24 ms.
[2025-06-04 22:33:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11037355521926986763.gal : 8 ms
[2025-06-04 22:33:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17356846848438464340.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11037355521926986763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17356846848438464340.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 367 transition count 660
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 367 transition count 660
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 123 place count 367 transition count 643
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 192 place count 298 transition count 574
Iterating global reduction 1 with 69 rules applied. Total rules applied 261 place count 298 transition count 574
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 311 place count 298 transition count 524
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 423 place count 186 transition count 412
Iterating global reduction 2 with 112 rules applied. Total rules applied 535 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 651 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 653 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 655 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 656 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 657 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 658 place count 183 transition count 268
Applied a total of 658 rules in 27 ms. Remains 183 /420 variables (removed 237) and now considering 268/2098 (removed 1830) transitions.
// Phase 1: matrix 268 rows 183 cols
[2025-06-04 22:34:27] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:34:27] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-04 22:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:34:27] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-04 22:34:29] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-04 22:34:29] [INFO ] Invariant cache hit.
[2025-06-04 22:34:29] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 281 constraints, problems are : Problem set: 24 solved, 243 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 17/175 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 8/183 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 243/524 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:35:17] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:35:17] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 10 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:35:18] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 5 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:35:24] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 5 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:35:25] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:35:26] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 6/530 constraints. Problems are: Problem set: 46 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 530 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 243/267 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60235ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 60237ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/420 places, 222/2098 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 141 transition count 204
Applied a total of 60 rules in 2 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2025-06-04 22:35:29] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:35:29] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-04 22:35:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:35:29] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-04 22:35:30] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/420 places, 204/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62637 ms. Remains : 141/420 places, 204/2098 transitions.
[2025-06-04 22:35:30] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:35:30] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:35:30] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-04 22:35:30] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:35:30] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:35:30] [INFO ] Time to serialize gal into /tmp/CTLFireability313330105035166998.gal : 1 ms
[2025-06-04 22:35:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3091949628564386889.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability313330105035166998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3091949628564386889.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16202e+11,2.71995,82552,2,19081,5,288649,6,0,768,253709,0
Converting to forward existential form...Done !
original formula: AF(AG(AF(AX(((s1<1)||(l3930<1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(!(EX(!(((s1<1)||(l3930<1)))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t36, t37, t38, t41, t50, t53, t59, t64, t74, t75, t76, t77, t78,...662
Detected timeout of ITS tools.
[2025-06-04 22:36:00] [INFO ] Flatten gal took : 9 ms
[2025-06-04 22:36:00] [INFO ] Applying decomposition
[2025-06-04 22:36:00] [INFO ] Flatten gal took : 5 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/graph1887896130246192993.txt' '-o' '/tmp/graph1887896130246192993.bin' '-w' '/tmp/graph1887896130246192993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1887896130246192993.bin' '-l' '-1' '-v' '-w' '/tmp/graph1887896130246192993.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:36:00] [INFO ] Decomposing Gal with order
[2025-06-04 22:36:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:36:00] [INFO ] Removed a total of 201 redundant transitions.
[2025-06-04 22:36:00] [INFO ] Flatten gal took : 20 ms
[2025-06-04 22:36:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 7 ms.
[2025-06-04 22:36:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3073233351675802308.gal : 3 ms
[2025-06-04 22:36:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9579426418044183106.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3073233351675802308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9579426418044183106.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 369 transition count 710
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 369 transition count 710
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 118 place count 369 transition count 694
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 186 place count 301 transition count 626
Iterating global reduction 1 with 68 rules applied. Total rules applied 254 place count 301 transition count 626
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 316 place count 301 transition count 564
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 424 place count 193 transition count 456
Iterating global reduction 2 with 108 rules applied. Total rules applied 532 place count 193 transition count 456
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 668 place count 193 transition count 320
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 669 place count 192 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 670 place count 192 transition count 307
Applied a total of 670 rules in 34 ms. Remains 192 /420 variables (removed 228) and now considering 307/2098 (removed 1791) transitions.
// Phase 1: matrix 307 rows 192 cols
[2025-06-04 22:36:30] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:36:30] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-04 22:36:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:36:30] [INFO ] State equation strengthened by 127 read => feed constraints.
[2025-06-04 22:36:34] [INFO ] Implicit Places using invariants and state equation in 4361 ms returned []
Implicit Place search using SMT with State Equation took 4505 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-04 22:36:35] [INFO ] Invariant cache hit.
[2025-06-04 22:36:35] [INFO ] State equation strengthened by 127 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 4 (OVERLAPS) 307/499 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 127/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 322 constraints, problems are : Problem set: 24 solved, 282 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 17/184 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 8/192 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 307/499 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 127/322 constraints. Problems are: Problem set: 24 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 282/604 constraints. Problems are: Problem set: 24 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:37:31] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 3 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:37:32] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 4 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 606 constraints, problems are : Problem set: 36 solved, 270 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 282/306 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 36 solved, 270 unsolved
Search for dead transitions found 36 dead transitions in 60240ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/420 places, 271/2098 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 160 transition count 259
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 156 transition count 255
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 156 transition count 255
Applied a total of 52 rules in 5 ms. Remains 156 /192 variables (removed 36) and now considering 255/271 (removed 16) transitions.
// Phase 1: matrix 255 rows 156 cols
[2025-06-04 22:37:35] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:37:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-04 22:37:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:37:35] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-04 22:37:36] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/420 places, 255/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66361 ms. Remains : 156/420 places, 255/2098 transitions.
[2025-06-04 22:37:36] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:37:36] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:37:36] [INFO ] Input system was already deterministic with 255 transitions.
[2025-06-04 22:37:36] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:37:36] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:37:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3915780043240429834.gal : 1 ms
[2025-06-04 22:37:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7794607208203224354.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3915780043240429834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7794607208203224354.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21132e+11,3.55485,104516,2,23520,5,350172,6,0,879,308224,0
Converting to forward existential form...Done !
original formula: E(EF(((s1>=1)&&(l3927>=1))) U EX(AX(E(((s1>=1)&&(l2581>=1)) U ((s1>=1)&&(l3936>=1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,E(TRUE U ((s1>=1)&&(l3927>=1))))) * !(EX(!(E(((s1>=1)&&(l2581>=1)) U ((s1>=1)&&(l3936>=1)))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t18, t19, t20, t21, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38,...862
(forward)formula 0,1,20.5575,527412,1,0,498,1.52002e+06,534,213,6536,1.0487e+06,581
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 370 transition count 713
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 370 transition count 713
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 121 place count 370 transition count 692
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 157 place count 334 transition count 656
Iterating global reduction 1 with 36 rules applied. Total rules applied 193 place count 334 transition count 656
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 205 place count 334 transition count 644
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 340 place count 199 transition count 509
Iterating global reduction 2 with 135 rules applied. Total rules applied 475 place count 199 transition count 509
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 625 place count 199 transition count 359
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 627 place count 197 transition count 329
Iterating global reduction 3 with 2 rules applied. Total rules applied 629 place count 197 transition count 329
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 630 place count 196 transition count 328
Iterating global reduction 3 with 1 rules applied. Total rules applied 631 place count 196 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 632 place count 196 transition count 327
Applied a total of 632 rules in 34 ms. Remains 196 /420 variables (removed 224) and now considering 327/2098 (removed 1771) transitions.
// Phase 1: matrix 327 rows 196 cols
[2025-06-04 22:37:57] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:37:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-04 22:37:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:37:57] [INFO ] State equation strengthened by 144 read => feed constraints.
[2025-06-04 22:37:59] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2025-06-04 22:37:59] [INFO ] Invariant cache hit.
[2025-06-04 22:37:59] [INFO ] State equation strengthened by 144 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 4 (OVERLAPS) 327/523 variables, 196/199 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 144/343 constraints. Problems are: Problem set: 24 solved, 302 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/343 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/523 variables, 0/343 constraints. Problems are: Problem set: 24 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 343 constraints, problems are : Problem set: 24 solved, 302 unsolved in 28152 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 17/188 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 8/196 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 327/523 variables, 196/199 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 144/343 constraints. Problems are: Problem set: 24 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 302/645 constraints. Problems are: Problem set: 24 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:38:55] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 9 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 646 constraints, problems are : Problem set: 28 solved, 298 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 302/326 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58384ms problems are : Problem set: 28 solved, 298 unsolved
Search for dead transitions found 28 dead transitions in 58385ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 196/420 places, 299/2098 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 170 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 169 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 169 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 167 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 167 transition count 284
Applied a total of 44 rules in 5 ms. Remains 167 /196 variables (removed 29) and now considering 284/299 (removed 15) transitions.
// Phase 1: matrix 284 rows 167 cols
[2025-06-04 22:38:57] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:38:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 22:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:38:58] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-06-04 22:38:58] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 167/420 places, 284/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60976 ms. Remains : 167/420 places, 284/2098 transitions.
[2025-06-04 22:38:58] [INFO ] Flatten gal took : 9 ms
[2025-06-04 22:38:58] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:38:58] [INFO ] Input system was already deterministic with 284 transitions.
[2025-06-04 22:38:58] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:38:58] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:38:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17072395724066234281.gal : 1 ms
[2025-06-04 22:38:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17123698972594855689.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17072395724066234281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17123698972594855689.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.67039e+11,7.97682,194516,2,25273,5,534831,6,0,952,604861,0
Converting to forward existential form...Done !
original formula: EX(EF(((E(((s1>=1)&&(l3760>=1)) U ((s1>=1)&&(l3943>=1))) + AF(((s1>=1)&&(l3940>=1)))) + ((s1>=1)&&(l3932>=1)))))
=> equivalent forward existential formula: (([(FwdU(FwdU(EY(Init),TRUE),((s1>=1)&&(l3760>=1))) * ((s1>=1)&&(l3943>=1)))] != FALSE + [(FwdU(EY(Init),TRUE) *...259
Hit Full ! (commute/partial/dont) 9/273/275
(forward)formula 0,1,13.494,203220,1,0,10,547302,16,1,2545,629898,7
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 369 transition count 710
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 369 transition count 710
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 118 place count 369 transition count 694
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 186 place count 301 transition count 626
Iterating global reduction 1 with 68 rules applied. Total rules applied 254 place count 301 transition count 626
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 316 place count 301 transition count 564
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 424 place count 193 transition count 456
Iterating global reduction 2 with 108 rules applied. Total rules applied 532 place count 193 transition count 456
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 668 place count 193 transition count 320
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 669 place count 192 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 670 place count 192 transition count 307
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 671 place count 191 transition count 306
Iterating global reduction 3 with 1 rules applied. Total rules applied 672 place count 191 transition count 306
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 676 place count 187 transition count 302
Iterating global reduction 3 with 4 rules applied. Total rules applied 680 place count 187 transition count 302
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 700 place count 187 transition count 282
Applied a total of 700 rules in 30 ms. Remains 187 /420 variables (removed 233) and now considering 282/2098 (removed 1816) transitions.
// Phase 1: matrix 282 rows 187 cols
[2025-06-04 22:39:12] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:39:12] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-04 22:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:39:12] [INFO ] State equation strengthened by 107 read => feed constraints.
[2025-06-04 22:39:14] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 2346 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-04 22:39:14] [INFO ] Invariant cache hit.
[2025-06-04 22:39:14] [INFO ] State equation strengthened by 107 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 4 (OVERLAPS) 282/469 variables, 187/190 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 107/297 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/297 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/469 variables, 0/297 constraints. Problems are: Problem set: 24 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 297 constraints, problems are : Problem set: 24 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 17/179 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 8/187 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 282/469 variables, 187/190 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 107/297 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 257/554 constraints. Problems are: Problem set: 24 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:40:10] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:40:10] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 8 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:40:12] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 5 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 557 constraints, problems are : Problem set: 36 solved, 245 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 257/281 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 36 solved, 245 unsolved
Search for dead transitions found 36 dead transitions in 60219ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 187/420 places, 246/2098 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 155 transition count 234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 151 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 151 transition count 230
Applied a total of 52 rules in 6 ms. Remains 151 /187 variables (removed 36) and now considering 230/246 (removed 16) transitions.
// Phase 1: matrix 230 rows 151 cols
[2025-06-04 22:40:14] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:40:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 22:40:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:40:14] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-04 22:40:15] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/420 places, 230/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63777 ms. Remains : 151/420 places, 230/2098 transitions.
[2025-06-04 22:40:15] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:40:15] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:40:16] [INFO ] Input system was already deterministic with 230 transitions.
[2025-06-04 22:40:16] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:40:16] [INFO ] Flatten gal took : 5 ms
[2025-06-04 22:40:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15643846636778875260.gal : 1 ms
[2025-06-04 22:40:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11002808941942485898.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15643846636778875260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11002808941942485898.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.82501e+11,2.89616,89072,2,19773,5,298615,6,0,834,261513,0
Converting to forward existential form...Done !
original formula: A(((s1>=1)&&(l3919>=1)) U !(EX(AG((((s1>=1)&&(l2793>=1))||(!((s1>=1)&&(l3917>=1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(E(TRUE U !((((s1>=1)&&(l2793>=1))||(!((s1>=1)&&(l3917>=1))))))))))))) * !(E(!(!(EX(!(E(T...338
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t27, t28, t29, t30, t31, t32, t33, t34, t35,...772
Detected timeout of ITS tools.
[2025-06-04 22:40:46] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:40:46] [INFO ] Applying decomposition
[2025-06-04 22:40:46] [INFO ] Flatten gal took : 5 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/graph7768925871718452543.txt' '-o' '/tmp/graph7768925871718452543.bin' '-w' '/tmp/graph7768925871718452543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7768925871718452543.bin' '-l' '-1' '-v' '-w' '/tmp/graph7768925871718452543.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:40:46] [INFO ] Decomposing Gal with order
[2025-06-04 22:40:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:40:46] [INFO ] Removed a total of 242 redundant transitions.
[2025-06-04 22:40:46] [INFO ] Flatten gal took : 18 ms
[2025-06-04 22:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 8 ms.
[2025-06-04 22:40:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7405080621355208023.gal : 2 ms
[2025-06-04 22:40:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10267212224775569541.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7405080621355208023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10267212224775569541.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 371 transition count 812
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 371 transition count 812
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 120 place count 371 transition count 790
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 186 place count 305 transition count 724
Iterating global reduction 1 with 66 rules applied. Total rules applied 252 place count 305 transition count 724
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 334 place count 305 transition count 642
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 434 place count 205 transition count 542
Iterating global reduction 2 with 100 rules applied. Total rules applied 534 place count 205 transition count 542
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 686 place count 205 transition count 390
Applied a total of 686 rules in 24 ms. Remains 205 /420 variables (removed 215) and now considering 390/2098 (removed 1708) transitions.
// Phase 1: matrix 390 rows 205 cols
[2025-06-04 22:41:16] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:41:16] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 22:41:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:41:16] [INFO ] State equation strengthened by 200 read => feed constraints.
[2025-06-04 22:41:17] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2025-06-04 22:41:17] [INFO ] Invariant cache hit.
[2025-06-04 22:41:17] [INFO ] State equation strengthened by 200 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 4 (OVERLAPS) 390/595 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 200/408 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 0/408 constraints. Problems are: Problem set: 24 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/595 variables, and 408 constraints, problems are : Problem set: 24 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 17/197 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 8/205 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 390/595 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 200/408 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 365/773 constraints. Problems are: Problem set: 24 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 773 constraints, problems are : Problem set: 24 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 365/389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 24 solved, 365 unsolved
Search for dead transitions found 24 dead transitions in 60310ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/420 places, 366/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 181 transition count 354
Applied a total of 36 rules in 2 ms. Remains 181 /205 variables (removed 24) and now considering 354/366 (removed 12) transitions.
// Phase 1: matrix 354 rows 181 cols
[2025-06-04 22:42:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:42:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 22:42:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:42:18] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-04 22:42:18] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 181/420 places, 354/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62685 ms. Remains : 181/420 places, 354/2098 transitions.
[2025-06-04 22:42:18] [INFO ] Flatten gal took : 11 ms
[2025-06-04 22:42:18] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:42:18] [INFO ] Input system was already deterministic with 354 transitions.
[2025-06-04 22:42:18] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:42:18] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2687227075137819067.gal : 1 ms
[2025-06-04 22:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12645811880833463487.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2687227075137819067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12645811880833463487.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 22:42:49] [INFO ] Flatten gal took : 11 ms
[2025-06-04 22:42:49] [INFO ] Applying decomposition
[2025-06-04 22:42:49] [INFO ] Flatten gal took : 8 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/graph8085942376536236758.txt' '-o' '/tmp/graph8085942376536236758.bin' '-w' '/tmp/graph8085942376536236758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8085942376536236758.bin' '-l' '-1' '-v' '-w' '/tmp/graph8085942376536236758.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:42:49] [INFO ] Decomposing Gal with order
[2025-06-04 22:42:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:42:49] [INFO ] Removed a total of 448 redundant transitions.
[2025-06-04 22:42:49] [INFO ] Flatten gal took : 24 ms
[2025-06-04 22:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 9 ms.
[2025-06-04 22:42:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7940495764516443134.gal : 2 ms
[2025-06-04 22:42:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6589293810397501122.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7940495764516443134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6589293810397501122.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 373 transition count 862
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 373 transition count 862
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 118 place count 373 transition count 838
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 182 place count 309 transition count 774
Iterating global reduction 1 with 64 rules applied. Total rules applied 246 place count 309 transition count 774
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 338 place count 309 transition count 682
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 434 place count 213 transition count 586
Iterating global reduction 2 with 96 rules applied. Total rules applied 530 place count 213 transition count 586
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Iterating post reduction 2 with 172 rules applied. Total rules applied 702 place count 213 transition count 414
Applied a total of 702 rules in 23 ms. Remains 213 /420 variables (removed 207) and now considering 414/2098 (removed 1684) transitions.
// Phase 1: matrix 414 rows 213 cols
[2025-06-04 22:43:19] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:43:19] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-04 22:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:43:19] [INFO ] State equation strengthened by 217 read => feed constraints.
[2025-06-04 22:43:22] [INFO ] Implicit Places using invariants and state equation in 2658 ms returned []
Implicit Place search using SMT with State Equation took 2795 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2025-06-04 22:43:22] [INFO ] Invariant cache hit.
[2025-06-04 22:43:22] [INFO ] State equation strengthened by 217 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/213 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 4 (OVERLAPS) 414/627 variables, 213/216 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 217/433 constraints. Problems are: Problem set: 24 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/627 variables, and 433 constraints, problems are : Problem set: 24 solved, 389 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 389 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 17/205 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 8/213 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 414/627 variables, 213/216 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 217/433 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 389/822 constraints. Problems are: Problem set: 24 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/627 variables, and 822 constraints, problems are : Problem set: 24 solved, 389 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 389/413 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 24 solved, 389 unsolved
Search for dead transitions found 24 dead transitions in 60344ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 213/420 places, 390/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 378
Applied a total of 36 rules in 2 ms. Remains 189 /213 variables (removed 24) and now considering 378/390 (removed 12) transitions.
// Phase 1: matrix 378 rows 189 cols
[2025-06-04 22:44:22] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:44:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-04 22:44:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:44:22] [INFO ] State equation strengthened by 213 read => feed constraints.
[2025-06-04 22:44:24] [INFO ] Implicit Places using invariants and state equation in 2241 ms returned []
Implicit Place search using SMT with State Equation took 2339 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 189/420 places, 378/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65506 ms. Remains : 189/420 places, 378/2098 transitions.
[2025-06-04 22:44:24] [INFO ] Flatten gal took : 11 ms
[2025-06-04 22:44:24] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:44:24] [INFO ] Input system was already deterministic with 378 transitions.
[2025-06-04 22:44:24] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:44:24] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:44:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9551180370444651608.gal : 2 ms
[2025-06-04 22:44:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12195660916747922767.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9551180370444651608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12195660916747922767.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58363e+11,7.07035,192464,2,29476,5,507555,6,0,1134,591835,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 22:44:54] [INFO ] Flatten gal took : 10 ms
[2025-06-04 22:44:54] [INFO ] Applying decomposition
[2025-06-04 22:44:54] [INFO ] Flatten gal took : 8 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/graph7353882762770112042.txt' '-o' '/tmp/graph7353882762770112042.bin' '-w' '/tmp/graph7353882762770112042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7353882762770112042.bin' '-l' '-1' '-v' '-w' '/tmp/graph7353882762770112042.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:44:54] [INFO ] Decomposing Gal with order
[2025-06-04 22:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:44:54] [INFO ] Removed a total of 399 redundant transitions.
[2025-06-04 22:44:54] [INFO ] Flatten gal took : 19 ms
[2025-06-04 22:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 8 ms.
[2025-06-04 22:44:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13055136257380569916.gal : 3 ms
[2025-06-04 22:44:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6274214492072933528.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13055136257380569916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6274214492072933528.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 370 transition count 711
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 370 transition count 711
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 115 place count 370 transition count 696
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 183 place count 302 transition count 628
Iterating global reduction 1 with 68 rules applied. Total rules applied 251 place count 302 transition count 628
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 313 place count 302 transition count 566
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 421 place count 194 transition count 458
Iterating global reduction 2 with 108 rules applied. Total rules applied 529 place count 194 transition count 458
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 649 place count 194 transition count 338
Applied a total of 649 rules in 55 ms. Remains 194 /420 variables (removed 226) and now considering 338/2098 (removed 1760) transitions.
// Phase 1: matrix 338 rows 194 cols
[2025-06-04 22:45:25] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:45:25] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-04 22:45:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:45:25] [INFO ] State equation strengthened by 157 read => feed constraints.
[2025-06-04 22:45:27] [INFO ] Implicit Places using invariants and state equation in 1898 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:45:27] [INFO ] Redundant transitions in 10 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-04 22:45:27] [INFO ] Invariant cache hit.
[2025-06-04 22:45:27] [INFO ] State equation strengthened by 157 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
At refinement iteration 4 (OVERLAPS) 338/532 variables, 194/197 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 157/354 constraints. Problems are: Problem set: 24 solved, 313 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/354 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 0/532 variables, 0/354 constraints. Problems are: Problem set: 24 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 354 constraints, problems are : Problem set: 24 solved, 313 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 17/186 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 8/194 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 338/532 variables, 194/197 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 157/354 constraints. Problems are: Problem set: 24 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 313/667 constraints. Problems are: Problem set: 24 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 667 constraints, problems are : Problem set: 24 solved, 313 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 313/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 24 solved, 313 unsolved
Search for dead transitions found 24 dead transitions in 60242ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 194/420 places, 314/2098 transitions.
Graph (complete) has 691 edges and 194 vertex of which 170 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 170 transition count 302
Applied a total of 13 rules in 12 ms. Remains 170 /194 variables (removed 24) and now considering 302/314 (removed 12) transitions.
// Phase 1: matrix 302 rows 170 cols
[2025-06-04 22:46:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:46:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 22:46:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:46:27] [INFO ] State equation strengthened by 153 read => feed constraints.
[2025-06-04 22:46:28] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 170/420 places, 302/2098 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63864 ms. Remains : 170/420 places, 302/2098 transitions.
[2025-06-04 22:46:28] [INFO ] Flatten gal took : 11 ms
[2025-06-04 22:46:28] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:46:28] [INFO ] Input system was already deterministic with 302 transitions.
[2025-06-04 22:46:28] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:46:28] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:46:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7638740233298878408.gal : 2 ms
[2025-06-04 22:46:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12723381374902803825.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7638740233298878408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12723381374902803825.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.40486e+11,6.02241,162388,2,26833,5,439023,6,0,982,460005,0
Converting to forward existential form...Done !
original formula: ((AF((((s1>=1)&&(l2812>=1))||((s1>=1)&&(l3926>=1)))) * EF(((s1>=1)&&(l2979>=1)))) * EF(((s1>=1)&&(l3934>=1))))
=> equivalent forward existential formula: (([FwdG(Init,!((((s1>=1)&&(l2812>=1))||((s1>=1)&&(l3926>=1)))))] = FALSE * [(Init * !(E(TRUE U ((s1>=1)&&(l2979>...229
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t23, t24, t25, t26, t27, ...1041
Detected timeout of ITS tools.
[2025-06-04 22:46:59] [INFO ] Flatten gal took : 13 ms
[2025-06-04 22:46:59] [INFO ] Applying decomposition
[2025-06-04 22:46:59] [INFO ] Flatten gal took : 7 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/graph11838789923274955366.txt' '-o' '/tmp/graph11838789923274955366.bin' '-w' '/tmp/graph11838789923274955366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11838789923274955366.bin' '-l' '-1' '-v' '-w' '/tmp/graph11838789923274955366.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:46:59] [INFO ] Decomposing Gal with order
[2025-06-04 22:46:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:46:59] [INFO ] Removed a total of 264 redundant transitions.
[2025-06-04 22:46:59] [INFO ] Flatten gal took : 15 ms
[2025-06-04 22:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 3 ms.
[2025-06-04 22:46:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7469820157526107713.gal : 2 ms
[2025-06-04 22:46:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8406850021101288539.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7469820157526107713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8406850021101288539.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 370 transition count 763
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 370 transition count 763
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 125 place count 370 transition count 738
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 191 place count 304 transition count 672
Iterating global reduction 1 with 66 rules applied. Total rules applied 257 place count 304 transition count 672
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 326 place count 304 transition count 603
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 430 place count 200 transition count 499
Iterating global reduction 2 with 104 rules applied. Total rules applied 534 place count 200 transition count 499
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 678 place count 200 transition count 355
Applied a total of 678 rules in 37 ms. Remains 200 /420 variables (removed 220) and now considering 355/2098 (removed 1743) transitions.
// Phase 1: matrix 355 rows 200 cols
[2025-06-04 22:47:29] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:47:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-04 22:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:47:29] [INFO ] State equation strengthened by 169 read => feed constraints.
[2025-06-04 22:47:30] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:47:30] [INFO ] Redundant transitions in 9 ms returned []
Running 354 sub problems to find dead transitions.
[2025-06-04 22:47:30] [INFO ] Invariant cache hit.
[2025-06-04 22:47:30] [INFO ] State equation strengthened by 169 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 4 (OVERLAPS) 355/555 variables, 200/203 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 169/372 constraints. Problems are: Problem set: 24 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/555 variables, and 372 constraints, problems are : Problem set: 24 solved, 330 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 17/192 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 8/200 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 355/555 variables, 200/203 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 169/372 constraints. Problems are: Problem set: 24 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 330/702 constraints. Problems are: Problem set: 24 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:48:30] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 703 constraints, problems are : Problem set: 24 solved, 330 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 330/354 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 24 solved, 330 unsolved
Search for dead transitions found 24 dead transitions in 60266ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 200/420 places, 331/2098 transitions.
Graph (complete) has 719 edges and 200 vertex of which 176 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 176 transition count 319
Applied a total of 13 rules in 10 ms. Remains 176 /200 variables (removed 24) and now considering 319/331 (removed 12) transitions.
// Phase 1: matrix 319 rows 176 cols
[2025-06-04 22:48:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:48:30] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 22:48:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:48:30] [INFO ] State equation strengthened by 165 read => feed constraints.
[2025-06-04 22:48:33] [INFO ] Implicit Places using invariants and state equation in 2197 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 176/420 places, 319/2098 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63965 ms. Remains : 176/420 places, 319/2098 transitions.
[2025-06-04 22:48:33] [INFO ] Flatten gal took : 10 ms
[2025-06-04 22:48:33] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:48:33] [INFO ] Input system was already deterministic with 319 transitions.
[2025-06-04 22:48:33] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:48:33] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:48:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7686847535664809658.gal : 1 ms
[2025-06-04 22:48:33] [INFO ] Time to serialize properties into /tmp/CTLFireability3038943162448477538.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7686847535664809658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3038943162448477538.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19455e+11,14.8572,377704,2,27302,5,1.10294e+06,6,0,1023,1.12307e+06,0
Converting to forward existential form...Done !
original formula: AF((AG(EF(!(A(((s1>=1)&&(l3916>=1)) U ((s1>=1)&&(l3937>=1)))))) + EF(((EG(((s1>=1)&&(l3913>=1))) * (p473>=1)) * (l0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(E(TRUE U !(!((E(!(((s1>=1)&&(l3937>=1))) U (!(((s1>=1)&&(l3916>=1))) * !(((s1>=1)&&(l...281
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t25, t26, t27, t28, t29, t31, t32, t33, t34, t35,...1098
Detected timeout of ITS tools.
[2025-06-04 22:49:03] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:49:03] [INFO ] Applying decomposition
[2025-06-04 22:49:03] [INFO ] Flatten gal took : 7 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/graph1097989700293870538.txt' '-o' '/tmp/graph1097989700293870538.bin' '-w' '/tmp/graph1097989700293870538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1097989700293870538.bin' '-l' '-1' '-v' '-w' '/tmp/graph1097989700293870538.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:49:03] [INFO ] Decomposing Gal with order
[2025-06-04 22:49:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:49:03] [INFO ] Removed a total of 364 redundant transitions.
[2025-06-04 22:49:03] [INFO ] Flatten gal took : 18 ms
[2025-06-04 22:49:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 4 ms.
[2025-06-04 22:49:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16098285402122504859.gal : 2 ms
[2025-06-04 22:49:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16720085274963703548.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16098285402122504859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16720085274963703548.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 372 transition count 913
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 372 transition count 913
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 129 place count 372 transition count 880
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 193 place count 308 transition count 816
Iterating global reduction 1 with 64 rules applied. Total rules applied 257 place count 308 transition count 816
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 359 place count 308 transition count 714
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 451 place count 216 transition count 622
Iterating global reduction 2 with 92 rules applied. Total rules applied 543 place count 216 transition count 622
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 711 place count 216 transition count 454
Applied a total of 711 rules in 20 ms. Remains 216 /420 variables (removed 204) and now considering 454/2098 (removed 1644) transitions.
// Phase 1: matrix 454 rows 216 cols
[2025-06-04 22:49:33] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:49:33] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-04 22:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:49:33] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-04 22:49:38] [INFO ] Implicit Places using invariants and state equation in 4655 ms returned []
Implicit Place search using SMT with State Equation took 4786 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2025-06-04 22:49:38] [INFO ] Invariant cache hit.
[2025-06-04 22:49:38] [INFO ] State equation strengthened by 255 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 4 (OVERLAPS) 454/670 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 255/474 constraints. Problems are: Problem set: 24 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/670 variables, and 474 constraints, problems are : Problem set: 24 solved, 429 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 429 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 17/208 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 3 (OVERLAPS) 8/216 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 5 (OVERLAPS) 454/670 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 255/474 constraints. Problems are: Problem set: 24 solved, 429 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 429/903 constraints. Problems are: Problem set: 24 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 903 constraints, problems are : Problem set: 24 solved, 429 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 429/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 24 solved, 429 unsolved
Search for dead transitions found 24 dead transitions in 60367ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/420 places, 430/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 192 transition count 418
Applied a total of 36 rules in 3 ms. Remains 192 /216 variables (removed 24) and now considering 418/430 (removed 12) transitions.
// Phase 1: matrix 418 rows 192 cols
[2025-06-04 22:50:38] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:50:38] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-04 22:50:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:50:38] [INFO ] State equation strengthened by 251 read => feed constraints.
[2025-06-04 22:50:41] [INFO ] Implicit Places using invariants and state equation in 3325 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 192/420 places, 418/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68606 ms. Remains : 192/420 places, 418/2098 transitions.
[2025-06-04 22:50:41] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:50:41] [INFO ] Flatten gal took : 10 ms
[2025-06-04 22:50:41] [INFO ] Input system was already deterministic with 418 transitions.
[2025-06-04 22:50:41] [INFO ] Flatten gal took : 9 ms
[2025-06-04 22:50:41] [INFO ] Flatten gal took : 9 ms
[2025-06-04 22:50:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17728618095934567890.gal : 2 ms
[2025-06-04 22:50:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15459960851525116444.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17728618095934567890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15459960851525116444.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 22:51:12] [INFO ] Flatten gal took : 12 ms
[2025-06-04 22:51:12] [INFO ] Applying decomposition
[2025-06-04 22:51:12] [INFO ] Flatten gal took : 8 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/graph13350599089622350218.txt' '-o' '/tmp/graph13350599089622350218.bin' '-w' '/tmp/graph13350599089622350218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13350599089622350218.bin' '-l' '-1' '-v' '-w' '/tmp/graph13350599089622350218.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:51:12] [INFO ] Decomposing Gal with order
[2025-06-04 22:51:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:51:12] [INFO ] Removed a total of 325 redundant transitions.
[2025-06-04 22:51:12] [INFO ] Flatten gal took : 19 ms
[2025-06-04 22:51:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 4 ms.
[2025-06-04 22:51:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3735574620181327491.gal : 2 ms
[2025-06-04 22:51:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5530360768737415410.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3735574620181327491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5530360768737415410.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 371 transition count 763
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 371 transition count 763
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 121 place count 371 transition count 740
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 185 place count 307 transition count 676
Iterating global reduction 1 with 64 rules applied. Total rules applied 249 place count 307 transition count 676
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 315 place count 307 transition count 610
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 419 place count 203 transition count 506
Iterating global reduction 2 with 104 rules applied. Total rules applied 523 place count 203 transition count 506
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 671 place count 203 transition count 358
Applied a total of 671 rules in 17 ms. Remains 203 /420 variables (removed 217) and now considering 358/2098 (removed 1740) transitions.
// Phase 1: matrix 358 rows 203 cols
[2025-06-04 22:51:42] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:51:42] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-04 22:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:51:42] [INFO ] State equation strengthened by 169 read => feed constraints.
[2025-06-04 22:51:44] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2025-06-04 22:51:44] [INFO ] Invariant cache hit.
[2025-06-04 22:51:44] [INFO ] State equation strengthened by 169 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/203 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
At refinement iteration 4 (OVERLAPS) 358/561 variables, 203/206 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 169/375 constraints. Problems are: Problem set: 24 solved, 333 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/375 constraints. Problems are: Problem set: 24 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/561 variables, and 375 constraints, problems are : Problem set: 24 solved, 333 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 203/203 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 333 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 17/195 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 3 (OVERLAPS) 8/203 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 358/561 variables, 203/206 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 169/375 constraints. Problems are: Problem set: 24 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 333/708 constraints. Problems are: Problem set: 24 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:52:44] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:52:44] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 710 constraints, problems are : Problem set: 24 solved, 333 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 203/203 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 333/357 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 24 solved, 333 unsolved
Search for dead transitions found 24 dead transitions in 60268ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/420 places, 334/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 179 transition count 322
Applied a total of 36 rules in 1 ms. Remains 179 /203 variables (removed 24) and now considering 322/334 (removed 12) transitions.
// Phase 1: matrix 322 rows 179 cols
[2025-06-04 22:52:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:52:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 22:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:52:44] [INFO ] State equation strengthened by 165 read => feed constraints.
[2025-06-04 22:52:45] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 179/420 places, 322/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63511 ms. Remains : 179/420 places, 322/2098 transitions.
[2025-06-04 22:52:45] [INFO ] Flatten gal took : 9 ms
[2025-06-04 22:52:45] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:52:45] [INFO ] Input system was already deterministic with 322 transitions.
[2025-06-04 22:52:45] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:52:45] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:52:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15654271189171472146.gal : 1 ms
[2025-06-04 22:52:45] [INFO ] Time to serialize properties into /tmp/CTLFireability8035501585488822320.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15654271189171472146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8035501585488822320.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.23163e+11,20.1255,474448,2,29537,5,1.38441e+06,6,0,1038,1.57122e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 22:53:15] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:53:15] [INFO ] Applying decomposition
[2025-06-04 22:53:15] [INFO ] Flatten gal took : 7 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/graph1449901344286634602.txt' '-o' '/tmp/graph1449901344286634602.bin' '-w' '/tmp/graph1449901344286634602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1449901344286634602.bin' '-l' '-1' '-v' '-w' '/tmp/graph1449901344286634602.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:53:15] [INFO ] Decomposing Gal with order
[2025-06-04 22:53:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:53:15] [INFO ] Removed a total of 302 redundant transitions.
[2025-06-04 22:53:15] [INFO ] Flatten gal took : 14 ms
[2025-06-04 22:53:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 3 ms.
[2025-06-04 22:53:15] [INFO ] Time to serialize gal into /tmp/CTLFireability938434749877464812.gal : 2 ms
[2025-06-04 22:53:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1640929709156479811.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability938434749877464812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1640929709156479811.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 369 transition count 760
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 369 transition count 760
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 123 place count 369 transition count 739
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 190 place count 302 transition count 672
Iterating global reduction 1 with 67 rules applied. Total rules applied 257 place count 302 transition count 672
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 329 place count 302 transition count 600
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 433 place count 198 transition count 496
Iterating global reduction 2 with 104 rules applied. Total rules applied 537 place count 198 transition count 496
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 685 place count 198 transition count 348
Applied a total of 685 rules in 17 ms. Remains 198 /420 variables (removed 222) and now considering 348/2098 (removed 1750) transitions.
// Phase 1: matrix 348 rows 198 cols
[2025-06-04 22:53:45] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:53:46] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 22:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:53:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-04 22:53:48] [INFO ] Implicit Places using invariants and state equation in 2848 ms returned []
Implicit Place search using SMT with State Equation took 2979 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2025-06-04 22:53:48] [INFO ] Invariant cache hit.
[2025-06-04 22:53:48] [INFO ] State equation strengthened by 164 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 4 (OVERLAPS) 348/546 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 164/365 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/365 constraints. Problems are: Problem set: 24 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 365 constraints, problems are : Problem set: 24 solved, 323 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 323 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 17/190 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 3 (OVERLAPS) 8/198 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 5 (OVERLAPS) 348/546 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 164/365 constraints. Problems are: Problem set: 24 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 323/688 constraints. Problems are: Problem set: 24 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 688 constraints, problems are : Problem set: 24 solved, 323 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 323/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 24 solved, 323 unsolved
Search for dead transitions found 24 dead transitions in 60255ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/420 places, 324/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 174 transition count 312
Applied a total of 36 rules in 4 ms. Remains 174 /198 variables (removed 24) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 174 cols
[2025-06-04 22:54:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:54:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 22:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:54:49] [INFO ] State equation strengthened by 160 read => feed constraints.
[2025-06-04 22:54:50] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 174/420 places, 312/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64556 ms. Remains : 174/420 places, 312/2098 transitions.
[2025-06-04 22:54:50] [INFO ] Flatten gal took : 10 ms
[2025-06-04 22:54:50] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:54:50] [INFO ] Input system was already deterministic with 312 transitions.
[2025-06-04 22:54:50] [INFO ] Flatten gal took : 6 ms
[2025-06-04 22:54:50] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:54:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17298818094706091758.gal : 1 ms
[2025-06-04 22:54:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14618162578004959098.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17298818094706091758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14618162578004959098.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19455e+11,14.7317,356244,2,25188,5,1.01496e+06,6,0,1008,1.14634e+06,0
Converting to forward existential form...Done !
original formula: AG(!(A(((s1>=1)&&(l3931>=1)) U (EX(((s1>=1)&&(l3918>=1))) + EF(((s1>=1)&&(l3917>=1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((EX(((s1>=1)&&(l3918>=1))) + E(TRUE U ((s1>=1)&&(l3917>=1)))))))) * !(E(!((EX(((s1>=...315
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34,...1068
Detected timeout of ITS tools.
[2025-06-04 22:55:20] [INFO ] Flatten gal took : 12 ms
[2025-06-04 22:55:20] [INFO ] Applying decomposition
[2025-06-04 22:55:20] [INFO ] Flatten gal took : 7 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/graph1175409089690559723.txt' '-o' '/tmp/graph1175409089690559723.bin' '-w' '/tmp/graph1175409089690559723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1175409089690559723.bin' '-l' '-1' '-v' '-w' '/tmp/graph1175409089690559723.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:55:20] [INFO ] Decomposing Gal with order
[2025-06-04 22:55:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:55:20] [INFO ] Removed a total of 314 redundant transitions.
[2025-06-04 22:55:20] [INFO ] Flatten gal took : 14 ms
[2025-06-04 22:55:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 3 ms.
[2025-06-04 22:55:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14986865026689385387.gal : 2 ms
[2025-06-04 22:55:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8383931185915676610.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14986865026689385387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8383931185915676610.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 376 transition count 1066
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 376 transition count 1066
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 131 place count 376 transition count 1023
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 191 place count 316 transition count 963
Iterating global reduction 1 with 60 rules applied. Total rules applied 251 place count 316 transition count 963
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 384 place count 316 transition count 830
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 464 place count 236 transition count 750
Iterating global reduction 2 with 80 rules applied. Total rules applied 544 place count 236 transition count 750
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 712 place count 236 transition count 582
Applied a total of 712 rules in 26 ms. Remains 236 /420 variables (removed 184) and now considering 582/2098 (removed 1516) transitions.
// Phase 1: matrix 582 rows 236 cols
[2025-06-04 22:55:50] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:55:50] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-04 22:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:55:50] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-04 22:55:53] [INFO ] Implicit Places using invariants and state equation in 2627 ms returned []
Implicit Place search using SMT with State Equation took 2764 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2025-06-04 22:55:53] [INFO ] Invariant cache hit.
[2025-06-04 22:55:53] [INFO ] State equation strengthened by 367 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
At refinement iteration 4 (OVERLAPS) 582/818 variables, 236/239 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 367/606 constraints. Problems are: Problem set: 24 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/818 variables, and 606 constraints, problems are : Problem set: 24 solved, 557 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 557 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 17/228 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 3 (OVERLAPS) 8/236 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 582/818 variables, 236/239 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 367/606 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 557/1163 constraints. Problems are: Problem set: 24 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 1163 constraints, problems are : Problem set: 24 solved, 557 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 557/581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60546ms problems are : Problem set: 24 solved, 557 unsolved
Search for dead transitions found 24 dead transitions in 60548ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 236/420 places, 558/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 212 transition count 546
Applied a total of 36 rules in 2 ms. Remains 212 /236 variables (removed 24) and now considering 546/558 (removed 12) transitions.
// Phase 1: matrix 546 rows 212 cols
[2025-06-04 22:56:54] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:56:54] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-04 22:56:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:56:54] [INFO ] State equation strengthened by 363 read => feed constraints.
[2025-06-04 22:56:57] [INFO ] Implicit Places using invariants and state equation in 2964 ms returned []
Implicit Place search using SMT with State Equation took 3069 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 212/420 places, 546/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66413 ms. Remains : 212/420 places, 546/2098 transitions.
[2025-06-04 22:56:57] [INFO ] Flatten gal took : 11 ms
[2025-06-04 22:56:57] [INFO ] Flatten gal took : 12 ms
[2025-06-04 22:56:57] [INFO ] Input system was already deterministic with 546 transitions.
[2025-06-04 22:56:57] [INFO ] Flatten gal took : 11 ms
[2025-06-04 22:56:57] [INFO ] Flatten gal took : 11 ms
[2025-06-04 22:56:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5615659200988170150.gal : 2 ms
[2025-06-04 22:56:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6244080390558463726.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5615659200988170150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6244080390558463726.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 22:57:27] [INFO ] Flatten gal took : 15 ms
[2025-06-04 22:57:27] [INFO ] Applying decomposition
[2025-06-04 22:57:27] [INFO ] Flatten gal took : 11 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/graph1698660565725867473.txt' '-o' '/tmp/graph1698660565725867473.bin' '-w' '/tmp/graph1698660565725867473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1698660565725867473.bin' '-l' '-1' '-v' '-w' '/tmp/graph1698660565725867473.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:57:27] [INFO ] Decomposing Gal with order
[2025-06-04 22:57:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:57:27] [INFO ] Removed a total of 500 redundant transitions.
[2025-06-04 22:57:27] [INFO ] Flatten gal took : 26 ms
[2025-06-04 22:57:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 5 ms.
[2025-06-04 22:57:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4417326847500642953.gal : 3 ms
[2025-06-04 22:57:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11368364228184342818.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4417326847500642953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11368364228184342818.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 371 transition count 814
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 371 transition count 814
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 127 place count 371 transition count 785
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 192 place count 306 transition count 720
Iterating global reduction 1 with 65 rules applied. Total rules applied 257 place count 306 transition count 720
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 336 place count 306 transition count 641
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 436 place count 206 transition count 541
Iterating global reduction 2 with 100 rules applied. Total rules applied 536 place count 206 transition count 541
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 680 place count 206 transition count 397
Applied a total of 680 rules in 36 ms. Remains 206 /420 variables (removed 214) and now considering 397/2098 (removed 1701) transitions.
// Phase 1: matrix 397 rows 206 cols
[2025-06-04 22:57:57] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:57:57] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-04 22:57:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:57:57] [INFO ] State equation strengthened by 206 read => feed constraints.
[2025-06-04 22:57:59] [INFO ] Implicit Places using invariants and state equation in 2148 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:57:59] [INFO ] Redundant transitions in 10 ms returned []
Running 396 sub problems to find dead transitions.
[2025-06-04 22:57:59] [INFO ] Invariant cache hit.
[2025-06-04 22:57:59] [INFO ] State equation strengthened by 206 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 4 (OVERLAPS) 397/603 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 206/415 constraints. Problems are: Problem set: 24 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/603 variables, and 415 constraints, problems are : Problem set: 24 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 372 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 17/198 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 3 (OVERLAPS) 8/206 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 397/603 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 206/415 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 372/787 constraints. Problems are: Problem set: 24 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/603 variables, and 787 constraints, problems are : Problem set: 24 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 372/396 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60307ms problems are : Problem set: 24 solved, 372 unsolved
Search for dead transitions found 24 dead transitions in 60307ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 206/420 places, 373/2098 transitions.
Graph (complete) has 772 edges and 206 vertex of which 182 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 182 transition count 361
Applied a total of 13 rules in 11 ms. Remains 182 /206 variables (removed 24) and now considering 361/373 (removed 12) transitions.
// Phase 1: matrix 361 rows 182 cols
[2025-06-04 22:59:00] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:59:00] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 22:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:59:00] [INFO ] State equation strengthened by 202 read => feed constraints.
[2025-06-04 22:59:02] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 182/420 places, 361/2098 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64744 ms. Remains : 182/420 places, 361/2098 transitions.
[2025-06-04 22:59:02] [INFO ] Flatten gal took : 12 ms
[2025-06-04 22:59:02] [INFO ] Flatten gal took : 10 ms
[2025-06-04 22:59:02] [INFO ] Input system was already deterministic with 361 transitions.
[2025-06-04 22:59:02] [INFO ] Flatten gal took : 7 ms
[2025-06-04 22:59:02] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:59:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10040760729860579505.gal : 2 ms
[2025-06-04 22:59:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5905502917099928043.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10040760729860579505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5905502917099928043.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 22:59:32] [INFO ] Flatten gal took : 14 ms
[2025-06-04 22:59:32] [INFO ] Applying decomposition
[2025-06-04 22:59:32] [INFO ] Flatten gal took : 8 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/graph6778472355079396368.txt' '-o' '/tmp/graph6778472355079396368.bin' '-w' '/tmp/graph6778472355079396368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6778472355079396368.bin' '-l' '-1' '-v' '-w' '/tmp/graph6778472355079396368.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:59:32] [INFO ] Decomposing Gal with order
[2025-06-04 22:59:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:59:32] [INFO ] Removed a total of 303 redundant transitions.
[2025-06-04 22:59:32] [INFO ] Flatten gal took : 17 ms
[2025-06-04 22:59:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 4 ms.
[2025-06-04 22:59:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4334035376667290976.gal : 3 ms
[2025-06-04 22:59:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2310306028649040171.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4334035376667290976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2310306028649040171.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2098/2098 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 371 transition count 813
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 371 transition count 813
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 123 place count 371 transition count 788
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 189 place count 305 transition count 722
Iterating global reduction 1 with 66 rules applied. Total rules applied 255 place count 305 transition count 722
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 336 place count 305 transition count 641
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 436 place count 205 transition count 541
Iterating global reduction 2 with 100 rules applied. Total rules applied 536 place count 205 transition count 541
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 684 place count 205 transition count 393
Applied a total of 684 rules in 25 ms. Remains 205 /420 variables (removed 215) and now considering 393/2098 (removed 1705) transitions.
// Phase 1: matrix 393 rows 205 cols
[2025-06-04 23:00:02] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:00:02] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-04 23:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:00:02] [INFO ] State equation strengthened by 203 read => feed constraints.
[2025-06-04 23:00:05] [INFO ] Implicit Places using invariants and state equation in 3127 ms returned []
Implicit Place search using SMT with State Equation took 3257 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2025-06-04 23:00:05] [INFO ] Invariant cache hit.
[2025-06-04 23:00:05] [INFO ] State equation strengthened by 203 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (OVERLAPS) 393/598 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 203/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 0/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 411 constraints, problems are : Problem set: 24 solved, 368 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 17/197 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 8/205 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 393/598 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 203/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 368/779 constraints. Problems are: Problem set: 24 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 779 constraints, problems are : Problem set: 24 solved, 368 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 368/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 24 solved, 368 unsolved
Search for dead transitions found 24 dead transitions in 60316ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/420 places, 369/2098 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 181 transition count 357
Applied a total of 36 rules in 2 ms. Remains 181 /205 variables (removed 24) and now considering 357/369 (removed 12) transitions.
// Phase 1: matrix 357 rows 181 cols
[2025-06-04 23:01:06] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:01:06] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-04 23:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 23:01:06] [INFO ] State equation strengthened by 199 read => feed constraints.
[2025-06-04 23:01:08] [INFO ] Implicit Places using invariants and state equation in 2425 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 181/420 places, 357/2098 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66116 ms. Remains : 181/420 places, 357/2098 transitions.
[2025-06-04 23:01:08] [INFO ] Flatten gal took : 12 ms
[2025-06-04 23:01:08] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:01:08] [INFO ] Input system was already deterministic with 357 transitions.
[2025-06-04 23:01:08] [INFO ] Flatten gal took : 7 ms
[2025-06-04 23:01:08] [INFO ] Flatten gal took : 8 ms
[2025-06-04 23:01:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10025998617353153058.gal : 2 ms
[2025-06-04 23:01:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10994269949322955838.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10025998617353153058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10994269949322955838.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:01:38] [INFO ] Flatten gal took : 10 ms
[2025-06-04 23:01:38] [INFO ] Applying decomposition
[2025-06-04 23:01:38] [INFO ] Flatten gal took : 8 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/graph9772065022021257879.txt' '-o' '/tmp/graph9772065022021257879.bin' '-w' '/tmp/graph9772065022021257879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9772065022021257879.bin' '-l' '-1' '-v' '-w' '/tmp/graph9772065022021257879.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:01:38] [INFO ] Decomposing Gal with order
[2025-06-04 23:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:01:38] [INFO ] Removed a total of 442 redundant transitions.
[2025-06-04 23:01:38] [INFO ] Flatten gal took : 19 ms
[2025-06-04 23:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 5 ms.
[2025-06-04 23:01:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8213194670992414041.gal : 3 ms
[2025-06-04 23:01:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10872174284179137417.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8213194670992414041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10872174284179137417.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 23:02:08] [INFO ] Flatten gal took : 42 ms
[2025-06-04 23:02:08] [INFO ] Flatten gal took : 43 ms
[2025-06-04 23:02:08] [INFO ] Applying decomposition
[2025-06-04 23:02:08] [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/graph11843443160553981343.txt' '-o' '/tmp/graph11843443160553981343.bin' '-w' '/tmp/graph11843443160553981343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11843443160553981343.bin' '-l' '-1' '-v' '-w' '/tmp/graph11843443160553981343.weights' '-q' '0' '-e' '0.001'
[2025-06-04 23:02:09] [INFO ] Decomposing Gal with order
[2025-06-04 23:02:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 23:02:09] [INFO ] Removed a total of 1638 redundant transitions.
[2025-06-04 23:02:09] [INFO ] Flatten gal took : 399 ms
[2025-06-04 23:02:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1553 labels/synchronizations in 32 ms.
[2025-06-04 23:02:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6358516898746494818.gal : 8 ms
[2025-06-04 23:02:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1482162045414527268.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6358516898746494818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1482162045414527268.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
[2025-06-04 23:14:19] [INFO ] Flatten gal took : 432 ms
[2025-06-04 23:14:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17450573012852069405.gal : 36 ms
[2025-06-04 23:14:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17130255770482877702.ctl : 11 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17450573012852069405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17130255770482877702.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26781e+12,385.283,8082716,2,46664,5,1.21113e+07,6,0,3778,8.4084e+06,0
Converting to forward existential form...Done !
original formula: A((((s1>=1)&&(l3936>=1)) * ((l3934>=1) + (((l3927>=1) * AX(((s1>=1)&&(l3916>=1)))) * AF(((s1>=1)&&(l3912>=1)))))) U EF(!(((!((s1>=1)&&(l3...194
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(((!((s1>=1)&&(l3926>=1)))&&(!((s1>=1)&&(l3927>=1)))))))))) * !(E(!(E(TRUE U !(((!((s...419
Reverse transition relation is NOT exact ! Due to transitions t1, t26, t27, t28, t30, t31, t53, t54, t55, t56, t57, t104, t105, t106, t107, t108, t187, t28...10897
Using saturation style SCC detection
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="RingSingleMessageInMbox-PT-d1m020"
export BK_EXAMINATION="CTLFireability"
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 RingSingleMessageInMbox-PT-d1m020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889264100426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m020.tgz
mv RingSingleMessageInMbox-PT-d1m020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;