About the Execution of ITS-Tools for ShieldRVs-PT-005A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6723.411 | 3600000.00 | 3683088.00 | 9541.90 | TFTTFT???FF????? | 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.r356-tall-171683761800770.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 ShieldRVs-PT-005A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761800770
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 17:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 17:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K 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 ShieldRVs-PT-005A-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-005A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717036244244
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-005A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 02:30:45] [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-30 02:30:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:30:45] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-30 02:30:45] [INFO ] Transformed 73 places.
[2024-05-30 02:30:45] [INFO ] Transformed 98 transitions.
[2024-05-30 02:30:45] [INFO ] Found NUPN structural information;
[2024-05-30 02:30:45] [INFO ] Parsed PT model containing 73 places and 98 transitions and 460 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 69 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 9 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:30:45] [INFO ] Computed 21 invariants in 11 ms
[2024-05-30 02:30:45] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-30 02:30:45] [INFO ] Invariant cache hit.
[2024-05-30 02:30:45] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:30:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 8 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:30:46] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:30:47] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:48] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:30:48] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:30:48] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:30:48] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:30:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:30:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:30:50] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:30:50] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:30:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:30:50] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:30:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:30:51] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:30:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6023 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2929 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 9028ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9045ms
Finished structural reductions in LTL mode , in 1 iterations and 9363 ms. Remains : 73/73 places, 98/98 transitions.
Support contains 69 out of 73 places after structural reductions.
[2024-05-30 02:30:55] [INFO ] Flatten gal took : 33 ms
[2024-05-30 02:30:55] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:30:55] [INFO ] Input system was already deterministic with 98 transitions.
Reduction of identical properties reduced properties to check from 76 to 73
RANDOM walk for 40000 steps (507 resets) in 1083 ms. (36 steps per ms) remains 3/73 properties
BEST_FIRST walk for 40001 steps (100 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (89 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (88 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
[2024-05-30 02:30:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp41 is UNSAT
After SMT solving in domain Real declared 33/171 variables, and 21 constraints, problems are : Problem set: 3 solved, 0 unsolved in 31 ms.
Refiners :[Domain max(s): 12/73 constraints, Positive P Invariants (semi-flows): 9/21 constraints, State Equation: 0/73 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-30 02:30:55] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:30:55] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:30:55] [INFO ] Input system was already deterministic with 98 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 97
Applied a total of 2 rules in 16 ms. Remains 72 /73 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-30 02:30:55] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 02:30:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 02:30:55] [INFO ] Invariant cache hit.
[2024-05-30 02:30:55] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-30 02:30:55] [INFO ] Redundant transitions in 32 ms returned [30]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 72 cols
[2024-05-30 02:30:55] [INFO ] Computed 21 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 3 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:30:56] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:30:57] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:30:58] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 96/168 variables, 72/198 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:30:58] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:30:58] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:30:58] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:30:58] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-05-30 02:30:58] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:30:59] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:30:59] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:30:59] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:31:00] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:31:00] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:31:00] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/168 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:31:00] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:31:00] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:31:00] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:31:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:31:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:31:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:31:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:31:01] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:31:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/168 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:31:02] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 226 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7668 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/168 variables, 72/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 95/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:31:05] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5151 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 62/62 constraints]
After SMT, in 12847ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12849ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/73 places, 96/98 transitions.
Applied a total of 0 rules in 11 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 13034 ms. Remains : 72/73 places, 96/98 transitions.
[2024-05-30 02:31:08] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:31:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:31:08] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-30 02:31:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:31:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15022452287158554560.gal : 3 ms
[2024-05-30 02:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13847721845912066240.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/CTLFireability15022452287158554560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13847721845912066240.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.532013,23224,2,2640,5,57370,6,0,386,140167,0
Converting to forward existential form...Done !
original formula: EG(A(((EF((((p34==1)&&(p35==1))&&(p39==1))) * (p5==1)) * ((p7==1)&&(p11==1))) U !((((p20==1)&&(p21==1))&&(p25==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!((((p20==1)&&(p21==1))&&(p25==1)))) U (!(((E(TRUE U (((p34==1)&&(p35==1))&&(p39==1))) * (p5==...283
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...520
Detected timeout of ITS tools.
[2024-05-30 02:31:38] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:31:38] [INFO ] Applying decomposition
[2024-05-30 02:31:38] [INFO ] Flatten gal took : 6 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/graph1831041097823382356.txt' '-o' '/tmp/graph1831041097823382356.bin' '-w' '/tmp/graph1831041097823382356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1831041097823382356.bin' '-l' '-1' '-v' '-w' '/tmp/graph1831041097823382356.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:31:39] [INFO ] Decomposing Gal with order
[2024-05-30 02:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:31:39] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:31:39] [INFO ] Flatten gal took : 36 ms
[2024-05-30 02:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 7 ms.
[2024-05-30 02:31:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3621240194326682084.gal : 3 ms
[2024-05-30 02:31:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4912870879513525611.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/CTLFireability3621240194326682084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4912870879513525611.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,1.00563,37952,612,29,50651,359,131,241588,33,2163,0
Converting to forward existential form...Done !
original formula: EG(A(((EF((((i2.u9.p34==1)&&(i2.u10.p35==1))&&(i2.u11.p39==1))) * (i0.u1.p5==1)) * ((i0.u2.p7==1)&&(i0.u3.p11==1))) U !((((i1.u5.p20==1)&...191
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p25==1)))) U (!(((E(TRUE U (((i2.u9.p34==1)&&(i2.u...375
Reverse transition relation is NOT exact ! Due to transitions t33, t37, t42, t44, t54, t57, t64, t93, i0.t86, i0.t48, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...599
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:32:09] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 02:32:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 02:32:09] [INFO ] Invariant cache hit.
[2024-05-30 02:32:09] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:32:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:09] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:32:09] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 02:32:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:32:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:32:09] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:32:09] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:32:10] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:32:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:11] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:32:11] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:32:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:32:11] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:32:12] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:32:13] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:32:13] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:32:13] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:32:13] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:32:13] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:32:13] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:32:13] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:32:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:32:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5664 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2915 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8608ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8609ms
Finished structural reductions in LTL mode , in 1 iterations and 8749 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:32:17] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:32:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:17] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:32:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5279263299568168820.gal : 1 ms
[2024-05-30 02:32:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11968587312449267698.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/CTLFireability5279263299568168820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11968587312449267698.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.568498,23332,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: EF(EG(EX((p59==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX((p59==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:32:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:48] [INFO ] Applying decomposition
[2024-05-30 02:32:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3007160099530238934.txt' '-o' '/tmp/graph3007160099530238934.bin' '-w' '/tmp/graph3007160099530238934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3007160099530238934.bin' '-l' '-1' '-v' '-w' '/tmp/graph3007160099530238934.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:32:48] [INFO ] Decomposing Gal with order
[2024-05-30 02:32:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:32:48] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:32:48] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:32:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 3 ms.
[2024-05-30 02:32:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15273708228039400570.gal : 2 ms
[2024-05-30 02:32:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15158997798252481777.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/CTLFireability15273708228039400570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15158997798252481777.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.15898,41136,570,29,53051,375,116,269865,31,2354,0
Converting to forward existential form...Done !
original formula: EF(EG(EX((i4.u17.p59==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX((i4.u17.p59==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:33:18] [INFO ] Invariant cache hit.
[2024-05-30 02:33:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 02:33:18] [INFO ] Invariant cache hit.
[2024-05-30 02:33:18] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:33:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:18] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:33:18] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:33:18] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:33:18] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:33:18] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:33:18] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:33:18] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:33:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:20] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:33:20] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:33:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:33:20] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:33:21] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:33:22] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:33:22] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:33:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:33:22] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:33:22] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:33:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:33:22] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:33:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5693 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2926 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8641ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8644ms
Finished structural reductions in LTL mode , in 1 iterations and 8766 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:33:26] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:33:26] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:33:26] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:33:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:33:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:33:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13183808621225179130.gal : 1 ms
[2024-05-30 02:33:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15330634578471154204.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/CTLFireability13183808621225179130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15330634578471154204.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.554344,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: A(!(AG((((p19==1)&&(p21==1))&&((p25==1)&&(p4==1))))) U (EF((((p47==1)&&(p49==1))&&(p53==1))) + AX(E((p15==1) U (((p31==1)&&(p48==1))&&(p5...165
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (((p47==1)&&(p49==1))&&(p53==1))) + !(EX(!(E((p15==1) U (((p31==1)&&(p48==1))&&(p58==...472
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:33:56] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:33:56] [INFO ] Applying decomposition
[2024-05-30 02:33:56] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17299613619047561914.txt' '-o' '/tmp/graph17299613619047561914.bin' '-w' '/tmp/graph17299613619047561914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17299613619047561914.bin' '-l' '-1' '-v' '-w' '/tmp/graph17299613619047561914.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:33:57] [INFO ] Decomposing Gal with order
[2024-05-30 02:33:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:33:57] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:33:57] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:33:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-30 02:33:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10331190112819936525.gal : 1 ms
[2024-05-30 02:33:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9484523629131698187.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/CTLFireability10331190112819936525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9484523629131698187.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.16493,41408,570,29,53949,401,116,267573,31,2453,0
Converting to forward existential form...Done !
original formula: A(!(AG((((i1.u5.p19==1)&&(i1.u6.p21==1))&&((i1.u7.p25==1)&&(i0.u1.p4==1))))) U (EF((((i3.u13.p47==1)&&(i3.u14.p49==1))&&(i3.u15.p53==1)))...236
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (((i3.u13.p47==1)&&(i3.u14.p49==1))&&(i3.u15.p53==1))) + !(EX(!(E((i0.u4.p15==1) U ((...637
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:34:27] [INFO ] Invariant cache hit.
[2024-05-30 02:34:27] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 02:34:27] [INFO ] Invariant cache hit.
[2024-05-30 02:34:27] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:34:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:34:27] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:34:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:29] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:34:29] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:34:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:34:29] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:34:30] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:34:31] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:34:31] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:34:31] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:34:31] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:34:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:34:31] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:34:32] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5733 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2759 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8515ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8516ms
Finished structural reductions in LTL mode , in 1 iterations and 8636 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:34:35] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:34:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:34:35] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:34:35] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:34:35] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:34:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14020491463752403951.gal : 1 ms
[2024-05-30 02:34:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5289829506686319160.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/CTLFireability14020491463752403951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5289829506686319160.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.542697,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: E(EF((((E(((((p3==1)&&(p20==1))&&(p29==1))||(p10==1)) U !((((p3==1)&&(p18==1))&&(p29==1)))) * (p61==1)) * ((p31==1)&&(p46==1))) * ((p58==...344
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((E(((((p3==1)&&(p20==1))&&(p29==1))||(p10==1)) U !((((p3==1)&&(p18==1))&&(p29==1)))) * (p...408
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:35:05] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:35:05] [INFO ] Applying decomposition
[2024-05-30 02:35:05] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5989031404866569702.txt' '-o' '/tmp/graph5989031404866569702.bin' '-w' '/tmp/graph5989031404866569702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5989031404866569702.bin' '-l' '-1' '-v' '-w' '/tmp/graph5989031404866569702.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:35:05] [INFO ] Decomposing Gal with order
[2024-05-30 02:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:35:05] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:35:05] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 3 ms.
[2024-05-30 02:35:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3745427071789922226.gal : 2 ms
[2024-05-30 02:35:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10722247705737585577.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/CTLFireability3745427071789922226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10722247705737585577.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.18587,41404,553,29,53639,404,116,268504,31,2468,0
Converting to forward existential form...Done !
original formula: E(EF((((E(((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p29==1))||(i0.u3.p10==1)) U !((((i0.u1.p3==1)&&(i1.u5.p18==1))&&(i1.u8.p29==1)))) * (...502
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((E(((((i0.u1.p3==1)&&(i1.u5.p20==1))&&(i1.u8.p29==1))||(i0.u3.p10==1)) U !((((i0.u1.p3==1...566
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:35:35] [INFO ] Invariant cache hit.
[2024-05-30 02:35:35] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 02:35:35] [INFO ] Invariant cache hit.
[2024-05-30 02:35:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:35:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:35:36] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:35:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:38] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:35:38] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:35:38] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:35:38] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:38] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:35:38] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:35:39] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:35:40] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:35:40] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:35:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:35:40] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:35:40] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5678 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3035 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8737ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8738ms
Finished structural reductions in LTL mode , in 1 iterations and 8864 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:35:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:35:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:35:44] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:35:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:35:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15897024515686939908.gal : 1 ms
[2024-05-30 02:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11521502684665977434.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/CTLFireability15897024515686939908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11521502684665977434.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.553943,23340,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: EG((A(!((AG((((p6==1)&&(p7==1))&&(p11==1))) + AG((((p2==1)&&(p4==1))&&(p15==1))))) U (AX(FALSE) * EG((p0==1)))) + ((p1==1)&&(p9==1))))
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((!(EX(!(FALSE))) * EG((p0==1)))) U (!(!((!(E(TRUE U !((((p6==1)&&(p7==1))&&(p11==1))))) + !(E...316
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:36:14] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:36:14] [INFO ] Applying decomposition
[2024-05-30 02:36:14] [INFO ] Flatten gal took : 4 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/graph14958321074129154140.txt' '-o' '/tmp/graph14958321074129154140.bin' '-w' '/tmp/graph14958321074129154140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14958321074129154140.bin' '-l' '-1' '-v' '-w' '/tmp/graph14958321074129154140.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:36:14] [INFO ] Decomposing Gal with order
[2024-05-30 02:36:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:36:14] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:36:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-30 02:36:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5101586027921482363.gal : 1 ms
[2024-05-30 02:36:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10422701461845457873.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/CTLFireability5101586027921482363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10422701461845457873.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.06416,39032,570,29,51988,436,116,248591,31,2763,0
Converting to forward existential form...Done !
original formula: EG((A(!((AG((((i0.u1.p6==1)&&(i0.u2.p7==1))&&(i0.u3.p11==1))) + AG((((i0.u0.p2==1)&&(i0.u1.p4==1))&&(i0.u4.p15==1))))) U (AX(FALSE) * EG(...206
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((!(EX(!(FALSE))) * EG((i0.u0.p0==1)))) U (!(!((!(E(TRUE U !((((i0.u1.p6==1)&&(i0.u2.p7==1))&&...382
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:36:44] [INFO ] Invariant cache hit.
[2024-05-30 02:36:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 02:36:44] [INFO ] Invariant cache hit.
[2024-05-30 02:36:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:36:45] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:36:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:36:47] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:36:48] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:36:49] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:36:49] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:36:49] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:36:49] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5600 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2896 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8519ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8520ms
Finished structural reductions in LTL mode , in 1 iterations and 8640 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:36:53] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:36:53] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:36:53] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:36:53] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:36:53] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:36:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18411055288909480619.gal : 2 ms
[2024-05-30 02:36:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11889757536392914651.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/CTLFireability18411055288909480619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11889757536392914651.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.517678,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: EG(E(!(((p36==1)&&(p41==1))) U (((EX(EF((((p61==1)&&(p63==1))&&(p67==1)))) * (p10==1)) * ((p14==1)&&(p23==1))) * ((!(((p24==1)&&(p30==1))...217
=> equivalent forward existential formula: [FwdG(Init,E(!(((p36==1)&&(p41==1))) U (((EX(E(TRUE U (((p61==1)&&(p63==1))&&(p67==1)))) * (p10==1)) * ((p14==1)...266
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:37:23] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:37:23] [INFO ] Applying decomposition
[2024-05-30 02:37:23] [INFO ] Flatten gal took : 4 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/graph14986510888819417766.txt' '-o' '/tmp/graph14986510888819417766.bin' '-w' '/tmp/graph14986510888819417766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14986510888819417766.bin' '-l' '-1' '-v' '-w' '/tmp/graph14986510888819417766.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:37:23] [INFO ] Decomposing Gal with order
[2024-05-30 02:37:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:37:23] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:37:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:37:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-30 02:37:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5532283921341223620.gal : 1 ms
[2024-05-30 02:37:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15181651531432264311.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/CTLFireability5532283921341223620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15181651531432264311.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.20771,42196,570,29,54186,408,116,280554,31,2500,0
Converting to forward existential form...Done !
original formula: EG(E(!(((i2.u10.p36==1)&&(i2.u12.p41==1))) U (((EX(EF((((i4.u17.p61==1)&&(i4.u18.p63==1))&&(i4.u19.p67==1)))) * (i0.u3.p10==1)) * ((i0.u4...316
=> equivalent forward existential formula: [FwdG(Init,E(!(((i2.u10.p36==1)&&(i2.u12.p41==1))) U (((EX(E(TRUE U (((i4.u17.p61==1)&&(i4.u18.p63==1))&&(i4.u19...365
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:37:53] [INFO ] Invariant cache hit.
[2024-05-30 02:37:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 02:37:53] [INFO ] Invariant cache hit.
[2024-05-30 02:37:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:37:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:37:54] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:37:55] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:55] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:37:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:37:55] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:55] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:37:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:37:55] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:37:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:37:57] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:37:58] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:37:58] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:37:58] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:37:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5636 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2946 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8606ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8609ms
Finished structural reductions in LTL mode , in 1 iterations and 8732 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:38:02] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:38:02] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:38:02] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:38:02] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:38:02] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:38:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9812951373063126641.gal : 0 ms
[2024-05-30 02:38:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6229939764932729378.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/CTLFireability9812951373063126641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6229939764932729378.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.542323,23332,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: A((p11==1) U !((!(AF((((p2==1)&&(p4==1))&&(p16==1)))) + EX(EX(EG((((p48==1)&&(p49==1))&&(p54==1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(!(EG(!((((p2==1)&&(p4==1))&&(p16==1)))))) + EX(EX(EG((((p48==1)&&(p49==1))&&(p54==1)))))))...394
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:38:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:38:32] [INFO ] Applying decomposition
[2024-05-30 02:38:32] [INFO ] Flatten gal took : 4 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/graph11260987572261518959.txt' '-o' '/tmp/graph11260987572261518959.bin' '-w' '/tmp/graph11260987572261518959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11260987572261518959.bin' '-l' '-1' '-v' '-w' '/tmp/graph11260987572261518959.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:38:32] [INFO ] Decomposing Gal with order
[2024-05-30 02:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:38:32] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:38:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-30 02:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10516270900022763327.gal : 1 ms
[2024-05-30 02:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4447440410390341186.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/CTLFireability10516270900022763327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4447440410390341186.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.16934,42196,570,29,54726,419,116,276047,31,2557,0
Converting to forward existential form...Done !
original formula: A((i0.u3.p11==1) U !((!(AF((((i0.u0.p2==1)&&(i0.u1.p4==1))&&(i0.u4.p16==1)))) + EX(EX(EG((((i3.u13.p48==1)&&(i3.u14.p49==1))&&(i3.u15.p54...166
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(!(EG(!((((i0.u0.p2==1)&&(i0.u1.p4==1))&&(i0.u4.p16==1)))))) + EX(EX(EG((((i3.u13.p48==1)&&...517
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 97
Applied a total of 2 rules in 15 ms. Remains 72 /73 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-30 02:39:02] [INFO ] Computed 21 invariants in 0 ms
[2024-05-30 02:39:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 02:39:02] [INFO ] Invariant cache hit.
[2024-05-30 02:39:02] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-30 02:39:02] [INFO ] Redundant transitions in 26 ms returned [30]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 72 cols
[2024-05-30 02:39:02] [INFO ] Computed 21 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:39:03] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 96/168 variables, 72/198 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:05] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:05] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:39:05] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:39:05] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:39:05] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:39:05] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:39:05] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:06] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:39:06] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:39:07] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/168 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:07] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:39:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:39:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:39:07] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:39:07] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:39:08] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:39:08] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:08] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/168 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:39:09] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 226 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7653 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/168 variables, 72/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 95/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:39:12] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5168 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 62/62 constraints]
After SMT, in 12841ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12842ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/73 places, 96/98 transitions.
Applied a total of 0 rules in 12 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 13025 ms. Remains : 72/73 places, 96/98 transitions.
[2024-05-30 02:39:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:39:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:39:15] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-30 02:39:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:39:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:39:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5535589203993060909.gal : 1 ms
[2024-05-30 02:39:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8480259392341366323.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/CTLFireability5535589203993060909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8480259392341366323.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.533225,23324,2,2640,5,57370,6,0,386,140167,0
Converting to forward existential form...Done !
original formula: AG(EF(((A(E((p53==1) U (p60==1)) U A((((p31==1)&&(p46==1))&&(p58==1)) U (p18==1))) * (p50==1)) * (p55==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!((E(!(!((E(!((p18==1)) U (!((((p31==1)&&(p46==1))&&(p58==1))) * !((p18==1)))) ...442
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...520
Detected timeout of ITS tools.
[2024-05-30 02:39:45] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:39:45] [INFO ] Applying decomposition
[2024-05-30 02:39:45] [INFO ] Flatten gal took : 3 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/graph10700755184765277489.txt' '-o' '/tmp/graph10700755184765277489.bin' '-w' '/tmp/graph10700755184765277489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10700755184765277489.bin' '-l' '-1' '-v' '-w' '/tmp/graph10700755184765277489.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:39:45] [INFO ] Decomposing Gal with order
[2024-05-30 02:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:39:45] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:39:45] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:39:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 1 ms.
[2024-05-30 02:39:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10240425787871846355.gal : 1 ms
[2024-05-30 02:39:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11299930880501466111.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/CTLFireability10240425787871846355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11299930880501466111.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,1.14962,41936,595,29,53940,390,132,277550,33,2307,0
Converting to forward existential form...Done !
original formula: AG(EF(((A(E((i3.u15.p53==1) U (i4.u17.p60==1)) U A((((i2.u9.p31==1)&&(i3.u13.p46==1))&&(i3.u16.p58==1)) U (i1.u5.p18==1))) * (i3.u14.p50=...180
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!((E(!(!((E(!((i1.u5.p18==1)) U (!((((i2.u9.p31==1)&&(i3.u13.p46==1))&&(i3.u16....584
Reverse transition relation is NOT exact ! Due to transitions t33, t37, t42, t44, t54, t57, t64, t93, i0.t86, i0.t48, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...599
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 97
Applied a total of 2 rules in 7 ms. Remains 72 /73 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-30 02:40:15] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 02:40:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 02:40:15] [INFO ] Invariant cache hit.
[2024-05-30 02:40:15] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 02:40:15] [INFO ] Redundant transitions in 33 ms returned [30]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 72 cols
[2024-05-30 02:40:15] [INFO ] Computed 21 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:40:16] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:40:17] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:18] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 96/168 variables, 72/198 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:18] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:18] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:40:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:40:18] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2024-05-30 02:40:18] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:40:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:40:19] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:19] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:40:20] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:40:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/168 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:20] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:40:20] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:21] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:40:21] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:40:21] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:40:21] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:40:21] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:40:21] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/168 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:40:22] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 226 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7653 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/168 variables, 72/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 95/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:40:25] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5042 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 62/62 constraints]
After SMT, in 12722ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12723ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/73 places, 96/98 transitions.
Applied a total of 0 rules in 13 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 12900 ms. Remains : 72/73 places, 96/98 transitions.
[2024-05-30 02:40:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:40:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:40:28] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-30 02:40:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:40:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:40:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15962654753749838067.gal : 1 ms
[2024-05-30 02:40:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11658188814795638678.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/CTLFireability15962654753749838067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11658188814795638678.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.534854,23320,2,2640,5,57370,6,0,386,140167,0
Converting to forward existential form...Done !
original formula: EF(EG(((p24==0) * ((EF((p0==0)) + (p17==0)) + ((p34==0)||(p43==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p24==0) * ((E(TRUE U (p0==0)) + (p17==0)) + ((p34==0)||(p43==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...520
Detected timeout of ITS tools.
[2024-05-30 02:40:58] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:40:58] [INFO ] Applying decomposition
[2024-05-30 02:40:58] [INFO ] Flatten gal took : 3 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/graph7322164469273582580.txt' '-o' '/tmp/graph7322164469273582580.bin' '-w' '/tmp/graph7322164469273582580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7322164469273582580.bin' '-l' '-1' '-v' '-w' '/tmp/graph7322164469273582580.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:40:58] [INFO ] Decomposing Gal with order
[2024-05-30 02:40:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:40:58] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:40:58] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:40:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 2 ms.
[2024-05-30 02:40:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5019552238053308878.gal : 1 ms
[2024-05-30 02:40:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16996594774730008931.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/CTLFireability5019552238053308878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16996594774730008931.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,1.04057,38768,768,29,52117,329,135,248710,33,2119,0
Converting to forward existential form...Done !
original formula: EF(EG(((i1.u7.p24==0) * ((EF((i3.u14.p0==0)) + (i1.u5.p17==0)) + ((i2.u9.p34==0)||(i2.u12.p43==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((i1.u7.p24==0) * ((E(TRUE U (i3.u14.p0==0)) + (i1.u5.p17==0)) + ((i2.u9.p34==0)||(i2.u12....176
Reverse transition relation is NOT exact ! Due to transitions t33, t37, t42, t44, t54, t57, t64, t93, i0.t86, i0.t48, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...599
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:41:28] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 02:41:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 02:41:28] [INFO ] Invariant cache hit.
[2024-05-30 02:41:28] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:41:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:41:29] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:41:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:41:31] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:41:32] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:33] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:41:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:41:33] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:41:33] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5651 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2923 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8596ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8598ms
Finished structural reductions in LTL mode , in 1 iterations and 8716 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:41:37] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:41:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:41:37] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:41:37] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:41:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:41:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8540599499517851264.gal : 1 ms
[2024-05-30 02:41:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3837576984330429001.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/CTLFireability8540599499517851264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3837576984330429001.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.542862,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: (AX(AX(EG((((p45==0)||(p62==0))||(p72==0))))) * AF(EG((((p31==1)&&(p46==1))&&(p58==1)))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(EG((((p45==0)||(p62==0))||(p72==0)))))] = FALSE * [FwdG(Init,!(EG((((p31==1)&&(p46==1))&&(p5...174
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
(forward)formula 0,0,21.0724,684548,1,0,637,2.27222e+06,220,202,3427,6.19848e+06,612
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:41:58] [INFO ] Invariant cache hit.
[2024-05-30 02:41:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 02:41:58] [INFO ] Invariant cache hit.
[2024-05-30 02:41:58] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:41:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:41:59] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:42:00] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:42:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:42:02] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:42:03] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:42:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:42:03] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:42:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5676 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2928 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8625ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8625ms
Finished structural reductions in LTL mode , in 1 iterations and 8721 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:42:07] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:42:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:42:07] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:42:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:42:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:42:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16974590994340326258.gal : 1 ms
[2024-05-30 02:42:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15908946923946156715.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/CTLFireability16974590994340326258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15908946923946156715.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.519597,23340,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: (EX(((EF((((p2==1)&&(p6==1))&&(p16==1))) + ((EX((((p3==1)&&(p18==1))&&(p30==1))) + ((p70==0)&&(p14==0))) * (((p40==0)||(p44==0))||(p51==0...465
=> equivalent forward existential formula: [(FwdU((Init * EX(((E(TRUE U (((p2==1)&&(p6==1))&&(p16==1))) + ((EX((((p3==1)&&(p18==1))&&(p30==1))) + ((p70==0)...553
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
(forward)formula 0,0,5.2795,191564,1,0,499,1.0158e+06,228,214,3308,1.63902e+06,435
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 97
Applied a total of 2 rules in 11 ms. Remains 72 /73 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-30 02:42:12] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 02:42:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 02:42:12] [INFO ] Invariant cache hit.
[2024-05-30 02:42:13] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-30 02:42:13] [INFO ] Redundant transitions in 31 ms returned [30]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 72 cols
[2024-05-30 02:42:13] [INFO ] Computed 21 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 02:42:13] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:42:14] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 96/168 variables, 72/198 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:15] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:42:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:42:16] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-05-30 02:42:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:42:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:42:16] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:17] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:42:17] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:42:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/168 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:17] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:42:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:18] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:42:18] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:42:18] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:42:18] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:42:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:42:18] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:18] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/168 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:42:19] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 226 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7642 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/168 variables, 72/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 95/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:42:22] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5051 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 62/62 constraints]
After SMT, in 12716ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12717ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/73 places, 96/98 transitions.
Applied a total of 0 rules in 11 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 12885 ms. Remains : 72/73 places, 96/98 transitions.
[2024-05-30 02:42:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:42:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:42:25] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-30 02:42:25] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:42:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:42:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1542378831183183811.gal : 1 ms
[2024-05-30 02:42:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15356541755061889006.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/CTLFireability1542378831183183811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15356541755061889006.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.5278,23328,2,2640,5,57370,6,0,386,140167,0
Converting to forward existential form...Done !
original formula: (EF(((!(E((p60==1) U (p10==1))) * (((p48==0)||(p49==0))||(p53==0))) * ((((p2==0)||(p6==0))||(p16==0))&&((p4==0)||(p33==0))))) * EG(EF((((...185
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((!(E((p60==1) U (p10==1))) * (((p48==0)||(p49==0))||(p53==0))) * ((((p2==0)||(p6==0))||(...240
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...520
Detected timeout of ITS tools.
[2024-05-30 02:42:55] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:42:55] [INFO ] Applying decomposition
[2024-05-30 02:42:55] [INFO ] Flatten gal took : 3 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/graph10830036405614251043.txt' '-o' '/tmp/graph10830036405614251043.bin' '-w' '/tmp/graph10830036405614251043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10830036405614251043.bin' '-l' '-1' '-v' '-w' '/tmp/graph10830036405614251043.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:42:55] [INFO ] Decomposing Gal with order
[2024-05-30 02:42:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:42:55] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:42:55] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:42:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 2 ms.
[2024-05-30 02:42:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12400977366695365707.gal : 1 ms
[2024-05-30 02:42:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1956382448424625979.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/CTLFireability12400977366695365707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1956382448424625979.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,1.04842,39824,595,29,51219,380,132,260314,33,2070,0
Converting to forward existential form...Done !
original formula: (EF(((!(E((i4.u17.p60==1) U (i0.u3.p10==1))) * (((i3.u13.p48==0)||(i3.u14.p49==0))||(i3.u15.p53==0))) * ((((i0.u0.p2==0)||(i0.u1.p6==0))|...267
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((!(E((i4.u17.p60==1) U (i0.u3.p10==1))) * (((i3.u13.p48==0)||(i3.u14.p49==0))||(i3.u15.p...322
Reverse transition relation is NOT exact ! Due to transitions t33, t37, t42, t44, t54, t57, t64, t93, i0.t86, i0.t48, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...599
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:43:25] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 02:43:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 02:43:26] [INFO ] Invariant cache hit.
[2024-05-30 02:43:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:43:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:43:26] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:43:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:43:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:43:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:43:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:43:29] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:43:30] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:43:30] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:43:30] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:43:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:43:30] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-30 02:43:31] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5765 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2860 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8647ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8648ms
Finished structural reductions in LTL mode , in 1 iterations and 8759 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:43:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:43:34] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:43:34] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:43:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:43:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:43:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2147462393541732187.gal : 0 ms
[2024-05-30 02:43:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15047975717382875020.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/CTLFireability2147462393541732187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15047975717382875020.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.52218,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: AF((((AX((p28==1)) * EX(EG((((p12==0)||(p16==0))||(p23==0))))) * ((p31==1)&&(p46==1))) * ((p57==1) * (((p14==1) + AG(E((((p54==1)&&(p56==...280
=> equivalent forward existential formula: [FwdG(Init,!((((!(EX(!((p28==1)))) * EX(EG((((p12==0)||(p16==0))||(p23==0))))) * ((p31==1)&&(p46==1))) * ((p57==...349
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:44:04] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:44:04] [INFO ] Applying decomposition
[2024-05-30 02:44:04] [INFO ] Flatten gal took : 4 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/graph10737463677044389466.txt' '-o' '/tmp/graph10737463677044389466.bin' '-w' '/tmp/graph10737463677044389466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10737463677044389466.bin' '-l' '-1' '-v' '-w' '/tmp/graph10737463677044389466.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:44:04] [INFO ] Decomposing Gal with order
[2024-05-30 02:44:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:44:04] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:44:04] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:44:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-30 02:44:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9762328695607018557.gal : 1 ms
[2024-05-30 02:44:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6862244140360111346.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/CTLFireability9762328695607018557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6862244140360111346.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.14708,42984,750,29,58291,380,123,277515,31,2350,0
Converting to forward existential form...Done !
original formula: AF((((AX((i1.u8.p28==1)) * EX(EG((((i0.u3.p12==0)||(i0.u4.p16==0))||(i1.u7.p23==0))))) * ((i2.u9.p31==1)&&(i3.u13.p46==1))) * ((i3.u16.p5...405
=> equivalent forward existential formula: [FwdG(Init,!((((!(EX(!((i1.u8.p28==1)))) * EX(EG((((i0.u3.p12==0)||(i0.u4.p16==0))||(i1.u7.p23==0))))) * ((i2.u9...474
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:44:34] [INFO ] Invariant cache hit.
[2024-05-30 02:44:34] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 02:44:34] [INFO ] Invariant cache hit.
[2024-05-30 02:44:35] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:44:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:44:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:44:36] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:44:37] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:44:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:44:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:44:37] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:44:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:44:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:44:39] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:44:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:44:39] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:44:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5766 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2941 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8729ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8731ms
Finished structural reductions in LTL mode , in 1 iterations and 8838 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:44:43] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:44:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:44:43] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:44:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:44:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8381346420094856634.gal : 1 ms
[2024-05-30 02:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13347712364903825896.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/CTLFireability8381346420094856634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13347712364903825896.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.526593,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: EF((((p12==1)&&(p14==1)) * ((p23==1) * ((AG((AF((p59==0)) * ((((p45==0)||(p60==0))||((p72==0)||(p40==0)))||((p44==0)||(p51==0))))) + AG((...388
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((p12==1)&&(p14==1))) * (p23==1)) * !(E(TRUE U !((!(EG(!((p59==0)))) * ((((p45==0)||(p60...689
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:45:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:45:13] [INFO ] Applying decomposition
[2024-05-30 02:45:13] [INFO ] Flatten gal took : 2 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/graph4327037945571408007.txt' '-o' '/tmp/graph4327037945571408007.bin' '-w' '/tmp/graph4327037945571408007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4327037945571408007.bin' '-l' '-1' '-v' '-w' '/tmp/graph4327037945571408007.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:45:13] [INFO ] Decomposing Gal with order
[2024-05-30 02:45:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:45:13] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:45:13] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:45:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 1 ms.
[2024-05-30 02:45:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5257394071931702796.gal : 1 ms
[2024-05-30 02:45:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10715217296808724834.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/CTLFireability5257394071931702796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10715217296808724834.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.11887,41136,570,29,53449,419,116,268346,31,2492,0
Converting to forward existential form...Done !
original formula: EF((((i0.u3.p12==1)&&(i0.u4.p14==1)) * ((i1.u7.p23==1) * ((AG((AF((i4.u17.p59==0)) * ((((i3.u13.p45==0)||(i4.u17.p60==0))||((i4.u20.p72==...568
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((i0.u3.p12==1)&&(i0.u4.p14==1))) * (i1.u7.p23==1)) * !(E(TRUE U !((!(EG(!((i4.u17.p59==...923
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:45:43] [INFO ] Invariant cache hit.
[2024-05-30 02:45:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 02:45:43] [INFO ] Invariant cache hit.
[2024-05-30 02:45:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:45:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:45:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:45:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:45:46] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:45:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:45:46] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:46] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:45:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:45:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:45:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:45:48] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:45:48] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:45:48] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:45:48] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:45:48] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5759 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2909 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8688ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8690ms
Finished structural reductions in LTL mode , in 1 iterations and 8793 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:45:52] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:45:52] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:45:52] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:45:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:45:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:45:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5696607849677403112.gal : 0 ms
[2024-05-30 02:45:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1411022466150066122.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/CTLFireability5696607849677403112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1411022466150066122.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.529002,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: AX((A(AF((((((p10==1)&&(p16==1))&&(p23==1))||(((p33==1)&&(p35==1))&&(p40==1)))||(((p52==1)&&(p56==1))&&(p65==1)))) U (((((EG((((p54==1)&&...533
=> equivalent forward existential formula: (((([((((FwdU((EY(Init) * !((E(TRUE U (E((((p6==1)&&(p7==1))&&(p12==1)) U (((p10==1)&&(p16==1))&&(p23==1))) + EG...3529
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:46:22] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:46:22] [INFO ] Applying decomposition
[2024-05-30 02:46:22] [INFO ] Flatten gal took : 3 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/graph713970049525635670.txt' '-o' '/tmp/graph713970049525635670.bin' '-w' '/tmp/graph713970049525635670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph713970049525635670.bin' '-l' '-1' '-v' '-w' '/tmp/graph713970049525635670.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:46:22] [INFO ] Decomposing Gal with order
[2024-05-30 02:46:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:46:22] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:46:22] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:46:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-30 02:46:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7843837690897880180.gal : 1 ms
[2024-05-30 02:46:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5765174757713209430.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/CTLFireability7843837690897880180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5765174757713209430.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.09269,40088,570,29,53377,456,116,257141,31,2731,0
Converting to forward existential form...Done !
original formula: AX((A(AF((((((i0.u3.p10==1)&&(i0.u4.p16==1))&&(i1.u7.p23==1))||(((i2.u9.p33==1)&&(i2.u10.p35==1))&&(i2.u11.p40==1)))||(((i3.u15.p52==1)&&...797
=> equivalent forward existential formula: (((([((((FwdU((EY(Init) * !((E(TRUE U (E((((i0.u1.p6==1)&&(i0.u2.p7==1))&&(i0.u3.p12==1)) U (((i0.u3.p10==1)&&(i...5198
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:46:52] [INFO ] Invariant cache hit.
[2024-05-30 02:46:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 02:46:52] [INFO ] Invariant cache hit.
[2024-05-30 02:46:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:46:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:46:53] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:46:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:46:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:46:56] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:46:57] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:46:57] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:46:57] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:46:57] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5547 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2940 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8508ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8509ms
Finished structural reductions in LTL mode , in 1 iterations and 8618 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:47:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:47:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:47:01] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:47:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:47:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:47:01] [INFO ] Time to serialize gal into /tmp/CTLFireability17237023638258697410.gal : 1 ms
[2024-05-30 02:47:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16391360790755822646.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/CTLFireability17237023638258697410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16391360790755822646.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.540865,23336,2,2700,5,58054,6,0,392,141855,0
Converting to forward existential form...Done !
original formula: ((AG(EX((((AX((p53==1)) + (((p47==1)&&(p49==1))&&(p54==1))) + (p0==0)) * A(!((((p3==1)&&(p18==1))&&(p29==1))) U E((((p17==1)&&(p32==1))&&...396
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EX((((!(EX(!((p53==1)))) + (((p47==1)&&(p49==1))&&(p54==1))) + (p0==0)) * !((E(!(E((((p1...631
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:47:31] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:47:31] [INFO ] Applying decomposition
[2024-05-30 02:47:31] [INFO ] Flatten gal took : 3 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/graph4417780125234503753.txt' '-o' '/tmp/graph4417780125234503753.bin' '-w' '/tmp/graph4417780125234503753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4417780125234503753.bin' '-l' '-1' '-v' '-w' '/tmp/graph4417780125234503753.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:47:31] [INFO ] Decomposing Gal with order
[2024-05-30 02:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:47:31] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:47:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 1 ms.
[2024-05-30 02:47:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10376074220729094269.gal : 1 ms
[2024-05-30 02:47:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5018970298563414962.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/CTLFireability10376074220729094269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5018970298563414962.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.03133,38236,553,29,51153,408,116,242256,31,2473,0
Converting to forward existential form...Done !
original formula: ((AG(EX((((AX((i3.u15.p53==1)) + (((i3.u13.p47==1)&&(i3.u14.p49==1))&&(i3.u15.p54==1))) + (i0.u2.p0==0)) * A(!((((i0.u1.p3==1)&&(i1.u5.p1...581
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EX((((!(EX(!((i3.u15.p53==1)))) + (((i3.u13.p47==1)&&(i3.u14.p49==1))&&(i3.u15.p54==1)))...866
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 02:48:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:48:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:48:01] [INFO ] Applying decomposition
[2024-05-30 02:48:01] [INFO ] Flatten gal took : 3 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/graph3129397156977431103.txt' '-o' '/tmp/graph3129397156977431103.bin' '-w' '/tmp/graph3129397156977431103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3129397156977431103.bin' '-l' '-1' '-v' '-w' '/tmp/graph3129397156977431103.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:48:01] [INFO ] Decomposing Gal with order
[2024-05-30 02:48:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:48:01] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:48:01] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:48:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 1 ms.
[2024-05-30 02:48:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12265546385618310096.gal : 1 ms
[2024-05-30 02:48:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12121754199611922818.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/CTLFireability12265546385618310096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12121754199611922818.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 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.14268,40616,570,29,53112,394,116,262176,31,2345,0
Converting to forward existential form...Done !
original formula: EG(A(((EF((((i2.u9.p34==1)&&(i2.u10.p35==1))&&(i2.u11.p39==1))) * (i0.u1.p5==1)) * ((i0.u2.p7==1)&&(i0.u3.p11==1))) U !((((i1.u5.p20==1)&...191
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!((((i1.u5.p20==1)&&(i1.u6.p21==1))&&(i1.u7.p25==1)))) U (!(((E(TRUE U (((i2.u9.p34==1)&&(i2.u...375
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1262.92,2947348,1,0,2.77693e+06,394,238,1.36947e+07,72,2345,334408
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(EG(EX((i4.u17.p59==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX((i4.u17.p59==1)))] != FALSE
(forward)formula 1,0,1423.99,2947432,1,0,3.45209e+06,394,275,1.59948e+07,78,2345,886761
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-30 03:13:46] [INFO ] Applying decomposition
[2024-05-30 03:13:46] [INFO ] Flatten gal took : 5 ms
[2024-05-30 03:13:46] [INFO ] Decomposing Gal with order
[2024-05-30 03:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:13:46] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 03:13:46] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 0 ms.
[2024-05-30 03:13:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11250198561405972636.gal : 1 ms
[2024-05-30 03:13:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6901745885541344641.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/CTLFireability11250198561405972636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6901745885541344641.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 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.422134,22588,779,28,37979,118,150,74008,29,280,0
Converting to forward existential form...Done !
original formula: A(!(AG((((u6.p19==1)&&(u7.p21==1))&&((u8.p25==1)&&(u2.p4==1))))) U (EF((((u14.p47==1)&&(u15.p49==1))&&(u16.p53==1))) + AX(E((u5.p15==1) U...204
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (((u14.p47==1)&&(u15.p49==1))&&(u16.p53==1))) + !(EX(!(E((u5.p15==1) U (((u10.p31==1)...565
Reverse transition relation is NOT exact ! Due to transitions t32, t38, t41, t47, t51, t52, t58, t61, t66, t69, t75, t78, t85, t90, t94, u2.t0, u2.t1, u4.t...491
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,92.5575,2210532,1,0,3.66426e+06,151,328,1.09795e+07,71,280,443095
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(EF((((E(((((u2.p3==1)&&(u6.p20==1))&&(u9.p29==1))||(u4.p10==1)) U !((((u2.p3==1)&&(u6.p18==1))&&(u9.p29==1)))) * (u18.p61==1)) * ((u10....429
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((E(((((u2.p3==1)&&(u6.p20==1))&&(u9.p29==1))||(u4.p10==1)) U !((((u2.p3==1)&&(u6.p18==1))...493
(forward)formula 1,1,444.528,3200528,1,0,4.53911e+06,151,337,1.71277e+07,66,280,3425548
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG((A(!((AG((((u2.p6==1)&&(u3.p7==1))&&(u4.p11==1))) + AG((((u1.p2==1)&&(u2.p4==1))&&(u5.p15==1))))) U (AX(FALSE) * EG((u22.p0==1)))) + (...180
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((!(EX(!(FALSE))) * EG((u22.p0==1)))) U (!(!((!(E(TRUE U !((((u2.p6==1)&&(u3.p7==1))&&(u4.p11=...352
(forward)formula 2,0,621.579,4011800,1,0,5.76158e+06,151,364,2.10904e+07,72,280,4059681
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG(E(!(((u11.p36==1)&&(u13.p41==1))) U (((EX(EF((((u18.p61==1)&&(u19.p63==1))&&(u20.p67==1)))) * (u4.p10==1)) * ((u5.p14==1)&&(u8.p23==1)...271
=> equivalent forward existential formula: [FwdG(Init,E(!(((u11.p36==1)&&(u13.p41==1))) U (((EX(E(TRUE U (((u18.p61==1)&&(u19.p63==1))&&(u20.p67==1)))) * (...320
(forward)formula 3,1,779.746,4509636,1,0,7.00644e+06,151,474,2.29378e+07,76,280,4706791
FORMULA ShieldRVs-PT-005A-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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="ShieldRVs-PT-005A"
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 ShieldRVs-PT-005A, 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 r356-tall-171683761800770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-005A.tgz
mv ShieldRVs-PT-005A 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 ;