About the Execution of ITS-Tools for NoC3x3-PT-5B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.607 | 3000266.00 | 3245876.00 | 9601.30 | T???T??T???????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654352000626.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is NoC3x3-PT-5B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352000626
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 525K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-00
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-01
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-02
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-03
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-04
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-05
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-06
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-07
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-08
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-09
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-10
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2024-11
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2023-12
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2023-13
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2023-14
FORMULA_NAME NoC3x3-PT-5B-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716702522211
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-26 05:48:43] [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]
[2024-05-26 05:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:48:43] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-26 05:48:43] [INFO ] Transformed 1571 places.
[2024-05-26 05:48:43] [INFO ] Transformed 2173 transitions.
[2024-05-26 05:48:43] [INFO ] Found NUPN structural information;
[2024-05-26 05:48:43] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 129 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 412 places :
Symmetric choice reduction at 0 with 412 rule applications. Total rules 412 place count 1159 transition count 1761
Iterating global reduction 0 with 412 rules applied. Total rules applied 824 place count 1159 transition count 1761
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 928 place count 1055 transition count 1650
Iterating global reduction 0 with 104 rules applied. Total rules applied 1032 place count 1055 transition count 1650
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 1112 place count 975 transition count 1523
Iterating global reduction 0 with 80 rules applied. Total rules applied 1192 place count 975 transition count 1523
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 1208 place count 959 transition count 1491
Iterating global reduction 0 with 16 rules applied. Total rules applied 1224 place count 959 transition count 1491
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1227 place count 956 transition count 1485
Iterating global reduction 0 with 3 rules applied. Total rules applied 1230 place count 956 transition count 1485
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1233 place count 953 transition count 1482
Iterating global reduction 0 with 3 rules applied. Total rules applied 1236 place count 953 transition count 1482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1238 place count 951 transition count 1478
Iterating global reduction 0 with 2 rules applied. Total rules applied 1240 place count 951 transition count 1478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1242 place count 949 transition count 1472
Iterating global reduction 0 with 2 rules applied. Total rules applied 1244 place count 949 transition count 1472
Applied a total of 1244 rules in 436 ms. Remains 949 /1571 variables (removed 622) and now considering 1472/2173 (removed 701) transitions.
// Phase 1: matrix 1472 rows 949 cols
[2024-05-26 05:48:44] [INFO ] Computed 66 invariants in 27 ms
[2024-05-26 05:48:44] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-26 05:48:44] [INFO ] Invariant cache hit.
[2024-05-26 05:48:45] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Running 1471 sub problems to find dead transitions.
[2024-05-26 05:48:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/948 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
SMT process timed out in 30520ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 30547ms
Starting structural reductions in LTL mode, iteration 1 : 949/1571 places, 1472/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32359 ms. Remains : 949/1571 places, 1472/2173 transitions.
Support contains 129 out of 949 places after structural reductions.
[2024-05-26 05:49:16] [INFO ] Flatten gal took : 122 ms
[2024-05-26 05:49:16] [INFO ] Flatten gal took : 79 ms
[2024-05-26 05:49:16] [INFO ] Input system was already deterministic with 1472 transitions.
RANDOM walk for 40000 steps (61 resets) in 2259 ms. (17 steps per ms) remains 12/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 298 ms. (133 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 68 ms. (579 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
[2024-05-26 05:49:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 428/459 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 490/949 variables, 42/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1472/2421 variables, 949/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2421 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/2421 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2421/2421 variables, and 1015 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 949/949 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 428/459 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 490/949 variables, 42/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1472/2421 variables, 949/1015 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2421 variables, 9/1024 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2421 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/2421 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2421/2421 variables, and 1024 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2427 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 949/949 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3658ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 3 properties in 9898 ms.
Support contains 26 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 1472/1472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 949 transition count 1393
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 870 transition count 1393
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 158 place count 870 transition count 1364
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 216 place count 841 transition count 1364
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 262 place count 795 transition count 1255
Iterating global reduction 2 with 46 rules applied. Total rules applied 308 place count 795 transition count 1255
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 309 place count 795 transition count 1254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 310 place count 794 transition count 1254
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 310 place count 794 transition count 1250
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 318 place count 790 transition count 1250
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 332 place count 776 transition count 1213
Iterating global reduction 4 with 14 rules applied. Total rules applied 346 place count 776 transition count 1213
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 347 place count 776 transition count 1212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 348 place count 775 transition count 1212
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 351 place count 772 transition count 1205
Iterating global reduction 6 with 3 rules applied. Total rules applied 354 place count 772 transition count 1205
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 1 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 6 with 364 rules applied. Total rules applied 718 place count 590 transition count 1023
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 721 place count 590 transition count 1020
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 723 place count 588 transition count 1016
Iterating global reduction 7 with 2 rules applied. Total rules applied 725 place count 588 transition count 1016
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 727 place count 586 transition count 1012
Iterating global reduction 7 with 2 rules applied. Total rules applied 729 place count 586 transition count 1012
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 931 place count 485 transition count 1042
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 943 place count 485 transition count 1030
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 1009 place count 452 transition count 1039
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 8 with 60 rules applied. Total rules applied 1069 place count 452 transition count 979
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1077 place count 444 transition count 979
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1077 place count 444 transition count 974
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1087 place count 439 transition count 974
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1113 place count 426 transition count 961
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1121 place count 422 transition count 967
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1125 place count 422 transition count 963
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1130 place count 418 transition count 962
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 1144 place count 418 transition count 962
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1145 place count 417 transition count 961
Applied a total of 1145 rules in 427 ms. Remains 417 /949 variables (removed 532) and now considering 961/1472 (removed 511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 417/949 places, 961/1472 transitions.
RANDOM walk for 40000 steps (176 resets) in 1104 ms. (36 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
// Phase 1: matrix 961 rows 417 cols
[2024-05-26 05:49:32] [INFO ] Computed 58 invariants in 6 ms
[2024-05-26 05:49:32] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/172 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 245/417 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 961/1378 variables, 417/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1378 variables, 38/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1378 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1378 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1378/1378 variables, and 513 constraints, problems are : Problem set: 0 solved, 4 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 417/417 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/172 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 245/417 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 05:49:32] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 21 ms to minimize.
[2024-05-26 05:49:33] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-26 05:49:33] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 961/1378 variables, 417/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1378 variables, 38/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1378 variables, 4/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 05:49:33] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1378 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1378 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1378 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1378/1378 variables, and 521 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 417/417 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 1648ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 980 ms.
Support contains 11 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 961/961 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 417 transition count 959
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 415 transition count 959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 412 transition count 949
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 412 transition count 949
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 30 place count 402 transition count 939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 400 transition count 932
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 400 transition count 932
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 396 transition count 933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 395 transition count 929
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 395 transition count 929
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 395 transition count 927
Applied a total of 46 rules in 79 ms. Remains 395 /417 variables (removed 22) and now considering 927/961 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 395/417 places, 927/961 transitions.
RANDOM walk for 40000 steps (193 resets) in 1140 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 474116 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 2
Probabilistic random walk after 474116 steps, saw 95575 distinct states, run finished after 3004 ms. (steps per millisecond=157 ) properties seen :0
[2024-05-26 05:49:38] [INFO ] Flow matrix only has 926 transitions (discarded 1 similar events)
// Phase 1: matrix 926 rows 395 cols
[2024-05-26 05:49:38] [INFO ] Computed 58 invariants in 6 ms
[2024-05-26 05:49:38] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/99 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 296/395 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 926/1321 variables, 395/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1321 variables, 37/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1321 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1321 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 395/395 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 88/99 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 296/395 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 05:49:38] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 926/1321 variables, 395/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1321 variables, 37/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1321 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1321 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1321 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 493 constraints, problems are : Problem set: 0 solved, 2 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 395/395 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 889ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 358 ms.
Support contains 11 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 927/927 transitions.
Applied a total of 0 rules in 14 ms. Remains 395 /395 variables (removed 0) and now considering 927/927 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 395/395 places, 927/927 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 927/927 transitions.
Applied a total of 0 rules in 9 ms. Remains 395 /395 variables (removed 0) and now considering 927/927 (removed 0) transitions.
[2024-05-26 05:49:39] [INFO ] Flow matrix only has 926 transitions (discarded 1 similar events)
[2024-05-26 05:49:39] [INFO ] Invariant cache hit.
[2024-05-26 05:49:39] [INFO ] Implicit Places using invariants in 174 ms returned [330]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 394/395 places, 927/927 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 394 transition count 927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 394 transition count 926
Applied a total of 2 rules in 20 ms. Remains 394 /394 variables (removed 0) and now considering 926/927 (removed 1) transitions.
[2024-05-26 05:49:39] [INFO ] Flow matrix only has 925 transitions (discarded 1 similar events)
// Phase 1: matrix 925 rows 394 cols
[2024-05-26 05:49:39] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 05:49:40] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-26 05:49:40] [INFO ] Flow matrix only has 925 transitions (discarded 1 similar events)
[2024-05-26 05:49:40] [INFO ] Invariant cache hit.
[2024-05-26 05:49:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-26 05:49:40] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 394/395 places, 926/927 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 840 ms. Remains : 394/395 places, 926/927 transitions.
RANDOM walk for 40000 steps (184 resets) in 188 ms. (211 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2024-05-26 05:49:40] [INFO ] Flow matrix only has 925 transitions (discarded 1 similar events)
[2024-05-26 05:49:40] [INFO ] Invariant cache hit.
[2024-05-26 05:49:40] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/79 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/394 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 05:49:40] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 925/1319 variables, 394/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1319 variables, 36/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1319 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1319 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 394/394 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/79 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/394 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 925/1319 variables, 394/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1319 variables, 36/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1319 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1319 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1319 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 394/394 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 8 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 926/926 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 393 transition count 925
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 393 transition count 925
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 391 transition count 923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 390 transition count 920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 390 transition count 920
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 390 transition count 920
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 389 transition count 919
Applied a total of 10 rules in 42 ms. Remains 389 /394 variables (removed 5) and now considering 919/926 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 389/394 places, 919/926 transitions.
RANDOM walk for 40000 steps (185 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 585929 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 1
Probabilistic random walk after 585929 steps, saw 142801 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-26 05:49:44] [INFO ] Flow matrix only has 918 transitions (discarded 1 similar events)
// Phase 1: matrix 918 rows 389 cols
[2024-05-26 05:49:44] [INFO ] Computed 57 invariants in 17 ms
[2024-05-26 05:49:44] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/251 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/950 variables, 251/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 25/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 261/1211 variables, 69/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1211 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1211 variables, 9/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1211 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 33/1244 variables, 14/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1244 variables, 33/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1244 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/1302 variables, 31/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1302 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1302 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1302 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/1307 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1307 variables, 5/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1307 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1307 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1307/1307 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 389/389 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/251 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/950 variables, 251/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 25/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/950 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 261/1211 variables, 69/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1211 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1211 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1211 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 33/1244 variables, 14/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1244 variables, 33/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1244 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 58/1302 variables, 31/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1302 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1302 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1302 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/1307 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1307 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1307 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1307 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1307/1307 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 389/389 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 760ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 8 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 919/919 transitions.
Applied a total of 0 rules in 10 ms. Remains 389 /389 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 389/389 places, 919/919 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 919/919 transitions.
Applied a total of 0 rules in 10 ms. Remains 389 /389 variables (removed 0) and now considering 919/919 (removed 0) transitions.
[2024-05-26 05:49:45] [INFO ] Flow matrix only has 918 transitions (discarded 1 similar events)
[2024-05-26 05:49:45] [INFO ] Invariant cache hit.
[2024-05-26 05:49:45] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-26 05:49:45] [INFO ] Flow matrix only has 918 transitions (discarded 1 similar events)
[2024-05-26 05:49:45] [INFO ] Invariant cache hit.
[2024-05-26 05:49:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-26 05:49:46] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-26 05:49:46] [INFO ] Redundant transitions in 48 ms returned []
Running 898 sub problems to find dead transitions.
[2024-05-26 05:49:46] [INFO ] Flow matrix only has 918 transitions (discarded 1 similar events)
[2024-05-26 05:49:46] [INFO ] Invariant cache hit.
[2024-05-26 05:49:46] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 05:49:53] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-26 05:49:53] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-26 05:49:53] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-26 05:49:55] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-26 05:49:56] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-26 05:49:56] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-26 05:49:56] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 3 (OVERLAPS) 1/389 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 05:50:09] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-26 05:50:10] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-26 05:50:10] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-26 05:50:10] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-26 05:50:10] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-26 05:50:11] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-05-26 05:50:11] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-05-26 05:50:11] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-26 05:50:11] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-26 05:50:11] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-26 05:50:11] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 1 ms to minimize.
[2024-05-26 05:50:11] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2024-05-26 05:50:12] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-26 05:50:12] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2024-05-26 05:50:12] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-26 05:50:12] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 1 ms to minimize.
[2024-05-26 05:50:12] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-05-26 05:50:15] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-26 05:50:16] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 389/1307 variables, and 83 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/389 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 898/898 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 05:50:18] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 4 (OVERLAPS) 1/389 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 05:50:30] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-26 05:50:30] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 3 ms to minimize.
[2024-05-26 05:50:30] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-26 05:50:31] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-05-26 05:50:31] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-05-26 05:50:31] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-26 05:50:32] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-26 05:50:32] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-26 05:50:32] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-26 05:50:32] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2024-05-26 05:50:32] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-26 05:50:34] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 05:50:38] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 1 ms to minimize.
[2024-05-26 05:50:38] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-26 05:50:39] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 1 ms to minimize.
[2024-05-26 05:50:39] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-05-26 05:50:39] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-26 05:50:40] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-26 05:50:40] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 1 ms to minimize.
[2024-05-26 05:50:40] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-26 05:50:41] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-26 05:50:42] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-26 05:50:42] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 1 ms to minimize.
[2024-05-26 05:50:42] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 05:50:46] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/1307 variables, and 109 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/389 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 0/898 constraints, Known Traps: 52/52 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 898 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61177 ms. Remains : 389/389 places, 919/919 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 389 transition count 918
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 25 place count 389 transition count 894
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 387 transition count 887
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 387 transition count 887
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 387 transition count 887
Applied a total of 32 rules in 31 ms. Remains 387 /389 variables (removed 2) and now considering 887/919 (removed 32) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 887 rows 387 cols
[2024-05-26 05:50:46] [INFO ] Computed 57 invariants in 11 ms
[2024-05-26 05:50:46] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 05:50:46] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 05:50:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 05:50:46] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 05:50:47] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 05:50:47] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 510 ms.
[2024-05-26 05:50:47] [INFO ] Flatten gal took : 48 ms
[2024-05-26 05:50:47] [INFO ] Flatten gal took : 47 ms
[2024-05-26 05:50:47] [INFO ] Input system was already deterministic with 1472 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 948 transition count 1388
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 865 transition count 1388
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 166 place count 865 transition count 1357
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 834 transition count 1357
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 285 place count 777 transition count 1226
Iterating global reduction 2 with 57 rules applied. Total rules applied 342 place count 777 transition count 1226
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 343 place count 777 transition count 1225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 776 transition count 1225
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 344 place count 776 transition count 1222
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 350 place count 773 transition count 1222
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 367 place count 756 transition count 1184
Iterating global reduction 4 with 17 rules applied. Total rules applied 384 place count 756 transition count 1184
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 756 transition count 1183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 755 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 389 place count 752 transition count 1176
Iterating global reduction 6 with 3 rules applied. Total rules applied 392 place count 752 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 393 place count 751 transition count 1174
Iterating global reduction 6 with 1 rules applied. Total rules applied 394 place count 751 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 750 transition count 1172
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 750 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 397 place count 749 transition count 1169
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 749 transition count 1169
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 748 place count 574 transition count 994
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 751 place count 571 transition count 988
Iterating global reduction 6 with 3 rules applied. Total rules applied 754 place count 571 transition count 988
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 756 place count 569 transition count 984
Iterating global reduction 6 with 2 rules applied. Total rules applied 758 place count 569 transition count 984
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 787 place count 569 transition count 955
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 792 place count 564 transition count 955
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 792 place count 564 transition count 950
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 802 place count 559 transition count 950
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 803 place count 558 transition count 949
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 807 place count 554 transition count 949
Applied a total of 807 rules in 225 ms. Remains 554 /949 variables (removed 395) and now considering 949/1472 (removed 523) transitions.
// Phase 1: matrix 949 rows 554 cols
[2024-05-26 05:50:47] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 05:50:47] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-26 05:50:47] [INFO ] Invariant cache hit.
[2024-05-26 05:50:47] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-26 05:50:48] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-26 05:50:48] [INFO ] Redundant transitions in 10 ms returned []
Running 918 sub problems to find dead transitions.
[2024-05-26 05:50:48] [INFO ] Invariant cache hit.
[2024-05-26 05:50:48] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 918 unsolved
[2024-05-26 05:50:55] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-26 05:50:56] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-26 05:50:57] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-26 05:50:58] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 3 ms to minimize.
[2024-05-26 05:50:58] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 3 ms to minimize.
[2024-05-26 05:50:59] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2024-05-26 05:50:59] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-26 05:51:00] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-26 05:51:01] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-26 05:51:01] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-26 05:51:02] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-26 05:51:02] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-26 05:51:02] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 918 unsolved
[2024-05-26 05:51:10] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-05-26 05:51:11] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-26 05:51:11] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-26 05:51:12] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-26 05:51:12] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 918 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/1503 variables, and 75 constraints, problems are : Problem set: 0 solved, 918 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/554 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 918/918 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 918 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 918 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 918 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 918 unsolved
At refinement iteration 3 (OVERLAPS) 949/1503 variables, 554/629 constraints. Problems are: Problem set: 0 solved, 918 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 29/658 constraints. Problems are: Problem set: 0 solved, 918 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1503 variables, 918/1576 constraints. Problems are: Problem set: 0 solved, 918 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/1503 variables, and 1576 constraints, problems are : Problem set: 0 solved, 918 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 554/554 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 918/918 constraints, Known Traps: 18/18 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 918 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in SI_CTL mode, iteration 1 : 554/949 places, 949/1472 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61190 ms. Remains : 554/949 places, 949/1472 transitions.
[2024-05-26 05:51:48] [INFO ] Flatten gal took : 32 ms
[2024-05-26 05:51:48] [INFO ] Flatten gal took : 26 ms
[2024-05-26 05:51:48] [INFO ] Input system was already deterministic with 949 transitions.
[2024-05-26 05:51:48] [INFO ] Flatten gal took : 63 ms
[2024-05-26 05:51:48] [INFO ] Flatten gal took : 32 ms
RANDOM walk for 40000 steps (118 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-05-26 05:51:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4644948734316213619.gal : 38 ms
[2024-05-26 05:51:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16063842113408232937.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4644948734316213619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16063842113408232937.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16063842113408232937.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 64
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :64 after 159
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :159 after 3360
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3360 after 36344
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :36344 after 220331
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :220331 after 2.13365e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.13365e+07 after 2.16332e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.16332e+09 after 1.30781e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.30781e+10 after 8.50833e+11
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.50833e+11 after 2.56346e+13
Interrupted probabilistic random walk after 547320 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547320 steps, saw 306397 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-26 05:51:51] [INFO ] Invariant cache hit.
[2024-05-26 05:51:51] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/108 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 132/240 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 43/283 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 272/555 variables, 87/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 86/641 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 240/881 variables, 103/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/881 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/881 variables, 10/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/881 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 54/935 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/935 variables, 17/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/935 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 292/1227 variables, 122/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1227 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1227 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 67/1294 variables, 14/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1294 variables, 19/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1294 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 121/1415 variables, 64/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1415 variables, 3/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1415 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 35/1450 variables, 8/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1450 variables, 12/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1450 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 53/1503 variables, 45/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1503 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1503 variables, 2/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1503 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/1503 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1503/1503 variables, and 640 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 554/554 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/108 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 132/240 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/283 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 272/555 variables, 87/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 86/641 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 15/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/641 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 240/881 variables, 103/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/881 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/881 variables, 10/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/881 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 54/935 variables, 9/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/935 variables, 17/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/935 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 292/1227 variables, 122/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1227 variables, 5/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1227 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 67/1294 variables, 14/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1294 variables, 19/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1294 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 121/1415 variables, 64/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1415 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1415 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 35/1450 variables, 8/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1450 variables, 12/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1450 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 53/1503 variables, 45/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1503 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1503 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1503 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/1503 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1503/1503 variables, and 641 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 554/554 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 976ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 949/949 transitions.
Performed 34 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 68 place count 520 transition count 913
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 270 place count 419 transition count 942
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 284 place count 419 transition count 928
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 354 place count 384 transition count 936
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 386 place count 384 transition count 904
Applied a total of 386 rules in 62 ms. Remains 384 /554 variables (removed 170) and now considering 904/949 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 384/554 places, 904/949 transitions.
RANDOM walk for 437999 steps (2130 resets) in 2054 ms. (213 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-5B-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 948 transition count 1388
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 865 transition count 1388
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 166 place count 865 transition count 1357
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 834 transition count 1357
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 285 place count 777 transition count 1226
Iterating global reduction 2 with 57 rules applied. Total rules applied 342 place count 777 transition count 1226
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 343 place count 777 transition count 1225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 776 transition count 1225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 344 place count 776 transition count 1221
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 352 place count 772 transition count 1221
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 370 place count 754 transition count 1178
Iterating global reduction 4 with 18 rules applied. Total rules applied 388 place count 754 transition count 1178
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 389 place count 754 transition count 1177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 390 place count 753 transition count 1177
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 393 place count 750 transition count 1170
Iterating global reduction 6 with 3 rules applied. Total rules applied 396 place count 750 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 397 place count 749 transition count 1168
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 749 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 399 place count 748 transition count 1166
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 748 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 401 place count 747 transition count 1163
Iterating global reduction 6 with 1 rules applied. Total rules applied 402 place count 747 transition count 1163
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 752 place count 572 transition count 988
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 755 place count 569 transition count 982
Iterating global reduction 6 with 3 rules applied. Total rules applied 758 place count 569 transition count 982
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 760 place count 567 transition count 978
Iterating global reduction 6 with 2 rules applied. Total rules applied 762 place count 567 transition count 978
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 791 place count 567 transition count 949
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 796 place count 562 transition count 949
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 796 place count 562 transition count 944
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 806 place count 557 transition count 944
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 807 place count 556 transition count 943
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 811 place count 552 transition count 943
Applied a total of 811 rules in 216 ms. Remains 552 /949 variables (removed 397) and now considering 943/1472 (removed 529) transitions.
// Phase 1: matrix 943 rows 552 cols
[2024-05-26 05:51:54] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 05:51:54] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-26 05:51:54] [INFO ] Invariant cache hit.
[2024-05-26 05:51:54] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-26 05:51:54] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-05-26 05:51:54] [INFO ] Redundant transitions in 15 ms returned []
Running 912 sub problems to find dead transitions.
[2024-05-26 05:51:54] [INFO ] Invariant cache hit.
[2024-05-26 05:51:54] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-26 05:52:02] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-26 05:52:02] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-26 05:52:04] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-26 05:52:04] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2024-05-26 05:52:05] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-05-26 05:52:05] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-26 05:52:06] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2024-05-26 05:52:06] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 3 ms to minimize.
[2024-05-26 05:52:06] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-26 05:52:07] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-05-26 05:52:08] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-26 05:52:08] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-26 05:52:08] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-26 05:52:09] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-26 05:52:09] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-26 05:52:09] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 943/1495 variables, 552/625 constraints. Problems are: Problem set: 0 solved, 912 unsolved
SMT process timed out in 30220ms, After SMT, problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 30234ms
Starting structural reductions in SI_CTL mode, iteration 1 : 552/949 places, 943/1472 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31210 ms. Remains : 552/949 places, 943/1472 transitions.
[2024-05-26 05:52:25] [INFO ] Flatten gal took : 24 ms
[2024-05-26 05:52:25] [INFO ] Flatten gal took : 30 ms
[2024-05-26 05:52:25] [INFO ] Input system was already deterministic with 943 transitions.
[2024-05-26 05:52:25] [INFO ] Flatten gal took : 23 ms
[2024-05-26 05:52:25] [INFO ] Flatten gal took : 24 ms
[2024-05-26 05:52:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10264757424876842776.gal : 6 ms
[2024-05-26 05:52:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12713350401934242603.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10264757424876842776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12713350401934242603.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 05:52:55] [INFO ] Flatten gal took : 23 ms
[2024-05-26 05:52:55] [INFO ] Applying decomposition
[2024-05-26 05:52:55] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4268363672196093815.txt' '-o' '/tmp/graph4268363672196093815.bin' '-w' '/tmp/graph4268363672196093815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4268363672196093815.bin' '-l' '-1' '-v' '-w' '/tmp/graph4268363672196093815.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:52:55] [INFO ] Decomposing Gal with order
[2024-05-26 05:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:52:55] [INFO ] Removed a total of 811 redundant transitions.
[2024-05-26 05:52:55] [INFO ] Flatten gal took : 155 ms
[2024-05-26 05:52:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 315 labels/synchronizations in 40 ms.
[2024-05-26 05:52:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3739832841917487528.gal : 18 ms
[2024-05-26 05:52:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13587278307499218855.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3739832841917487528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13587278307499218855.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 912 transition count 1420
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 912 transition count 1420
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 90 place count 896 transition count 1397
Iterating global reduction 0 with 16 rules applied. Total rules applied 106 place count 896 transition count 1397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 893 transition count 1391
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 893 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 891 transition count 1386
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 891 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 890 transition count 1385
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 890 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 889 transition count 1383
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 889 transition count 1383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 888 transition count 1380
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 888 transition count 1380
Applied a total of 122 rules in 122 ms. Remains 888 /949 variables (removed 61) and now considering 1380/1472 (removed 92) transitions.
// Phase 1: matrix 1380 rows 888 cols
[2024-05-26 05:53:26] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 05:53:26] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-26 05:53:26] [INFO ] Invariant cache hit.
[2024-05-26 05:53:27] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Running 1379 sub problems to find dead transitions.
[2024-05-26 05:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/887 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1379 unsolved
SMT process timed out in 30342ms, After SMT, problems are : Problem set: 0 solved, 1379 unsolved
Search for dead transitions found 0 dead transitions in 30357ms
Starting structural reductions in LTL mode, iteration 1 : 888/949 places, 1380/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31647 ms. Remains : 888/949 places, 1380/1472 transitions.
[2024-05-26 05:53:57] [INFO ] Flatten gal took : 32 ms
[2024-05-26 05:53:57] [INFO ] Flatten gal took : 33 ms
[2024-05-26 05:53:57] [INFO ] Input system was already deterministic with 1380 transitions.
[2024-05-26 05:53:57] [INFO ] Flatten gal took : 31 ms
[2024-05-26 05:53:57] [INFO ] Flatten gal took : 31 ms
[2024-05-26 05:53:57] [INFO ] Time to serialize gal into /tmp/CTLFireability462931466503157350.gal : 7 ms
[2024-05-26 05:53:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2059857235637462079.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability462931466503157350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2059857235637462079.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-26 05:54:28] [INFO ] Flatten gal took : 30 ms
[2024-05-26 05:54:28] [INFO ] Applying decomposition
[2024-05-26 05:54:28] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10248836209299014218.txt' '-o' '/tmp/graph10248836209299014218.bin' '-w' '/tmp/graph10248836209299014218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10248836209299014218.bin' '-l' '-1' '-v' '-w' '/tmp/graph10248836209299014218.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:54:28] [INFO ] Decomposing Gal with order
[2024-05-26 05:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:54:28] [INFO ] Removed a total of 1166 redundant transitions.
[2024-05-26 05:54:28] [INFO ] Flatten gal took : 66 ms
[2024-05-26 05:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 24 ms.
[2024-05-26 05:54:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2562796066518892182.gal : 10 ms
[2024-05-26 05:54:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8565217394291600766.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2562796066518892182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8565217394291600766.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 906 transition count 1416
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 906 transition count 1416
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 104 place count 888 transition count 1390
Iterating global reduction 0 with 18 rules applied. Total rules applied 122 place count 888 transition count 1390
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 128 place count 882 transition count 1379
Iterating global reduction 0 with 6 rules applied. Total rules applied 134 place count 882 transition count 1379
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 137 place count 879 transition count 1372
Iterating global reduction 0 with 3 rules applied. Total rules applied 140 place count 879 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 878 transition count 1371
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 878 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 877 transition count 1369
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 877 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 876 transition count 1366
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 876 transition count 1366
Applied a total of 146 rules in 101 ms. Remains 876 /949 variables (removed 73) and now considering 1366/1472 (removed 106) transitions.
// Phase 1: matrix 1366 rows 876 cols
[2024-05-26 05:54:58] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 05:54:58] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-26 05:54:58] [INFO ] Invariant cache hit.
[2024-05-26 05:54:59] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-05-26 05:54:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/875 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
SMT process timed out in 30304ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30316ms
Starting structural reductions in LTL mode, iteration 1 : 876/949 places, 1366/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31396 ms. Remains : 876/949 places, 1366/1472 transitions.
[2024-05-26 05:55:29] [INFO ] Flatten gal took : 29 ms
[2024-05-26 05:55:29] [INFO ] Flatten gal took : 29 ms
[2024-05-26 05:55:29] [INFO ] Input system was already deterministic with 1366 transitions.
[2024-05-26 05:55:30] [INFO ] Flatten gal took : 28 ms
[2024-05-26 05:55:30] [INFO ] Flatten gal took : 28 ms
[2024-05-26 05:55:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16890948037468368555.gal : 6 ms
[2024-05-26 05:55:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15994522654343858834.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16890948037468368555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15994522654343858834.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 05:56:00] [INFO ] Flatten gal took : 27 ms
[2024-05-26 05:56:00] [INFO ] Applying decomposition
[2024-05-26 05:56:00] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6038504913316143416.txt' '-o' '/tmp/graph6038504913316143416.bin' '-w' '/tmp/graph6038504913316143416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6038504913316143416.bin' '-l' '-1' '-v' '-w' '/tmp/graph6038504913316143416.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:56:00] [INFO ] Decomposing Gal with order
[2024-05-26 05:56:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:56:00] [INFO ] Removed a total of 1183 redundant transitions.
[2024-05-26 05:56:00] [INFO ] Flatten gal took : 62 ms
[2024-05-26 05:56:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 25 ms.
[2024-05-26 05:56:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5099631737573800797.gal : 13 ms
[2024-05-26 05:56:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2728108837541920556.ctl : 18 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5099631737573800797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2728108837541920556.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 948 transition count 1388
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 865 transition count 1388
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 166 place count 865 transition count 1357
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 834 transition count 1357
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 285 place count 777 transition count 1226
Iterating global reduction 2 with 57 rules applied. Total rules applied 342 place count 777 transition count 1226
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 343 place count 777 transition count 1225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 776 transition count 1225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 344 place count 776 transition count 1221
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 352 place count 772 transition count 1221
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 370 place count 754 transition count 1178
Iterating global reduction 4 with 18 rules applied. Total rules applied 388 place count 754 transition count 1178
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 389 place count 754 transition count 1177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 390 place count 753 transition count 1177
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 393 place count 750 transition count 1170
Iterating global reduction 6 with 3 rules applied. Total rules applied 396 place count 750 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 397 place count 749 transition count 1168
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 749 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 399 place count 748 transition count 1166
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 748 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 401 place count 747 transition count 1163
Iterating global reduction 6 with 1 rules applied. Total rules applied 402 place count 747 transition count 1163
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 752 place count 572 transition count 988
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 755 place count 569 transition count 982
Iterating global reduction 6 with 3 rules applied. Total rules applied 758 place count 569 transition count 982
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 760 place count 567 transition count 978
Iterating global reduction 6 with 2 rules applied. Total rules applied 762 place count 567 transition count 978
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 791 place count 567 transition count 949
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 796 place count 562 transition count 949
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 796 place count 562 transition count 944
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 806 place count 557 transition count 944
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 808 place count 557 transition count 944
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 809 place count 556 transition count 943
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 813 place count 552 transition count 943
Applied a total of 813 rules in 209 ms. Remains 552 /949 variables (removed 397) and now considering 943/1472 (removed 529) transitions.
// Phase 1: matrix 943 rows 552 cols
[2024-05-26 05:56:30] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 05:56:31] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-26 05:56:31] [INFO ] Invariant cache hit.
[2024-05-26 05:56:31] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-26 05:56:31] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-05-26 05:56:31] [INFO ] Redundant transitions in 9 ms returned []
Running 912 sub problems to find dead transitions.
[2024-05-26 05:56:31] [INFO ] Invariant cache hit.
[2024-05-26 05:56:31] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-26 05:56:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-26 05:56:39] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 5 ms to minimize.
[2024-05-26 05:56:40] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-26 05:56:41] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 2 ms to minimize.
[2024-05-26 05:56:41] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 3 ms to minimize.
[2024-05-26 05:56:42] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-26 05:56:42] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 3 ms to minimize.
[2024-05-26 05:56:43] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-26 05:56:43] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
[2024-05-26 05:56:44] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-26 05:56:44] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-05-26 05:56:45] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-26 05:56:45] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-26 05:56:45] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-26 05:56:46] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-26 05:56:46] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-26 05:56:52] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/1495 variables, and 74 constraints, problems are : Problem set: 0 solved, 912 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/552 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-26 05:57:05] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 3 ms to minimize.
[2024-05-26 05:57:05] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 3 ms to minimize.
[2024-05-26 05:57:06] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-26 05:57:06] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-26 05:57:06] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-26 05:57:06] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-26 05:57:15] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/552 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-26 05:57:24] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/1495 variables, and 82 constraints, problems are : Problem set: 0 solved, 912 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/552 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 0/912 constraints, Known Traps: 25/25 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in SI_CTL mode, iteration 1 : 552/949 places, 943/1472 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61229 ms. Remains : 552/949 places, 943/1472 transitions.
[2024-05-26 05:57:31] [INFO ] Flatten gal took : 18 ms
[2024-05-26 05:57:31] [INFO ] Flatten gal took : 19 ms
[2024-05-26 05:57:31] [INFO ] Input system was already deterministic with 943 transitions.
[2024-05-26 05:57:31] [INFO ] Flatten gal took : 24 ms
[2024-05-26 05:57:31] [INFO ] Flatten gal took : 20 ms
[2024-05-26 05:57:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17889344468643999153.gal : 4 ms
[2024-05-26 05:57:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality83123580424094988.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17889344468643999153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality83123580424094988.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 20013 steps (51 resets) in 101 ms. (196 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-5B-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 948 transition count 1388
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 865 transition count 1388
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 166 place count 865 transition count 1357
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 834 transition count 1357
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 281 place count 781 transition count 1231
Iterating global reduction 2 with 53 rules applied. Total rules applied 334 place count 781 transition count 1231
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 335 place count 781 transition count 1230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 336 place count 780 transition count 1230
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 336 place count 780 transition count 1226
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 344 place count 776 transition count 1226
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 359 place count 761 transition count 1188
Iterating global reduction 4 with 15 rules applied. Total rules applied 374 place count 761 transition count 1188
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 761 transition count 1187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 376 place count 760 transition count 1187
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 379 place count 757 transition count 1180
Iterating global reduction 6 with 3 rules applied. Total rules applied 382 place count 757 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 383 place count 756 transition count 1178
Iterating global reduction 6 with 1 rules applied. Total rules applied 384 place count 756 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 385 place count 755 transition count 1176
Iterating global reduction 6 with 1 rules applied. Total rules applied 386 place count 755 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 754 transition count 1173
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 754 transition count 1173
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 6 with 348 rules applied. Total rules applied 736 place count 580 transition count 999
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 738 place count 578 transition count 995
Iterating global reduction 6 with 2 rules applied. Total rules applied 740 place count 578 transition count 995
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 742 place count 576 transition count 991
Iterating global reduction 6 with 2 rules applied. Total rules applied 744 place count 576 transition count 991
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 773 place count 576 transition count 962
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 778 place count 571 transition count 962
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 778 place count 571 transition count 957
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 788 place count 566 transition count 957
Applied a total of 788 rules in 213 ms. Remains 566 /949 variables (removed 383) and now considering 957/1472 (removed 515) transitions.
// Phase 1: matrix 957 rows 566 cols
[2024-05-26 05:57:32] [INFO ] Computed 61 invariants in 4 ms
[2024-05-26 05:57:32] [INFO ] Implicit Places using invariants in 284 ms returned [48, 234, 357, 472]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 285 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 562/949 places, 957/1472 transitions.
Applied a total of 0 rules in 11 ms. Remains 562 /562 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 509 ms. Remains : 562/949 places, 957/1472 transitions.
[2024-05-26 05:57:32] [INFO ] Flatten gal took : 18 ms
[2024-05-26 05:57:32] [INFO ] Flatten gal took : 19 ms
[2024-05-26 05:57:32] [INFO ] Input system was already deterministic with 957 transitions.
[2024-05-26 05:57:32] [INFO ] Flatten gal took : 19 ms
[2024-05-26 05:57:32] [INFO ] Flatten gal took : 20 ms
[2024-05-26 05:57:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7706417091073920921.gal : 4 ms
[2024-05-26 05:57:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6357352132337197984.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7706417091073920921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6357352132337197984.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 05:58:02] [INFO ] Flatten gal took : 25 ms
[2024-05-26 05:58:02] [INFO ] Applying decomposition
[2024-05-26 05:58:02] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4631126487669845818.txt' '-o' '/tmp/graph4631126487669845818.bin' '-w' '/tmp/graph4631126487669845818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4631126487669845818.bin' '-l' '-1' '-v' '-w' '/tmp/graph4631126487669845818.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:58:02] [INFO ] Decomposing Gal with order
[2024-05-26 05:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:58:02] [INFO ] Removed a total of 850 redundant transitions.
[2024-05-26 05:58:02] [INFO ] Flatten gal took : 36 ms
[2024-05-26 05:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 8 ms.
[2024-05-26 05:58:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10315870596109201568.gal : 6 ms
[2024-05-26 05:58:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14491955289737801096.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10315870596109201568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14491955289737801096.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 SI_CTL mode, iteration 0 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 948 transition count 1394
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 871 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 870 transition count 1393
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 156 place count 870 transition count 1362
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 218 place count 839 transition count 1362
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 271 place count 786 transition count 1236
Iterating global reduction 3 with 53 rules applied. Total rules applied 324 place count 786 transition count 1236
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 325 place count 786 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 785 transition count 1235
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 326 place count 785 transition count 1232
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 332 place count 782 transition count 1232
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 347 place count 767 transition count 1196
Iterating global reduction 5 with 15 rules applied. Total rules applied 362 place count 767 transition count 1196
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 363 place count 767 transition count 1195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 364 place count 766 transition count 1195
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 366 place count 764 transition count 1191
Iterating global reduction 7 with 2 rules applied. Total rules applied 368 place count 764 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 369 place count 763 transition count 1189
Iterating global reduction 7 with 1 rules applied. Total rules applied 370 place count 763 transition count 1189
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 371 place count 762 transition count 1187
Iterating global reduction 7 with 1 rules applied. Total rules applied 372 place count 762 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 373 place count 761 transition count 1184
Iterating global reduction 7 with 1 rules applied. Total rules applied 374 place count 761 transition count 1184
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 7 with 330 rules applied. Total rules applied 704 place count 596 transition count 1019
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 707 place count 593 transition count 1013
Iterating global reduction 7 with 3 rules applied. Total rules applied 710 place count 593 transition count 1013
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 712 place count 591 transition count 1009
Iterating global reduction 7 with 2 rules applied. Total rules applied 714 place count 591 transition count 1009
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 741 place count 591 transition count 982
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 747 place count 585 transition count 982
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 747 place count 585 transition count 978
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 755 place count 581 transition count 978
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 757 place count 581 transition count 978
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 759 place count 581 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 760 place count 580 transition count 976
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 761 place count 579 transition count 975
Applied a total of 761 rules in 205 ms. Remains 579 /949 variables (removed 370) and now considering 975/1472 (removed 497) transitions.
// Phase 1: matrix 975 rows 579 cols
[2024-05-26 05:58:33] [INFO ] Computed 59 invariants in 7 ms
[2024-05-26 05:58:33] [INFO ] Implicit Places using invariants in 204 ms returned [243]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 218 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 578/949 places, 975/1472 transitions.
Applied a total of 0 rules in 11 ms. Remains 578 /578 variables (removed 0) and now considering 975/975 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 435 ms. Remains : 578/949 places, 975/1472 transitions.
[2024-05-26 05:58:33] [INFO ] Flatten gal took : 18 ms
[2024-05-26 05:58:33] [INFO ] Flatten gal took : 20 ms
[2024-05-26 05:58:33] [INFO ] Input system was already deterministic with 975 transitions.
[2024-05-26 05:58:33] [INFO ] Flatten gal took : 20 ms
[2024-05-26 05:58:33] [INFO ] Flatten gal took : 20 ms
[2024-05-26 05:58:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1451125209209214778.gal : 3 ms
[2024-05-26 05:58:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2997882121256715705.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1451125209209214778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2997882121256715705.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 05:59:03] [INFO ] Flatten gal took : 24 ms
[2024-05-26 05:59:03] [INFO ] Applying decomposition
[2024-05-26 05:59:03] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8309458445159548272.txt' '-o' '/tmp/graph8309458445159548272.bin' '-w' '/tmp/graph8309458445159548272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8309458445159548272.bin' '-l' '-1' '-v' '-w' '/tmp/graph8309458445159548272.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:59:03] [INFO ] Decomposing Gal with order
[2024-05-26 05:59:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:59:03] [INFO ] Removed a total of 793 redundant transitions.
[2024-05-26 05:59:03] [INFO ] Flatten gal took : 50 ms
[2024-05-26 05:59:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 303 labels/synchronizations in 9 ms.
[2024-05-26 05:59:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13126604128052178856.gal : 6 ms
[2024-05-26 05:59:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6131232182433803222.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13126604128052178856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6131232182433803222.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 948 transition count 1388
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 865 transition count 1388
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 166 place count 865 transition count 1357
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 834 transition count 1357
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 284 place count 778 transition count 1227
Iterating global reduction 2 with 56 rules applied. Total rules applied 340 place count 778 transition count 1227
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 341 place count 778 transition count 1226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 342 place count 777 transition count 1226
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 342 place count 777 transition count 1222
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 350 place count 773 transition count 1222
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 368 place count 755 transition count 1179
Iterating global reduction 4 with 18 rules applied. Total rules applied 386 place count 755 transition count 1179
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 387 place count 755 transition count 1178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 754 transition count 1178
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 391 place count 751 transition count 1171
Iterating global reduction 6 with 3 rules applied. Total rules applied 394 place count 751 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 750 transition count 1169
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 750 transition count 1169
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 397 place count 749 transition count 1167
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 749 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 399 place count 748 transition count 1164
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 748 transition count 1164
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 750 place count 573 transition count 989
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 753 place count 570 transition count 983
Iterating global reduction 6 with 3 rules applied. Total rules applied 756 place count 570 transition count 983
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 758 place count 568 transition count 979
Iterating global reduction 6 with 2 rules applied. Total rules applied 760 place count 568 transition count 979
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 789 place count 568 transition count 950
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 794 place count 563 transition count 950
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 794 place count 563 transition count 945
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 804 place count 558 transition count 945
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 805 place count 557 transition count 944
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 809 place count 553 transition count 944
Applied a total of 809 rules in 182 ms. Remains 553 /949 variables (removed 396) and now considering 944/1472 (removed 528) transitions.
// Phase 1: matrix 944 rows 553 cols
[2024-05-26 05:59:34] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 05:59:34] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-26 05:59:34] [INFO ] Invariant cache hit.
[2024-05-26 05:59:34] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-26 05:59:34] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2024-05-26 05:59:34] [INFO ] Redundant transitions in 12 ms returned []
Running 913 sub problems to find dead transitions.
[2024-05-26 05:59:34] [INFO ] Invariant cache hit.
[2024-05-26 05:59:34] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-05-26 05:59:42] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-26 05:59:42] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-26 05:59:43] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-26 05:59:44] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-05-26 05:59:44] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 3 ms to minimize.
[2024-05-26 05:59:45] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-26 05:59:45] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 3 ms to minimize.
[2024-05-26 05:59:46] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2024-05-26 05:59:46] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
[2024-05-26 05:59:46] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 3 ms to minimize.
[2024-05-26 05:59:47] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-26 05:59:48] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-05-26 05:59:48] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-26 05:59:48] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-26 05:59:49] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-26 05:59:49] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-26 05:59:49] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-05-26 05:59:56] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-26 05:59:57] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-26 05:59:57] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 2 ms to minimize.
[2024-05-26 05:59:58] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-26 05:59:58] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 3 ms to minimize.
[2024-05-26 05:59:58] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2024-05-26 05:59:58] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-26 05:59:59] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 3 ms to minimize.
[2024-05-26 05:59:59] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-26 05:59:59] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-26 06:00:01] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1497 variables, and 85 constraints, problems are : Problem set: 0 solved, 913 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/553 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 913/913 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 913 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 28/85 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 3 (OVERLAPS) 944/1497 variables, 553/638 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 29/667 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1497 variables, 913/1580 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-05-26 06:00:32] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 1581 constraints, problems are : Problem set: 0 solved, 913 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 553/553 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 913/913 constraints, Known Traps: 29/29 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 913 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in SI_CTL mode, iteration 1 : 553/949 places, 944/1472 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61133 ms. Remains : 553/949 places, 944/1472 transitions.
[2024-05-26 06:00:35] [INFO ] Flatten gal took : 20 ms
[2024-05-26 06:00:35] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:00:35] [INFO ] Input system was already deterministic with 944 transitions.
RANDOM walk for 10369 steps (30 resets) in 46 ms. (220 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-5B-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-26 06:00:35] [INFO ] Flatten gal took : 20 ms
[2024-05-26 06:00:35] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:00:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality839101341463008554.gal : 3 ms
[2024-05-26 06:00:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3539213402149586704.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality839101341463008554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3539213402149586704.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 948 transition count 1392
Reduce places removed 79 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 82 rules applied. Total rules applied 161 place count 869 transition count 1389
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 164 place count 866 transition count 1389
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 164 place count 866 transition count 1359
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 224 place count 836 transition count 1359
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 279 place count 781 transition count 1233
Iterating global reduction 3 with 55 rules applied. Total rules applied 334 place count 781 transition count 1233
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 335 place count 781 transition count 1232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 780 transition count 1232
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 336 place count 780 transition count 1228
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 344 place count 776 transition count 1228
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 361 place count 759 transition count 1187
Iterating global reduction 5 with 17 rules applied. Total rules applied 378 place count 759 transition count 1187
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 379 place count 759 transition count 1186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 380 place count 758 transition count 1186
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 382 place count 756 transition count 1182
Iterating global reduction 7 with 2 rules applied. Total rules applied 384 place count 756 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 385 place count 755 transition count 1180
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 755 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 387 place count 754 transition count 1178
Iterating global reduction 7 with 1 rules applied. Total rules applied 388 place count 754 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 389 place count 753 transition count 1175
Iterating global reduction 7 with 1 rules applied. Total rules applied 390 place count 753 transition count 1175
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 7 with 342 rules applied. Total rules applied 732 place count 582 transition count 1004
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 735 place count 579 transition count 998
Iterating global reduction 7 with 3 rules applied. Total rules applied 738 place count 579 transition count 998
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 740 place count 577 transition count 994
Iterating global reduction 7 with 2 rules applied. Total rules applied 742 place count 577 transition count 994
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 7 with 29 rules applied. Total rules applied 771 place count 577 transition count 965
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 777 place count 571 transition count 965
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 777 place count 571 transition count 960
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 787 place count 566 transition count 960
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 788 place count 565 transition count 959
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 791 place count 562 transition count 959
Applied a total of 791 rules in 180 ms. Remains 562 /949 variables (removed 387) and now considering 959/1472 (removed 513) transitions.
// Phase 1: matrix 959 rows 562 cols
[2024-05-26 06:00:35] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 06:00:35] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-26 06:00:35] [INFO ] Invariant cache hit.
[2024-05-26 06:00:35] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-26 06:00:36] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-05-26 06:00:36] [INFO ] Redundant transitions in 11 ms returned []
Running 939 sub problems to find dead transitions.
[2024-05-26 06:00:36] [INFO ] Invariant cache hit.
[2024-05-26 06:00:36] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-05-26 06:00:45] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-05-26 06:00:46] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-05-26 06:00:46] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-26 06:00:46] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-26 06:00:47] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-05-26 06:00:47] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-26 06:00:47] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-26 06:00:47] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-26 06:00:47] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-26 06:00:48] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-26 06:00:49] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-26 06:00:49] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-26 06:00:49] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-26 06:00:50] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-26 06:00:50] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-05-26 06:00:56] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-26 06:00:57] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-05-26 06:01:04] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-26 06:01:05] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-26 06:01:05] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-26 06:01:05] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-26 06:01:05] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 1 ms to minimize.
[2024-05-26 06:01:05] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1521 variables, and 59 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/57 constraints, State Equation: 0/562 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 939/939 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-05-26 06:01:09] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2024-05-26 06:01:09] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
[2024-05-26 06:01:09] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-26 06:01:10] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-05-26 06:01:19] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 1 ms to minimize.
[2024-05-26 06:01:19] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 1 ms to minimize.
[2024-05-26 06:01:19] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2024-05-26 06:01:19] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-05-26 06:01:34] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-26 06:01:34] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1521 variables, and 90 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/562 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 0/939 constraints, Known Traps: 33/33 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 939 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in SI_CTL mode, iteration 1 : 562/949 places, 959/1472 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61161 ms. Remains : 562/949 places, 959/1472 transitions.
[2024-05-26 06:01:36] [INFO ] Flatten gal took : 18 ms
[2024-05-26 06:01:36] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:01:36] [INFO ] Input system was already deterministic with 959 transitions.
[2024-05-26 06:01:36] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:01:36] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:01:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3515230541629036432.gal : 3 ms
[2024-05-26 06:01:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3660008359391614847.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3515230541629036432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3660008359391614847.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:02:06] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:02:06] [INFO ] Applying decomposition
[2024-05-26 06:02:06] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17918556964511169059.txt' '-o' '/tmp/graph17918556964511169059.bin' '-w' '/tmp/graph17918556964511169059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17918556964511169059.bin' '-l' '-1' '-v' '-w' '/tmp/graph17918556964511169059.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:02:06] [INFO ] Decomposing Gal with order
[2024-05-26 06:02:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:02:06] [INFO ] Removed a total of 848 redundant transitions.
[2024-05-26 06:02:06] [INFO ] Flatten gal took : 34 ms
[2024-05-26 06:02:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 23 ms.
[2024-05-26 06:02:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8748088421548184979.gal : 5 ms
[2024-05-26 06:02:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1720724145668967937.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8748088421548184979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1720724145668967937.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 906 transition count 1413
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 906 transition count 1413
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 105 place count 887 transition count 1384
Iterating global reduction 0 with 19 rules applied. Total rules applied 124 place count 887 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 131 place count 880 transition count 1371
Iterating global reduction 0 with 7 rules applied. Total rules applied 138 place count 880 transition count 1371
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 140 place count 878 transition count 1366
Iterating global reduction 0 with 2 rules applied. Total rules applied 142 place count 878 transition count 1366
Applied a total of 142 rules in 60 ms. Remains 878 /949 variables (removed 71) and now considering 1366/1472 (removed 106) transitions.
// Phase 1: matrix 1366 rows 878 cols
[2024-05-26 06:02:36] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 06:02:37] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-26 06:02:37] [INFO ] Invariant cache hit.
[2024-05-26 06:02:37] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-05-26 06:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/877 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
SMT process timed out in 30311ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30322ms
Starting structural reductions in LTL mode, iteration 1 : 878/949 places, 1366/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31315 ms. Remains : 878/949 places, 1366/1472 transitions.
[2024-05-26 06:03:08] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:03:08] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:03:08] [INFO ] Input system was already deterministic with 1366 transitions.
[2024-05-26 06:03:08] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:03:08] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:03:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12359244972420550899.gal : 5 ms
[2024-05-26 06:03:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5439193047479320598.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12359244972420550899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5439193047479320598.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:03:38] [INFO ] Flatten gal took : 35 ms
[2024-05-26 06:03:38] [INFO ] Applying decomposition
[2024-05-26 06:03:38] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13168923724802006471.txt' '-o' '/tmp/graph13168923724802006471.bin' '-w' '/tmp/graph13168923724802006471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13168923724802006471.bin' '-l' '-1' '-v' '-w' '/tmp/graph13168923724802006471.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:03:38] [INFO ] Decomposing Gal with order
[2024-05-26 06:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:03:38] [INFO ] Removed a total of 1161 redundant transitions.
[2024-05-26 06:03:38] [INFO ] Flatten gal took : 46 ms
[2024-05-26 06:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 10 ms.
[2024-05-26 06:03:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12378309214607017059.gal : 8 ms
[2024-05-26 06:03:38] [INFO ] Time to serialize properties into /tmp/CTLFireability5895333292677307948.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12378309214607017059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5895333292677307948.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 902 transition count 1408
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 902 transition count 1408
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 115 place count 881 transition count 1377
Iterating global reduction 0 with 21 rules applied. Total rules applied 136 place count 881 transition count 1377
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 142 place count 875 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 148 place count 875 transition count 1366
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 151 place count 872 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 154 place count 872 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 871 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 871 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 870 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 870 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 869 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 869 transition count 1353
Applied a total of 160 rules in 117 ms. Remains 869 /949 variables (removed 80) and now considering 1353/1472 (removed 119) transitions.
// Phase 1: matrix 1353 rows 869 cols
[2024-05-26 06:04:08] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 06:04:09] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-26 06:04:09] [INFO ] Invariant cache hit.
[2024-05-26 06:04:09] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 06:04:09] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 timeout
1.0)
(s624 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30317ms
Starting structural reductions in LTL mode, iteration 1 : 869/949 places, 1353/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31404 ms. Remains : 869/949 places, 1353/1472 transitions.
[2024-05-26 06:04:40] [INFO ] Flatten gal took : 25 ms
[2024-05-26 06:04:40] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:04:40] [INFO ] Input system was already deterministic with 1353 transitions.
[2024-05-26 06:04:40] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:04:40] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:04:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17876549313312724982.gal : 4 ms
[2024-05-26 06:04:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13509500853886289451.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17876549313312724982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13509500853886289451.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:05:10] [INFO ] Flatten gal took : 29 ms
[2024-05-26 06:05:10] [INFO ] Applying decomposition
[2024-05-26 06:05:10] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16283810266461880468.txt' '-o' '/tmp/graph16283810266461880468.bin' '-w' '/tmp/graph16283810266461880468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16283810266461880468.bin' '-l' '-1' '-v' '-w' '/tmp/graph16283810266461880468.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:05:10] [INFO ] Decomposing Gal with order
[2024-05-26 06:05:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:05:10] [INFO ] Removed a total of 1104 redundant transitions.
[2024-05-26 06:05:10] [INFO ] Flatten gal took : 44 ms
[2024-05-26 06:05:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 10 ms.
[2024-05-26 06:05:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12558975647323509344.gal : 7 ms
[2024-05-26 06:05:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6576884169512956443.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12558975647323509344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6576884169512956443.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 912 transition count 1425
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 912 transition count 1425
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 91 place count 895 transition count 1401
Iterating global reduction 0 with 17 rules applied. Total rules applied 108 place count 895 transition count 1401
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 890 transition count 1391
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 890 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 888 transition count 1386
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 888 transition count 1386
Applied a total of 122 rules in 60 ms. Remains 888 /949 variables (removed 61) and now considering 1386/1472 (removed 86) transitions.
// Phase 1: matrix 1386 rows 888 cols
[2024-05-26 06:05:40] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 06:05:40] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-26 06:05:40] [INFO ] Invariant cache hit.
[2024-05-26 06:05:41] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Running 1385 sub problems to find dead transitions.
[2024-05-26 06:05:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/887 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1385 unsolved
SMT process timed out in 30319ms, After SMT, problems are : Problem set: 0 solved, 1385 unsolved
Search for dead transitions found 0 dead transitions in 30331ms
Starting structural reductions in LTL mode, iteration 1 : 888/949 places, 1386/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31359 ms. Remains : 888/949 places, 1386/1472 transitions.
[2024-05-26 06:06:12] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:06:12] [INFO ] Flatten gal took : 37 ms
[2024-05-26 06:06:12] [INFO ] Input system was already deterministic with 1386 transitions.
[2024-05-26 06:06:12] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:06:12] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:06:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7041842633389736648.gal : 5 ms
[2024-05-26 06:06:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3156876728080511611.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7041842633389736648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3156876728080511611.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:06:42] [INFO ] Flatten gal took : 32 ms
[2024-05-26 06:06:42] [INFO ] Applying decomposition
[2024-05-26 06:06:42] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1634829539522855664.txt' '-o' '/tmp/graph1634829539522855664.bin' '-w' '/tmp/graph1634829539522855664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1634829539522855664.bin' '-l' '-1' '-v' '-w' '/tmp/graph1634829539522855664.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:06:42] [INFO ] Decomposing Gal with order
[2024-05-26 06:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:06:42] [INFO ] Removed a total of 1199 redundant transitions.
[2024-05-26 06:06:42] [INFO ] Flatten gal took : 46 ms
[2024-05-26 06:06:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 21 ms.
[2024-05-26 06:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability18075246320175467772.gal : 8 ms
[2024-05-26 06:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4037549776410524042.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18075246320175467772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4037549776410524042.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 948 transition count 1388
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 865 transition count 1388
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 166 place count 865 transition count 1358
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 226 place count 835 transition count 1358
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 282 place count 779 transition count 1230
Iterating global reduction 2 with 56 rules applied. Total rules applied 338 place count 779 transition count 1230
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 339 place count 779 transition count 1229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 340 place count 778 transition count 1229
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 340 place count 778 transition count 1225
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 348 place count 774 transition count 1225
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 366 place count 756 transition count 1182
Iterating global reduction 4 with 18 rules applied. Total rules applied 384 place count 756 transition count 1182
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 756 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 755 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 389 place count 752 transition count 1174
Iterating global reduction 6 with 3 rules applied. Total rules applied 392 place count 752 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 393 place count 751 transition count 1172
Iterating global reduction 6 with 1 rules applied. Total rules applied 394 place count 751 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 750 transition count 1170
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 750 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 397 place count 749 transition count 1167
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 749 transition count 1167
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 6 with 346 rules applied. Total rules applied 744 place count 576 transition count 994
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 747 place count 573 transition count 988
Iterating global reduction 6 with 3 rules applied. Total rules applied 750 place count 573 transition count 988
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 752 place count 571 transition count 984
Iterating global reduction 6 with 2 rules applied. Total rules applied 754 place count 571 transition count 984
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 783 place count 571 transition count 955
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 788 place count 566 transition count 955
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 788 place count 566 transition count 950
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 798 place count 561 transition count 950
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 799 place count 560 transition count 949
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 802 place count 557 transition count 949
Applied a total of 802 rules in 173 ms. Remains 557 /949 variables (removed 392) and now considering 949/1472 (removed 523) transitions.
// Phase 1: matrix 949 rows 557 cols
[2024-05-26 06:07:12] [INFO ] Computed 58 invariants in 4 ms
[2024-05-26 06:07:12] [INFO ] Implicit Places using invariants in 182 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 556/949 places, 949/1472 transitions.
Applied a total of 0 rules in 10 ms. Remains 556 /556 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 376 ms. Remains : 556/949 places, 949/1472 transitions.
[2024-05-26 06:07:12] [INFO ] Flatten gal took : 18 ms
[2024-05-26 06:07:12] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:07:13] [INFO ] Input system was already deterministic with 949 transitions.
[2024-05-26 06:07:13] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:07:13] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:07:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12198336543908418014.gal : 3 ms
[2024-05-26 06:07:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7583985242086939285.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12198336543908418014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7583985242086939285.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:07:43] [INFO ] Flatten gal took : 29 ms
[2024-05-26 06:07:43] [INFO ] Applying decomposition
[2024-05-26 06:07:43] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8853207021457508206.txt' '-o' '/tmp/graph8853207021457508206.bin' '-w' '/tmp/graph8853207021457508206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8853207021457508206.bin' '-l' '-1' '-v' '-w' '/tmp/graph8853207021457508206.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:07:43] [INFO ] Decomposing Gal with order
[2024-05-26 06:07:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:07:43] [INFO ] Removed a total of 802 redundant transitions.
[2024-05-26 06:07:43] [INFO ] Flatten gal took : 35 ms
[2024-05-26 06:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 5 ms.
[2024-05-26 06:07:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15336729228900714212.gal : 6 ms
[2024-05-26 06:07:43] [INFO ] Time to serialize properties into /tmp/CTLFireability18372497331961855647.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15336729228900714212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18372497331961855647.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 SI_CTL mode, iteration 0 : 949/949 places, 1472/1472 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 948 transition count 1388
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 865 transition count 1388
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 166 place count 865 transition count 1357
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 834 transition count 1357
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 284 place count 778 transition count 1227
Iterating global reduction 2 with 56 rules applied. Total rules applied 340 place count 778 transition count 1227
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 341 place count 778 transition count 1226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 342 place count 777 transition count 1226
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 342 place count 777 transition count 1222
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 350 place count 773 transition count 1222
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 368 place count 755 transition count 1179
Iterating global reduction 4 with 18 rules applied. Total rules applied 386 place count 755 transition count 1179
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 387 place count 755 transition count 1178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 754 transition count 1178
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 391 place count 751 transition count 1171
Iterating global reduction 6 with 3 rules applied. Total rules applied 394 place count 751 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 750 transition count 1169
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 750 transition count 1169
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 397 place count 749 transition count 1167
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 749 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 399 place count 748 transition count 1164
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 748 transition count 1164
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 750 place count 573 transition count 989
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 753 place count 570 transition count 983
Iterating global reduction 6 with 3 rules applied. Total rules applied 756 place count 570 transition count 983
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 758 place count 568 transition count 979
Iterating global reduction 6 with 2 rules applied. Total rules applied 760 place count 568 transition count 979
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 789 place count 568 transition count 950
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 794 place count 563 transition count 950
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 794 place count 563 transition count 945
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 804 place count 558 transition count 945
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 805 place count 557 transition count 944
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 809 place count 553 transition count 944
Applied a total of 809 rules in 178 ms. Remains 553 /949 variables (removed 396) and now considering 944/1472 (removed 528) transitions.
// Phase 1: matrix 944 rows 553 cols
[2024-05-26 06:08:13] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 06:08:13] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-26 06:08:13] [INFO ] Invariant cache hit.
[2024-05-26 06:08:13] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-26 06:08:14] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2024-05-26 06:08:14] [INFO ] Redundant transitions in 9 ms returned []
Running 913 sub problems to find dead transitions.
[2024-05-26 06:08:14] [INFO ] Invariant cache hit.
[2024-05-26 06:08:14] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-05-26 06:08:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-26 06:08:21] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-26 06:08:23] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-26 06:08:23] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-26 06:08:24] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2024-05-26 06:08:24] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-05-26 06:08:25] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-05-26 06:08:25] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-05-26 06:08:25] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 2 ms to minimize.
[2024-05-26 06:08:27] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-26 06:08:27] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-26 06:08:28] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-26 06:08:28] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-26 06:08:28] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-05-26 06:08:34] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-26 06:08:35] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-26 06:08:35] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-26 06:08:36] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-26 06:08:36] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 3 ms to minimize.
[2024-05-26 06:08:36] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 3 ms to minimize.
[2024-05-26 06:08:36] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 2 ms to minimize.
[2024-05-26 06:08:37] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-26 06:08:38] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-26 06:08:38] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-26 06:08:38] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-26 06:08:38] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-05-26 06:08:39] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1497 variables, and 84 constraints, problems are : Problem set: 0 solved, 913 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/553 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 913/913 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 913 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-05-26 06:08:49] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 3 ms to minimize.
[2024-05-26 06:08:49] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-26 06:08:50] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 4 (OVERLAPS) 944/1497 variables, 553/640 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1497 variables, 29/669 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1497 variables, 913/1582 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 1582 constraints, problems are : Problem set: 0 solved, 913 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 553/553 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 913/913 constraints, Known Traps: 30/30 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 913 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in SI_CTL mode, iteration 1 : 553/949 places, 944/1472 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61132 ms. Remains : 553/949 places, 944/1472 transitions.
[2024-05-26 06:09:14] [INFO ] Flatten gal took : 21 ms
[2024-05-26 06:09:14] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:09:14] [INFO ] Input system was already deterministic with 944 transitions.
[2024-05-26 06:09:14] [INFO ] Flatten gal took : 18 ms
[2024-05-26 06:09:14] [INFO ] Flatten gal took : 19 ms
[2024-05-26 06:09:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4276973979212846816.gal : 3 ms
[2024-05-26 06:09:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15222128108305799300.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4276973979212846816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15222128108305799300.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:09:44] [INFO ] Flatten gal took : 25 ms
[2024-05-26 06:09:44] [INFO ] Applying decomposition
[2024-05-26 06:09:44] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10533459323926396645.txt' '-o' '/tmp/graph10533459323926396645.bin' '-w' '/tmp/graph10533459323926396645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10533459323926396645.bin' '-l' '-1' '-v' '-w' '/tmp/graph10533459323926396645.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:09:44] [INFO ] Decomposing Gal with order
[2024-05-26 06:09:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:09:44] [INFO ] Removed a total of 790 redundant transitions.
[2024-05-26 06:09:44] [INFO ] Flatten gal took : 30 ms
[2024-05-26 06:09:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 289 labels/synchronizations in 5 ms.
[2024-05-26 06:09:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8739888403734061407.gal : 4 ms
[2024-05-26 06:09:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14672075577204375732.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8739888403734061407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14672075577204375732.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 903 transition count 1409
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 903 transition count 1409
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 111 place count 884 transition count 1381
Iterating global reduction 0 with 19 rules applied. Total rules applied 130 place count 884 transition count 1381
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 137 place count 877 transition count 1368
Iterating global reduction 0 with 7 rules applied. Total rules applied 144 place count 877 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 874 transition count 1361
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 874 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 873 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 873 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 872 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 872 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 871 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 871 transition count 1355
Applied a total of 156 rules in 107 ms. Remains 871 /949 variables (removed 78) and now considering 1355/1472 (removed 117) transitions.
// Phase 1: matrix 1355 rows 871 cols
[2024-05-26 06:10:15] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 06:10:15] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-26 06:10:15] [INFO ] Invariant cache hit.
[2024-05-26 06:10:16] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Running 1354 sub problems to find dead transitions.
[2024-05-26 06:10:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/870 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
SMT process timed out in 30306ms, After SMT, problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 30318ms
Starting structural reductions in LTL mode, iteration 1 : 871/949 places, 1355/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31441 ms. Remains : 871/949 places, 1355/1472 transitions.
[2024-05-26 06:10:46] [INFO ] Flatten gal took : 25 ms
[2024-05-26 06:10:46] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:10:46] [INFO ] Input system was already deterministic with 1355 transitions.
[2024-05-26 06:10:46] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:10:46] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:10:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6446264976178864104.gal : 9 ms
[2024-05-26 06:10:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6206508835465735284.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6446264976178864104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6206508835465735284.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:11:16] [INFO ] Flatten gal took : 28 ms
[2024-05-26 06:11:16] [INFO ] Applying decomposition
[2024-05-26 06:11:16] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11524121177631030336.txt' '-o' '/tmp/graph11524121177631030336.bin' '-w' '/tmp/graph11524121177631030336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11524121177631030336.bin' '-l' '-1' '-v' '-w' '/tmp/graph11524121177631030336.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:11:16] [INFO ] Decomposing Gal with order
[2024-05-26 06:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:11:16] [INFO ] Removed a total of 1182 redundant transitions.
[2024-05-26 06:11:16] [INFO ] Flatten gal took : 43 ms
[2024-05-26 06:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 8 ms.
[2024-05-26 06:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4778592476141143215.gal : 7 ms
[2024-05-26 06:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability263852591887522844.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4778592476141143215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability263852591887522844.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 949/949 places, 1472/1472 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 902 transition count 1408
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 902 transition count 1408
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 115 place count 881 transition count 1377
Iterating global reduction 0 with 21 rules applied. Total rules applied 136 place count 881 transition count 1377
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 143 place count 874 transition count 1364
Iterating global reduction 0 with 7 rules applied. Total rules applied 150 place count 874 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 871 transition count 1357
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 871 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 870 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 870 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 869 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 869 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 868 transition count 1351
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 868 transition count 1351
Applied a total of 162 rules in 95 ms. Remains 868 /949 variables (removed 81) and now considering 1351/1472 (removed 121) transitions.
// Phase 1: matrix 1351 rows 868 cols
[2024-05-26 06:11:47] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 06:11:47] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-26 06:11:47] [INFO ] Invariant cache hit.
[2024-05-26 06:11:48] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Running 1350 sub problems to find dead transitions.
[2024-05-26 06:11:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
SMT process timed out in 30297ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 30309ms
Starting structural reductions in LTL mode, iteration 1 : 868/949 places, 1351/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31420 ms. Remains : 868/949 places, 1351/1472 transitions.
[2024-05-26 06:12:18] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:12:18] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:12:18] [INFO ] Input system was already deterministic with 1351 transitions.
[2024-05-26 06:12:18] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:12:18] [INFO ] Flatten gal took : 27 ms
[2024-05-26 06:12:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2725696762782324491.gal : 4 ms
[2024-05-26 06:12:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2750776471271424420.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2725696762782324491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2750776471271424420.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:12:48] [INFO ] Flatten gal took : 26 ms
[2024-05-26 06:12:48] [INFO ] Applying decomposition
[2024-05-26 06:12:48] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11347103423964864849.txt' '-o' '/tmp/graph11347103423964864849.bin' '-w' '/tmp/graph11347103423964864849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11347103423964864849.bin' '-l' '-1' '-v' '-w' '/tmp/graph11347103423964864849.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:12:48] [INFO ] Decomposing Gal with order
[2024-05-26 06:12:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:12:48] [INFO ] Removed a total of 1140 redundant transitions.
[2024-05-26 06:12:48] [INFO ] Flatten gal took : 46 ms
[2024-05-26 06:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 8 ms.
[2024-05-26 06:12:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3841961328579005025.gal : 6 ms
[2024-05-26 06:12:48] [INFO ] Time to serialize properties into /tmp/CTLFireability2157185526783310343.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3841961328579005025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2157185526783310343.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-26 06:13:18] [INFO ] Flatten gal took : 33 ms
[2024-05-26 06:13:18] [INFO ] Flatten gal took : 30 ms
[2024-05-26 06:13:18] [INFO ] Applying decomposition
[2024-05-26 06:13:18] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12754764991263249572.txt' '-o' '/tmp/graph12754764991263249572.bin' '-w' '/tmp/graph12754764991263249572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12754764991263249572.bin' '-l' '-1' '-v' '-w' '/tmp/graph12754764991263249572.weights' '-q' '0' '-e' '0.001'
[2024-05-26 06:13:19] [INFO ] Decomposing Gal with order
[2024-05-26 06:13:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:13:19] [INFO ] Removed a total of 1359 redundant transitions.
[2024-05-26 06:13:19] [INFO ] Flatten gal took : 49 ms
[2024-05-26 06:13:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 10 ms.
[2024-05-26 06:13:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6089894355290227433.gal : 7 ms
[2024-05-26 06:13:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7933390712496794078.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6089894355290227433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7933390712496794078.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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
[2024-05-26 06:20:54] [INFO ] Applying decomposition
[2024-05-26 06:20:55] [INFO ] Flatten gal took : 31 ms
[2024-05-26 06:20:55] [INFO ] Decomposing Gal with order
[2024-05-26 06:20:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:20:55] [INFO ] Removed a total of 833 redundant transitions.
[2024-05-26 06:20:55] [INFO ] Flatten gal took : 48 ms
[2024-05-26 06:20:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1657 labels/synchronizations in 69 ms.
[2024-05-26 06:20:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12285391599609506427.gal : 7 ms
[2024-05-26 06:20:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3174760807204053576.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12285391599609506427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3174760807204053576.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-26 06:29:04] [INFO ] Flatten gal took : 43 ms
[2024-05-26 06:29:04] [INFO ] Input system was already deterministic with 1472 transitions.
[2024-05-26 06:29:04] [INFO ] Transformed 949 places.
[2024-05-26 06:29:04] [INFO ] Transformed 1472 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 06:29:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11472646333582412554.gal : 6 ms
[2024-05-26 06:29:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7215574297483177138.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11472646333582412554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7215574297483177138.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2999072 ms.
BK_STOP 1716705522477
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="NoC3x3-PT-5B"
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-5568"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-5B, 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 r246-tall-171654352000626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;