About the Execution of ITS-Tools for ShieldPPPt-PT-004B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7343.619 | 3600000.00 | 3806150.00 | 7040.60 | ??????T?F????T?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761400586.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 ShieldPPPt-PT-004B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761400586
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 74K 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 ShieldPPPt-PT-004B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717004826019
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 17:47:07] [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-29 17:47:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:47:07] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-29 17:47:07] [INFO ] Transformed 315 places.
[2024-05-29 17:47:07] [INFO ] Transformed 287 transitions.
[2024-05-29 17:47:07] [INFO ] Found NUPN structural information;
[2024-05-29 17:47:07] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 137 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 266
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 266
Applied a total of 42 rules in 45 ms. Remains 294 /315 variables (removed 21) and now considering 266/287 (removed 21) transitions.
// Phase 1: matrix 266 rows 294 cols
[2024-05-29 17:47:07] [INFO ] Computed 45 invariants in 18 ms
[2024-05-29 17:47:07] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-29 17:47:07] [INFO ] Invariant cache hit.
[2024-05-29 17:47:08] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-05-29 17:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 69 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 14 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-29 17:47:11] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:47:12] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:47:13] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:47:13] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:13] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:47:13] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 4 ms to minimize.
[2024-05-29 17:47:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:47:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:47:15] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:47:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:47:15] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:16] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:47:16] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:47:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:19] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:47:19] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:47:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 266/560 variables, 294/388 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:22] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:47:23] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 2 ms to minimize.
[2024-05-29 17:47:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:25] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:47:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:47:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:47:26] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 10 ms to minimize.
[2024-05-29 17:47:32] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/560 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 397 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 58/103 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/560 variables, 294/398 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 265/663 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:47:47] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:47:47] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:47:47] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:47:47] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:47:47] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:47:47] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-29 17:47:47] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:47:48] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:47:48] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:47:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:47:49] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:47:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:47:49] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:47:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:47:50] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 16/679 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:47:53] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:47:54] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:47:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 3/682 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-29 17:48:07] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 2 ms to minimize.
[2024-05-29 17:48:07] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:48:07] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 685 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 81/81 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 294/315 places, 266/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60769 ms. Remains : 294/315 places, 266/287 transitions.
Support contains 137 out of 294 places after structural reductions.
[2024-05-29 17:48:08] [INFO ] Flatten gal took : 41 ms
[2024-05-29 17:48:08] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:48:08] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (8 resets) in 1972 ms. (20 steps per ms) remains 3/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
[2024-05-29 17:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/134 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:09] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2024-05-29 17:48:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 160/294 variables, 29/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:09] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-29 17:48:09] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:48:09] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:48:09] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 266/560 variables, 294/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/560 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/134 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 160/294 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 266/560 variables, 294/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/560 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:10] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/560 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 1677ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 326 ms.
Support contains 10 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 266/266 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 294 transition count 213
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 241 transition count 211
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 240 transition count 208
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 237 transition count 208
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 115 place count 237 transition count 186
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 159 place count 215 transition count 186
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 173 place count 201 transition count 172
Iterating global reduction 4 with 14 rules applied. Total rules applied 187 place count 201 transition count 172
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 187 place count 201 transition count 163
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 205 place count 192 transition count 163
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 333 place count 128 transition count 99
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 351 place count 119 transition count 99
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 362 place count 119 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 363 place count 118 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 364 place count 117 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 364 place count 117 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 368 place count 115 transition count 96
Applied a total of 368 rules in 51 ms. Remains 115 /294 variables (removed 179) and now considering 96/266 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 115/294 places, 96/266 transitions.
RANDOM walk for 40000 steps (8 resets) in 1264 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 532327 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 2
Probabilistic random walk after 532327 steps, saw 332809 distinct states, run finished after 3004 ms. (steps per millisecond=177 ) properties seen :0
// Phase 1: matrix 96 rows 115 cols
[2024-05-29 17:48:14] [INFO ] Computed 44 invariants in 1 ms
[2024-05-29 17:48:14] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/74 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:48:14] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 78/152 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/192 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/193 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/195 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/195 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/209 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/209 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/209 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/209 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/210 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/211 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/211 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/211 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/211 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 115/115 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 21/74 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 78/152 variables, 74/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 40/192 variables, 28/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/193 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/193 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/193 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/195 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/195 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 14/209 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/209 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/209 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/209 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/210 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/210 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/210 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/211 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/211 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/211 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:15] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/211 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/211 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 0/211 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 186 constraints, problems are : Problem set: 0 solved, 2 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 115/115 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 855ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 115/115 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-29 17:48:15] [INFO ] Invariant cache hit.
[2024-05-29 17:48:15] [INFO ] Implicit Places using invariants in 74 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/115 places, 96/96 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 94
Applied a total of 4 rules in 5 ms. Remains 111 /113 variables (removed 2) and now considering 94/96 (removed 2) transitions.
// Phase 1: matrix 94 rows 111 cols
[2024-05-29 17:48:15] [INFO ] Computed 42 invariants in 1 ms
[2024-05-29 17:48:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 17:48:15] [INFO ] Invariant cache hit.
[2024-05-29 17:48:15] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 17:48:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/115 places, 94/96 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 248 ms. Remains : 111/115 places, 94/96 transitions.
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 517505 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 517505 steps, saw 325617 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-29 17:48:19] [INFO ] Invariant cache hit.
[2024-05-29 17:48:19] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/74 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 77/151 variables, 74/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 38/189 variables, 26/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 11/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/190 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/192 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 13/205 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/205 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/205 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/205 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/74 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 77/151 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 38/189 variables, 26/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 11/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/189 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/190 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/190 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/190 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/192 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/192 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/192 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 13/205 variables, 10/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/205 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/205 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 17:48:19] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/205 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/205 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/205 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 140 ms.
Support contains 10 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 111/111 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-29 17:48:20] [INFO ] Invariant cache hit.
[2024-05-29 17:48:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 17:48:20] [INFO ] Invariant cache hit.
[2024-05-29 17:48:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 17:48:20] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-29 17:48:20] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-29 17:48:20] [INFO ] Invariant cache hit.
[2024-05-29 17:48:20] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 17:48:20] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:48:20] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 5/111 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:48:21] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 94/205 variables, 111/170 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 13/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 183 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3160 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 5/111 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 94/205 variables, 111/170 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 13/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 88/271 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 17:48:24] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 272 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3033 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 18/18 constraints]
After SMT, in 6208ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6400 ms. Remains : 111/111 places, 94/94 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 111 transition count 94
Applied a total of 18 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 111 cols
[2024-05-29 17:48:26] [INFO ] Computed 42 invariants in 1 ms
[2024-05-29 17:48:26] [INFO ] [Real]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-05-29 17:48:26] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:48:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-05-29 17:48:26] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:48:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-29 17:48:26] [INFO ] After 15ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 141 ms
TRAPS : Iteration 1
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 2
[2024-05-29 17:48:26] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:48:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-29 17:48:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:48:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:48:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
TRAPS : Iteration 3
[2024-05-29 17:48:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 4
[2024-05-29 17:48:27] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 5
[2024-05-29 17:48:27] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-29 17:48:27] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 732 ms.
[2024-05-29 17:48:27] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:48:27] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:48:27] [INFO ] Input system was already deterministic with 266 transitions.
Computed a total of 71 stabilizing places and 71 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 273 transition count 245
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 273 transition count 245
Applied a total of 42 rules in 7 ms. Remains 273 /294 variables (removed 21) and now considering 245/266 (removed 21) transitions.
// Phase 1: matrix 245 rows 273 cols
[2024-05-29 17:48:27] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 17:48:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 17:48:27] [INFO ] Invariant cache hit.
[2024-05-29 17:48:27] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2024-05-29 17:48:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:48:29] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:48:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:48:31] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:48:32] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 245/518 variables, 273/348 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:48:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:48:35] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:48:35] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:48:35] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:48:38] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:48:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (OVERLAPS) 0/518 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 354 constraints, problems are : Problem set: 0 solved, 244 unsolved in 19044 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 245/518 variables, 273/354 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 244/598 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:48:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:48:50] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:48:51] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:48:51] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 17:48:51] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-29 17:48:51] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:48:52] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-29 17:48:52] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:48:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 9/607 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:48:55] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-29 17:48:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:48:56] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:48:57] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:49:00] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-29 17:49:10] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-29 17:49:11] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/518 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/518 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 614 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 52/52 constraints]
After SMT, in 49092ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 49095ms
Starting structural reductions in LTL mode, iteration 1 : 273/294 places, 245/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49344 ms. Remains : 273/294 places, 245/266 transitions.
[2024-05-29 17:49:16] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:49:16] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:49:16] [INFO ] Input system was already deterministic with 245 transitions.
[2024-05-29 17:49:16] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:49:16] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:49:16] [INFO ] Time to serialize gal into /tmp/CTLFireability266115187720377563.gal : 5 ms
[2024-05-29 17:49:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17942945746096907581.ctl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability266115187720377563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17942945746096907581.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.0145e+26,21.8129,579168,2,24184,5,1.75768e+06,6,0,1339,4.14656e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 17:49:46] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:49:46] [INFO ] Applying decomposition
[2024-05-29 17:49:46] [INFO ] Flatten gal took : 9 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/graph13723618539631263582.txt' '-o' '/tmp/graph13723618539631263582.bin' '-w' '/tmp/graph13723618539631263582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13723618539631263582.bin' '-l' '-1' '-v' '-w' '/tmp/graph13723618539631263582.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:49:47] [INFO ] Decomposing Gal with order
[2024-05-29 17:49:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:49:47] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-29 17:49:47] [INFO ] Flatten gal took : 116 ms
[2024-05-29 17:49:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-29 17:49:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1321837527660763607.gal : 20 ms
[2024-05-29 17:49:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7274288203279354586.ctl : 7 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/CTLFireability1321837527660763607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7274288203279354586.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.0145e+26,1.40136,44488,1483,31,75740,494,558,174284,49,1469,0
Converting to forward existential form...Done !
original formula: E(A(EG(E(((i15.i1.u89.p290==1)&&(i14.u86.p273==1)) U ((i1.u12.p45==1)||((i3.i1.u6.p18==1)&&(i3.i2.u16.p54==1))))) U (!(EF((i3.i0.u4.p14==...404
=> equivalent forward existential formula: [(EY((FwdU(Init,!((E(!((!(E(TRUE U (i3.i0.u4.p14==1))) + (E(((i1.u12.p45==1)&&(i9.i0.u51.p165==1)) U EG((i14.u87...817
Reverse transition relation is NOT exact ! Due to transitions t50, t56, t96, t99, t142, t145, t188, t191, t224, t228, t237, t242, i0.i0.u1.t198, i0.i1.u8.t...997
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 271 transition count 243
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 269 transition count 241
Applied a total of 50 rules in 25 ms. Remains 269 /294 variables (removed 25) and now considering 241/266 (removed 25) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 17:50:17] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 17:50:17] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-29 17:50:17] [INFO ] Invariant cache hit.
[2024-05-29 17:50:17] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 17:50:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:50:20] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:50:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:22] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:50:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:50:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:50:22] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:50:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 17:50:23] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:50:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:50:29] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:50:30] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17395 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:39] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 4 ms to minimize.
[2024-05-29 17:50:39] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-29 17:50:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:50:39] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:50:39] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-29 17:50:39] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:50:39] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-29 17:50:40] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-29 17:50:41] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:50:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:48] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:50:49] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 19 ms to minimize.
[2024-05-29 17:50:50] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:50:54] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47486ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47488ms
Starting structural reductions in LTL mode, iteration 1 : 269/294 places, 241/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48011 ms. Remains : 269/294 places, 241/266 transitions.
[2024-05-29 17:51:05] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:51:05] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:51:05] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-29 17:51:05] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:51:05] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:51:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9498595244201197651.gal : 2 ms
[2024-05-29 17:51:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14812892860393987234.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/CTLFireability9498595244201197651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14812892860393987234.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,8.05333e+25,21.1464,564720,2,23815,5,1.71302e+06,6,0,1319,4.04661e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 17:51:35] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:51:35] [INFO ] Applying decomposition
[2024-05-29 17:51:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12434958130230416709.txt' '-o' '/tmp/graph12434958130230416709.bin' '-w' '/tmp/graph12434958130230416709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12434958130230416709.bin' '-l' '-1' '-v' '-w' '/tmp/graph12434958130230416709.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:51:35] [INFO ] Decomposing Gal with order
[2024-05-29 17:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:51:35] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-29 17:51:35] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 17:51:35] [INFO ] Time to serialize gal into /tmp/CTLFireability5077199796648502845.gal : 4 ms
[2024-05-29 17:51:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10419471431218704979.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/CTLFireability5077199796648502845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10419471431218704979.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,8.05333e+25,1.53109,49504,1519,29,87123,427,540,177068,45,1137,0
Converting to forward existential form...Done !
original formula: EX(A((AX(!(EG(((i16.i0.u80.p254==1)&&(i15.u93.p301==1))))) + ((AG(((i1.i1.u7.p22==1)&&(i1.i1.u7.p24==1))) * AX((i6.i2.u50.p156==1))) * ((...219
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((i1.i0.u6.p16==1))))) * !(E(!((i1.i0.u6.p16==1)) U (!((!(EX(!(!(EG(((i16.i0.u80.p254==1)&&(...354
Reverse transition relation is NOT exact ! Due to transitions t46, t52, t92, t95, t138, t141, t184, t187, t220, t224, t233, i0.i0.u2.t194, i0.i1.u9.t189, i...947
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 277 transition count 249
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 277 transition count 249
Applied a total of 34 rules in 5 ms. Remains 277 /294 variables (removed 17) and now considering 249/266 (removed 17) transitions.
// Phase 1: matrix 249 rows 277 cols
[2024-05-29 17:52:05] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 17:52:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 17:52:05] [INFO ] Invariant cache hit.
[2024-05-29 17:52:06] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-29 17:52:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 4 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:52:08] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:09] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:52:10] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 249/526 variables, 277/355 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:14] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:52:14] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:19] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:52:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:52:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:52:20] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/526 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/526 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:26] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:52:26] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:28] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 14 (OVERLAPS) 0/526 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 365 constraints, problems are : Problem set: 0 solved, 248 unsolved in 28479 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/526 variables, 277/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 248/613 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-29 17:52:38] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:52:39] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:52:40] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 7/620 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 17:52:43] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 17:52:45] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/526 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 624 constraints, problems are : Problem set: 0 solved, 248 unsolved in 24757 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 54/54 constraints]
After SMT, in 53257ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 53261ms
Starting structural reductions in LTL mode, iteration 1 : 277/294 places, 249/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53536 ms. Remains : 277/294 places, 249/266 transitions.
[2024-05-29 17:52:59] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:52:59] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:52:59] [INFO ] Input system was already deterministic with 249 transitions.
[2024-05-29 17:52:59] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:52:59] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13034696261611981261.gal : 1 ms
[2024-05-29 17:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15117246479565752256.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13034696261611981261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15117246479565752256.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 17:53:29] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:53:29] [INFO ] Applying decomposition
[2024-05-29 17:53:29] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph764256332635188056.txt' '-o' '/tmp/graph764256332635188056.bin' '-w' '/tmp/graph764256332635188056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph764256332635188056.bin' '-l' '-1' '-v' '-w' '/tmp/graph764256332635188056.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:53:29] [INFO ] Decomposing Gal with order
[2024-05-29 17:53:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:53:29] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-29 17:53:29] [INFO ] Flatten gal took : 13 ms
[2024-05-29 17:53:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:53:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5301821937491264441.gal : 3 ms
[2024-05-29 17:53:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15491540933947629050.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/CTLFireability5301821937491264441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15491540933947629050.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.66661e+26,3.89285,118488,3235,32,213141,510,603,538889,55,1363,0
Converting to forward existential form...Done !
original formula: A((!(((((((i10.u53.p173==1)&&(i6.u37.p121==1)) + AG(AF((i12.u61.p199==1)))) * EF(EG((i12.u62.p194==1)))) * ((i2.i1.i1.u19.p60!=1) * AF((i...509
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((E(!(!(!(E(TRUE U !(((i0.u10.p28==1)&&(i3.u14.p48==1))))))) U (!((E((i1.u25.p81==1) U (i14...1850
Reverse transition relation is NOT exact ! Due to transitions t53, t99, t102, t145, t148, t195, t228, t234, t237, t240, t241, i0.u2.t202, i0.u9.t197, i1.t1...1002
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
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 14 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 17:53:59] [INFO ] Computed 45 invariants in 5 ms
[2024-05-29 17:53:59] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 17:53:59] [INFO ] Invariant cache hit.
[2024-05-29 17:53:59] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 17:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:54:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:54:02] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:54:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:54:03] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:54:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:03] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:54:03] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:54:04] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:54:04] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:54:04] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:54:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:54:04] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:54:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:05] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 242/512 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:54:12] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:13] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:54:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 350 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22889 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 35/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/591 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:26] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:54:27] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:54:27] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-29 17:54:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:54:27] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-29 17:54:28] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-29 17:54:28] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-29 17:54:29] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-29 17:54:29] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-29 17:54:29] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:54:29] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-29 17:54:29] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:54:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 13/604 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:32] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-29 17:54:33] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:54:33] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-29 17:54:34] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:54:37] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/512 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 609 constraints, problems are : Problem set: 0 solved, 241 unsolved in 29475 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 53/53 constraints]
After SMT, in 52389ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 52393ms
Starting structural reductions in LTL mode, iteration 1 : 270/294 places, 242/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52647 ms. Remains : 270/294 places, 242/266 transitions.
[2024-05-29 17:54:52] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:54:52] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:54:52] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-29 17:54:52] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:54:52] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18090683028818566603.gal : 1 ms
[2024-05-29 17:54:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1734425007791077153.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/CTLFireability18090683028818566603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1734425007791077153.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,8.05333e+25,21.5877,569352,2,24171,5,1.72677e+06,6,0,1324,4.0862e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 17:55:22] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:55:22] [INFO ] Applying decomposition
[2024-05-29 17:55:22] [INFO ] Flatten gal took : 9 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/graph11133926179891944897.txt' '-o' '/tmp/graph11133926179891944897.bin' '-w' '/tmp/graph11133926179891944897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11133926179891944897.bin' '-l' '-1' '-v' '-w' '/tmp/graph11133926179891944897.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:55:22] [INFO ] Decomposing Gal with order
[2024-05-29 17:55:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:55:22] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-29 17:55:22] [INFO ] Flatten gal took : 17 ms
[2024-05-29 17:55:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:55:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2726169413707894735.gal : 3 ms
[2024-05-29 17:55:22] [INFO ] Time to serialize properties into /tmp/CTLFireability821659977314825357.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/CTLFireability2726169413707894735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability821659977314825357.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,8.05333e+25,1.85003,52684,1477,30,95954,401,552,180831,48,1078,0
Converting to forward existential form...Done !
original formula: AF((((i14.i2.u89.p282==1)&&(i12.u71.p225==1)) * (EX(EF(((i9.i0.u59.p190==1)&&(i9.i0.u59.p192==1)))) + EF((i11.i0.u0.p1==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((((i14.i2.u89.p282==1)&&(i12.u71.p225==1)) * (EX(E(TRUE U ((i9.i0.u59.p190==1)&&(i9.i0.u59.p192==1)...201
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t93, t96, t139, t142, t185, t188, t216, t230, t234, i0.t191, i0.i0.u7.t194, i0.i1.u...965
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 276 transition count 248
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 276 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 275 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 275 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 274 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 274 transition count 246
Applied a total of 40 rules in 12 ms. Remains 274 /294 variables (removed 20) and now considering 246/266 (removed 20) transitions.
// Phase 1: matrix 246 rows 274 cols
[2024-05-29 17:55:52] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 17:55:52] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 17:55:52] [INFO ] Invariant cache hit.
[2024-05-29 17:55:52] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-05-29 17:55:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:55:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:55:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:55:56] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:55:57] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:55:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:55:59] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:55:59] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:55:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 246/520 variables, 274/354 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:04] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:06] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:56:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/520 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 14 (OVERLAPS) 0/520 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 360 constraints, problems are : Problem set: 0 solved, 245 unsolved in 27563 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 41/86 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/520 variables, 274/360 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 245/605 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-29 17:56:25] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:56:26] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:56:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 11/616 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:31] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:56:31] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:56:32] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:56:32] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 4/620 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-29 17:56:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 622 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 58/58 constraints]
After SMT, in 57601ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 57603ms
Starting structural reductions in LTL mode, iteration 1 : 274/294 places, 246/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57876 ms. Remains : 274/294 places, 246/266 transitions.
[2024-05-29 17:56:50] [INFO ] Flatten gal took : 13 ms
[2024-05-29 17:56:50] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:56:50] [INFO ] Input system was already deterministic with 246 transitions.
[2024-05-29 17:56:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:56:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:56:50] [INFO ] Time to serialize gal into /tmp/CTLFireability10941136994126355005.gal : 1 ms
[2024-05-29 17:56:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5616216351251131146.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/CTLFireability10941136994126355005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5616216351251131146.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.03357e+26,25.2297,679412,2,26553,5,2.04397e+06,6,0,1344,4.90035e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 17:57:20] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:57:20] [INFO ] Applying decomposition
[2024-05-29 17:57:20] [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/graph7918852015298236259.txt' '-o' '/tmp/graph7918852015298236259.bin' '-w' '/tmp/graph7918852015298236259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7918852015298236259.bin' '-l' '-1' '-v' '-w' '/tmp/graph7918852015298236259.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:57:20] [INFO ] Decomposing Gal with order
[2024-05-29 17:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:57:20] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-29 17:57:20] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:57:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:57:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5801826411966671089.gal : 2 ms
[2024-05-29 17:57:20] [INFO ] Time to serialize properties into /tmp/CTLFireability17936764859600389254.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/CTLFireability5801826411966671089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17936764859600389254.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.03357e+26,2.06385,66940,2066,51,122745,460,594,319581,64,1222,0
Converting to forward existential form...Done !
original formula: (AF((((((AF((i4.u22.p67==0)) + (((i6.i2.u28.p79==1)&&(i8.i0.u37.p104==0))&&(i7.i2.u46.p137==0))) + ((i16.i0.u82.p253==1)&&(i16.i0.u82.p25...637
=> equivalent forward existential formula: [FwdG((Init * !(E(E(TRUE U (((i11.i0.u57.p176==1)&&(i11.i0.u57.p178==1)) * (!(EX(!((i16.i0.u81.p247==1)))) + (EG...715
Reverse transition relation is NOT exact ! Due to transitions t47, t50, t101, t141, t144, t189, t192, t229, t238, i0.i0.u86.t49, i0.i1.t25, i0.i1.u95.t29, ...1042
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 293 transition count 212
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 240 transition count 210
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 239 transition count 205
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 119 place count 234 transition count 205
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 119 place count 234 transition count 184
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 161 place count 213 transition count 184
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 177 place count 197 transition count 168
Iterating global reduction 4 with 16 rules applied. Total rules applied 193 place count 197 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 193 place count 197 transition count 158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 213 place count 187 transition count 158
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 321 place count 133 transition count 104
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 133 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 324 place count 131 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 130 transition count 102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 325 place count 130 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 329 place count 128 transition count 100
Applied a total of 329 rules in 41 ms. Remains 128 /294 variables (removed 166) and now considering 100/266 (removed 166) transitions.
// Phase 1: matrix 100 rows 128 cols
[2024-05-29 17:57:50] [INFO ] Computed 44 invariants in 2 ms
[2024-05-29 17:57:50] [INFO ] Implicit Places using invariants in 67 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 126/294 places, 100/266 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 98
Applied a total of 4 rules in 4 ms. Remains 124 /126 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 124 cols
[2024-05-29 17:57:50] [INFO ] Computed 42 invariants in 1 ms
[2024-05-29 17:57:50] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 17:57:50] [INFO ] Invariant cache hit.
[2024-05-29 17:57:50] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 124/294 places, 98/266 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 267 ms. Remains : 124/294 places, 98/266 transitions.
[2024-05-29 17:57:50] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:57:50] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:57:50] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-29 17:57:50] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:57:50] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:57:50] [INFO ] Time to serialize gal into /tmp/CTLFireability97835065098658692.gal : 0 ms
[2024-05-29 17:57:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5826271956172738114.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/CTLFireability97835065098658692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5826271956172738114.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 -...281
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,3.1716e+17,1.20408,39904,2,728,5,144709,6,0,595,257788,0
Converting to forward existential form...Done !
original formula: (EF(((((((p183==1)&&(p185==1))||(p293==1)) * EG((p39==0))) + (((p30==0)||(p82==0))&&(p198==1))) + ((p21==1)&&(p48==1)))) * !(A(((A(((p124...267
=> equivalent forward existential formula: (([(FwdU((FwdU((((FwdU((Init * E(TRUE U ((((((p183==1)&&(p185==1))||(p293==1)) * EG((p39==0))) + (((p30==0)||(p8...856
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t8, t9, t14, t15, t36, t38, t42, t44, t50, t55, t59, t60, t65, t6...296
Detected timeout of ITS tools.
[2024-05-29 17:58:20] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:58:20] [INFO ] Applying decomposition
[2024-05-29 17:58:20] [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/graph4782538251580342582.txt' '-o' '/tmp/graph4782538251580342582.bin' '-w' '/tmp/graph4782538251580342582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4782538251580342582.bin' '-l' '-1' '-v' '-w' '/tmp/graph4782538251580342582.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:58:20] [INFO ] Decomposing Gal with order
[2024-05-29 17:58:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:58:20] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-29 17:58:20] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:58:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 17:58:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11731480454034331955.gal : 1 ms
[2024-05-29 17:58:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9830073145286555798.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/CTLFireability11731480454034331955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9830073145286555798.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,3.1716e+17,0.21875,12640,272,67,17628,309,350,42523,80,1618,0
Converting to forward existential form...Done !
original formula: (EF(((((((i10.u22.p183==1)&&(i10.u22.p185==1))||(i12.u35.p293==1)) * EG((i1.u7.p39==0))) + (((i2.i0.u5.p30==0)||(i3.u10.p82==0))&&(i8.u24...387
=> equivalent forward existential formula: (([(FwdU((FwdU((((FwdU((Init * E(TRUE U ((((((i10.u22.p183==1)&&(i10.u22.p185==1))||(i12.u35.p293==1)) * EG((i1....1166
Reverse transition relation is NOT exact ! Due to transitions t77, t84, i0.u1.t95, i1.u2.t0, i1.u7.t36, i1.u7.t60, i2.i0.u4.t1, i2.i1.u9.t42, i3.u6.t2, i3....486
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 15 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 17:58:51] [INFO ] Computed 45 invariants in 6 ms
[2024-05-29 17:58:51] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 17:58:51] [INFO ] Invariant cache hit.
[2024-05-29 17:58:51] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 17:58:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-29 17:58:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:58:54] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:58:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:58:56] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:58:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:58:57] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:58:58] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/512 variables, 270/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 350 constraints, problems are : Problem set: 0 solved, 241 unsolved in 15598 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 35/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/591 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:59:10] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:59:10] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-29 17:59:10] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 17:59:10] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:59:11] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:59:11] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:59:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:59:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:59:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:59:11] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:59:11] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:59:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:59:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-29 17:59:12] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:59:12] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:59:13] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 16/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:59:15] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-29 17:59:16] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:59:17] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:59:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:59:26] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 17:59:36] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 613 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 57/57 constraints]
After SMT, in 45635ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 45638ms
Starting structural reductions in LTL mode, iteration 1 : 270/294 places, 242/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45919 ms. Remains : 270/294 places, 242/266 transitions.
[2024-05-29 17:59:36] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:59:36] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:59:36] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-29 17:59:36] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:59:37] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:59:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17426830863048713465.gal : 1 ms
[2024-05-29 17:59:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10326286004726041668.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/CTLFireability17426830863048713465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10326286004726041668.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,9.12446e+25,28.1838,735936,2,26940,5,2.17226e+06,6,0,1324,5.31492e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:00:07] [INFO ] Applying decomposition
[2024-05-29 18:00:07] [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/graph6600373153984654226.txt' '-o' '/tmp/graph6600373153984654226.bin' '-w' '/tmp/graph6600373153984654226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6600373153984654226.bin' '-l' '-1' '-v' '-w' '/tmp/graph6600373153984654226.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:00:07] [INFO ] Decomposing Gal with order
[2024-05-29 18:00:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:00:07] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-29 18:00:07] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:00:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:00:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13810665627107624608.gal : 2 ms
[2024-05-29 18:00:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17086727224722771579.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/CTLFireability13810665627107624608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17086727224722771579.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,9.12446e+25,4.76543,129032,2952,29,221065,369,629,796208,52,879,0
Converting to forward existential form...Done !
original formula: AX((AG(EF(((i10.u59.p187==0)&&(i12.u65.p209==0)))) + (i5.u46.p146==1)))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !((i5.u46.p146==1))),TRUE) * !(E(TRUE U ((i10.u59.p187==0)&&(i12.u65.p209==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t92, t95, t139, t185, t188, t216, t221, t227, t232, t239, i0.i0.i0.u57.t97, i0.i0.i...916
(forward)formula 0,1,8.58527,163088,1,0,276577,369,3442,1.0479e+06,283,1105,284874
FORMULA ShieldPPPt-PT-004B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 15 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 18:00:15] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 18:00:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 18:00:15] [INFO ] Invariant cache hit.
[2024-05-29 18:00:16] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:00:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:00:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:00:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:00:19] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:00:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:00:19] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:00:19] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:00:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:00:19] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:00:20] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:00:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:28] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:33] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:00:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 351 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23650 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:41] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/352 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 241/593 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:00:46] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:00:46] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:00:46] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 10/603 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:00:54] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:01:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:01:00] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:01:01] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 3/612 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:01:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:01:06] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 614 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 58/58 constraints]
After SMT, in 53686ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 53689ms
Starting structural reductions in LTL mode, iteration 1 : 270/294 places, 242/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53995 ms. Remains : 270/294 places, 242/266 transitions.
[2024-05-29 18:01:09] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:01:09] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:01:09] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-29 18:01:09] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:01:09] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:01:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8548302682001733929.gal : 1 ms
[2024-05-29 18:01:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14069078585394057430.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/CTLFireability8548302682001733929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14069078585394057430.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,9.20378e+25,25.8711,702816,2,26190,5,2.10099e+06,6,0,1324,5.07488e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:01:39] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:01:39] [INFO ] Applying decomposition
[2024-05-29 18:01:39] [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/graph3761565639678002735.txt' '-o' '/tmp/graph3761565639678002735.bin' '-w' '/tmp/graph3761565639678002735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3761565639678002735.bin' '-l' '-1' '-v' '-w' '/tmp/graph3761565639678002735.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:01:39] [INFO ] Decomposing Gal with order
[2024-05-29 18:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:01:39] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-29 18:01:39] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:01:39] [INFO ] Time to serialize gal into /tmp/CTLFireability950991550593088093.gal : 3 ms
[2024-05-29 18:01:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5733428887664009788.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/CTLFireability950991550593088093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5733428887664009788.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,9.20378e+25,2.07918,58216,1617,64,101462,1178,575,208629,64,3311,0
Converting to forward existential form...Done !
original formula: EF((EG(EX(!(E((i7.i1.u32.p96==1) U ((i6.i1.u37.p112==1)&&(i6.i2.u49.p159==1)))))) + ((i3.i2.u17.p51==0)&&((((i12.u62.p199==1)&&(i14.i0.u7...307
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),EX(!(E((i7.i1.u32.p96==1) U ((i6.i1.u37.p112==1)&&(i6.i2.u49.p159==1))))))] != FALSE + [(...388
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t93, t96, t139, t142, t185, t188, t221, t225, t234, i0.i0.u2.t195, i0.i1.u10.t190, ...978
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 18 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 18:02:09] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 18:02:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 18:02:10] [INFO ] Invariant cache hit.
[2024-05-29 18:02:10] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:02:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:02:12] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:02:13] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:02:14] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/343 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:20] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:02:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:24] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:02:24] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:02:24] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:02:27] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 352 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23326 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:34] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/512 variables, 270/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 241/594 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:02:38] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:02:39] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:02:39] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:02:39] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:02:39] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:02:40] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:02:40] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 9/603 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:02:43] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:02:44] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/512 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 605 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23194 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 49/49 constraints]
After SMT, in 46541ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 46547ms
Starting structural reductions in LTL mode, iteration 1 : 270/294 places, 242/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46820 ms. Remains : 270/294 places, 242/266 transitions.
[2024-05-29 18:02:56] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:02:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:02:56] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-29 18:02:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:02:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:02:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2375096325584590023.gal : 1 ms
[2024-05-29 18:02:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15679730829515458123.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/CTLFireability2375096325584590023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15679730829515458123.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,8.17306e+25,21.9381,582320,2,24355,5,1.76653e+06,6,0,1324,4.16569e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:03:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:03:26] [INFO ] Applying decomposition
[2024-05-29 18:03:26] [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/graph10773546281748724875.txt' '-o' '/tmp/graph10773546281748724875.bin' '-w' '/tmp/graph10773546281748724875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10773546281748724875.bin' '-l' '-1' '-v' '-w' '/tmp/graph10773546281748724875.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:03:26] [INFO ] Decomposing Gal with order
[2024-05-29 18:03:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:03:26] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-29 18:03:26] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:03:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:03:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2398272432898602437.gal : 3 ms
[2024-05-29 18:03:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11839584109594346608.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/CTLFireability2398272432898602437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11839584109594346608.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,8.17306e+25,1.43121,46864,1621,29,84772,371,549,170953,45,938,0
Converting to forward existential form...Done !
original formula: AG(EX(EF((i13.i1.u67.p213==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U (i13.i1.u67.p213==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t93, t99, t139, t142, t185, t188, t216, t221, t225, t230, t234, i0.t19, i0.u95.t15,...959
(forward)formula 0,0,2.81391,75376,1,0,148453,371,3142,285195,264,957,199389
FORMULA ShieldPPPt-PT-004B-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 293 transition count 206
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 234 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 233 transition count 204
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 121 place count 233 transition count 179
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 171 place count 208 transition count 179
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 189 place count 190 transition count 161
Iterating global reduction 3 with 18 rules applied. Total rules applied 207 place count 190 transition count 161
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 207 place count 190 transition count 148
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 233 place count 177 transition count 148
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 347 place count 120 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 349 place count 118 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 117 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 350 place count 117 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 354 place count 115 transition count 87
Applied a total of 354 rules in 28 ms. Remains 115 /294 variables (removed 179) and now considering 87/266 (removed 179) transitions.
// Phase 1: matrix 87 rows 115 cols
[2024-05-29 18:03:29] [INFO ] Computed 44 invariants in 4 ms
[2024-05-29 18:03:29] [INFO ] Implicit Places using invariants in 72 ms returned [95, 99]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 113/294 places, 87/266 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 85
Applied a total of 4 rules in 4 ms. Remains 111 /113 variables (removed 2) and now considering 85/87 (removed 2) transitions.
// Phase 1: matrix 85 rows 111 cols
[2024-05-29 18:03:29] [INFO ] Computed 42 invariants in 0 ms
[2024-05-29 18:03:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 18:03:29] [INFO ] Invariant cache hit.
[2024-05-29 18:03:29] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 111/294 places, 85/266 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 255 ms. Remains : 111/294 places, 85/266 transitions.
[2024-05-29 18:03:29] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:03:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:03:30] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-29 18:03:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:03:30] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7413743412800592891.gal : 0 ms
[2024-05-29 18:03:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9813637514112113384.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/CTLFireability7413743412800592891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9813637514112113384.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.72207e+16,0.233441,13280,2,497,5,39590,6,0,531,67716,0
Converting to forward existential form...Done !
original formula: AF(AG((EG(AF((p26==0))) * (p227==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((EG(!(EG(!((p26==0))))) * (p227==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t7, t8, t9, t10, t24, t26, t30, t32, t33, t36, t44, t48, t50, t53, t5...271
Detected timeout of ITS tools.
[2024-05-29 18:04:00] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:04:00] [INFO ] Applying decomposition
[2024-05-29 18:04:00] [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/graph7909775707209412699.txt' '-o' '/tmp/graph7909775707209412699.bin' '-w' '/tmp/graph7909775707209412699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7909775707209412699.bin' '-l' '-1' '-v' '-w' '/tmp/graph7909775707209412699.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:04:00] [INFO ] Decomposing Gal with order
[2024-05-29 18:04:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:04:00] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-29 18:04:00] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:04:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10636158651011407766.gal : 1 ms
[2024-05-29 18:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1131718505674321419.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/CTLFireability10636158651011407766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1131718505674321419.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.72207e+16,0.073118,6944,161,52,6389,265,238,13782,51,1472,0
Converting to forward existential form...Done !
original formula: AF(AG((EG(AF((i1.u3.p26==0))) * (i6.u24.p227==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((EG(!(EG(!((i1.u3.p26==0))))) * (i6.u24.p227==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t84, i0.u2.t0, i0.u6.t24, i1.u3.t10, i1.u8.t48, i2.u5.t44, i2.u11.t4, i3.u7.t26, i4...413
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 271 transition count 243
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 269 transition count 241
Applied a total of 50 rules in 19 ms. Remains 269 /294 variables (removed 25) and now considering 241/266 (removed 25) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 18:04:30] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:04:30] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 18:04:30] [INFO ] Invariant cache hit.
[2024-05-29 18:04:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-29 18:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:04:32] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:04:33] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:04:34] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/510 variables, 269/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:04:37] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:04:38] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:04:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:04:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:04:42] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/510 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 345 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17038 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/510 variables, 269/345 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 240/585 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:04:52] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:04:52] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:04:52] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:04:53] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:04:53] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:04:53] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:04:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:05:00] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:05:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:05:02] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 0/510 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 606 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints]
After SMT, in 47072ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 47074ms
Starting structural reductions in LTL mode, iteration 1 : 269/294 places, 241/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47341 ms. Remains : 269/294 places, 241/266 transitions.
[2024-05-29 18:05:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:05:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:05:17] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-29 18:05:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:05:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:05:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18400868489928129599.gal : 1 ms
[2024-05-29 18:05:17] [INFO ] Time to serialize properties into /tmp/CTLFireability13072156714169438657.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/CTLFireability18400868489928129599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13072156714169438657.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,8.05333e+25,22.2563,565556,2,23815,5,1.71302e+06,6,0,1319,4.04661e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:05:47] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:05:47] [INFO ] Applying decomposition
[2024-05-29 18:05:47] [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/graph11768487758682912565.txt' '-o' '/tmp/graph11768487758682912565.bin' '-w' '/tmp/graph11768487758682912565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11768487758682912565.bin' '-l' '-1' '-v' '-w' '/tmp/graph11768487758682912565.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:05:47] [INFO ] Decomposing Gal with order
[2024-05-29 18:05:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:05:47] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-29 18:05:47] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:05:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15463519937671265010.gal : 2 ms
[2024-05-29 18:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9582390842255907289.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/CTLFireability15463519937671265010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9582390842255907289.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,8.05333e+25,2.5879,68488,1619,54,120350,988,549,269586,59,3626,0
Converting to forward existential form...Done !
original formula: AF(AX((EG(((i7.i1.u48.p156==0)||(i12.i0.u51.p164==1))) * ((i5.i0.u30.p94==0)||(i5.i2.u43.p135==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((EG(((i7.i1.u48.p156==0)||(i12.i0.u51.p164==1))) * ((i5.i0.u30.p94==0)||(i5.i2.u43.p135==0))...170
Reverse transition relation is NOT exact ! Due to transitions t52, t92, t95, t138, t141, t184, t187, t215, t220, t229, t233, i0.t224, i0.i1.u35.t140, i0.i2...966
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 9 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 18:06:17] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:06:17] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 18:06:17] [INFO ] Invariant cache hit.
[2024-05-29 18:06:17] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 18:06:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:06:20] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:21] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:06:22] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:06:22] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:06:22] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:06:22] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:06:22] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:06:22] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:06:22] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:06:23] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:24] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 242/512 variables, 270/345 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/512 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:06:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:06:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/512 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/512 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 14 (OVERLAPS) 0/512 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 350 constraints, problems are : Problem set: 0 solved, 241 unsolved in 26773 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 35/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/512 variables, 270/350 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 241/591 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:06:48] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:06:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:06:49] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:06:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:06:50] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 9/600 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:54] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:06:54] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:06:54] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:06:54] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:06:55] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:06:58] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:06:59] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:07:00] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:07:04] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:07:08] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 611 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 55/55 constraints]
After SMT, in 56811ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 56813ms
Starting structural reductions in LTL mode, iteration 1 : 270/294 places, 242/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57110 ms. Remains : 270/294 places, 242/266 transitions.
[2024-05-29 18:07:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:07:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:07:14] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-29 18:07:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:07:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:07:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10848878443899519037.gal : 1 ms
[2024-05-29 18:07:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9988909058029010881.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/CTLFireability10848878443899519037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9988909058029010881.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,9.20013e+25,22.291,565864,2,23846,5,1.71821e+06,6,0,1324,4.05541e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:07:44] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:07:44] [INFO ] Applying decomposition
[2024-05-29 18:07:44] [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/graph1452866995354067508.txt' '-o' '/tmp/graph1452866995354067508.bin' '-w' '/tmp/graph1452866995354067508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1452866995354067508.bin' '-l' '-1' '-v' '-w' '/tmp/graph1452866995354067508.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:07:44] [INFO ] Decomposing Gal with order
[2024-05-29 18:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:07:44] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-29 18:07:44] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:07:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:07:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6376521283989920234.gal : 2 ms
[2024-05-29 18:07:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3449356260095233845.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/CTLFireability6376521283989920234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3449356260095233845.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,9.20013e+25,3.38943,93840,1812,29,181693,474,537,444552,48,1347,0
Converting to forward existential form...Done !
original formula: (EG(((EX(AG((i14.u83.p272==1))) + (i16.i0.u82.p267==0)) + (i16.i0.u82.p269==0))) + EF(EG((((((i5.i3.u35.p114==1)&&(i6.u44.p147==1)) * !(E...273
=> equivalent forward existential formula: ([FwdG(Init,((EX(!(E(TRUE U !((i14.u83.p272==1))))) + (i16.i0.u82.p267==0)) + (i16.i0.u82.p269==0)))] != FALSE +...359
Reverse transition relation is NOT exact ! Due to transitions t47, t50, t93, t96, t145, t185, t188, t216, t225, t234, i0.i0.u1.t195, i0.i1.u9.t190, i1.t239...954
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 277 transition count 249
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 277 transition count 249
Applied a total of 34 rules in 5 ms. Remains 277 /294 variables (removed 17) and now considering 249/266 (removed 17) transitions.
// Phase 1: matrix 249 rows 277 cols
[2024-05-29 18:08:15] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 18:08:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 18:08:15] [INFO ] Invariant cache hit.
[2024-05-29 18:08:15] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-29 18:08:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:08:17] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:08:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:08:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:08:20] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 249/526 variables, 277/352 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:08:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:08:26] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:08:27] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:08:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:33] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:08:33] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:08:34] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/526 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 15 (OVERLAPS) 0/526 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 365 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/526 variables, 277/365 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 248/613 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:48] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:08:49] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:08:49] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:08:49] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:08:50] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:08:50] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:08:51] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:08:51] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:08:51] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:08:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 10/623 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:08:56] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:09:00] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:09:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:09:01] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:09:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-29 18:09:06] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 629 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 59/59 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Starting structural reductions in LTL mode, iteration 1 : 277/294 places, 249/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60307 ms. Remains : 277/294 places, 249/266 transitions.
[2024-05-29 18:09:15] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:15] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:15] [INFO ] Input system was already deterministic with 249 transitions.
[2024-05-29 18:09:15] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:15] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15014895890310693898.gal : 1 ms
[2024-05-29 18:09:15] [INFO ] Time to serialize properties into /tmp/CTLFireability269911552459595099.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/CTLFireability15014895890310693898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability269911552459595099.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:09:45] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:09:45] [INFO ] Applying decomposition
[2024-05-29 18:09:45] [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/graph8948997610905563006.txt' '-o' '/tmp/graph8948997610905563006.bin' '-w' '/tmp/graph8948997610905563006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8948997610905563006.bin' '-l' '-1' '-v' '-w' '/tmp/graph8948997610905563006.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:09:45] [INFO ] Decomposing Gal with order
[2024-05-29 18:09:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:09:45] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-29 18:09:45] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:09:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 18:09:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6621550903904764630.gal : 2 ms
[2024-05-29 18:09:45] [INFO ] Time to serialize properties into /tmp/CTLFireability985998051570615254.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/CTLFireability6621550903904764630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability985998051570615254.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.8316e+26,4.49992,125316,2460,29,209420,415,597,610054,53,1135,0
Converting to forward existential form...Done !
original formula: E(AG((i13.u85.p271==1)) U A((EG(!(AG((i0.i1.u72.p232==1)))) * !(((((i14.i0.u79.p249==1)&&(i14.i1.u90.p285==1))&&((i8.i0.u38.p120==1)&&(i8...385
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U !((i13.u85.p271==1))))) * !(EG(!(((i11.i1.u69.p217==1) * (!((E(!(E(((i8.i1.u56.p182==1)&...1320
Reverse transition relation is NOT exact ! Due to transitions t58, t99, t102, t151, t192, t195, t228, t232, t240, t241, i0.i1.t69, i0.i1.u71.t65, i1.i0.u1....1069
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 273 transition count 245
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 273 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 272 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Applied a total of 46 rules in 15 ms. Remains 271 /294 variables (removed 23) and now considering 243/266 (removed 23) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-29 18:10:15] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 18:10:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 18:10:15] [INFO ] Invariant cache hit.
[2024-05-29 18:10:15] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-29 18:10:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:10:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:10:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:10:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:10:19] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:10:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:19] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:10:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:10:19] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:10:20] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 243/514 variables, 271/345 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:23] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:10:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:10:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/514 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:30] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/514 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 350 constraints, problems are : Problem set: 0 solved, 242 unsolved in 20707 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 243/514 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 242/592 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:39] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:10:40] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:10:40] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-29 18:10:40] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:10:40] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:10:41] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:10:41] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:10:41] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:10:41] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:10:42] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:10:42] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:10:42] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:10:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 13/605 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:44] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:10:46] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:49] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-29 18:10:55] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/514 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 609 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 51/51 constraints]
After SMT, in 50746ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 50748ms
Starting structural reductions in LTL mode, iteration 1 : 271/294 places, 243/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51018 ms. Remains : 271/294 places, 243/266 transitions.
[2024-05-29 18:11:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:11:06] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:11:06] [INFO ] Input system was already deterministic with 243 transitions.
[2024-05-29 18:11:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:11:06] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:11:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14715347859090086681.gal : 1 ms
[2024-05-29 18:11:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12822814169185996088.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/CTLFireability14715347859090086681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12822814169185996088.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:11:36] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:11:36] [INFO ] Applying decomposition
[2024-05-29 18:11:36] [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/graph12916287790011004938.txt' '-o' '/tmp/graph12916287790011004938.bin' '-w' '/tmp/graph12916287790011004938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12916287790011004938.bin' '-l' '-1' '-v' '-w' '/tmp/graph12916287790011004938.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:11:36] [INFO ] Decomposing Gal with order
[2024-05-29 18:11:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:11:36] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-29 18:11:36] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:11:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:11:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13242127869226538555.gal : 3 ms
[2024-05-29 18:11:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11241951614857575857.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/CTLFireability13242127869226538555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11241951614857575857.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.0613e+26,3.22547,88332,1583,40,154448,721,560,324608,61,1813,0
Converting to forward existential form...Done !
original formula: EF((AX((((i14.i1.u96.p310==0)||(i10.i0.u60.p186==0))||(i10.i1.u93.p296==0))) * (((i13.i3.u88.p283==1)||(i6.i1.u32.p96==1)) + EG((i8.u50.p...166
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EX(!((((i14.i1.u96.p310==0)||(i10.i0.u60.p186==0))||(i10.i1.u93.p296==0)))))) * ((i13.i3...336
Reverse transition relation is NOT exact ! Due to transitions t47, t50, t93, t96, t140, t143, t186, t189, t217, t222, t225, t240, i0.i2.t86, i0.i2.u64.t90,...1006
(forward)formula 0,1,4.61442,88332,1,0,156639,721,2629,324608,303,1813,202769
FORMULA ShieldPPPt-PT-004B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 274 transition count 246
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 274 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 273 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 273 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 272 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 272 transition count 244
Applied a total of 44 rules in 9 ms. Remains 272 /294 variables (removed 22) and now considering 244/266 (removed 22) transitions.
// Phase 1: matrix 244 rows 272 cols
[2024-05-29 18:11:41] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 18:11:41] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-29 18:11:41] [INFO ] Invariant cache hit.
[2024-05-29 18:11:41] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-29 18:11:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:11:43] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:11:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:11:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:11:43] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:11:44] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:11:45] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:11:46] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:11:48] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:11:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 244/516 variables, 272/354 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 354 constraints, problems are : Problem set: 0 solved, 243 unsolved in 13401 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:11:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:11:57] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 244/516 variables, 272/356 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 243/599 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:12:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:12:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:12:02] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:12:03] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:12:03] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:12:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 13/612 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:12:07] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:12:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:12:11] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:12:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:12:18] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 618 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 58/58 constraints]
After SMT, in 43433ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 43435ms
Starting structural reductions in LTL mode, iteration 1 : 272/294 places, 244/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43834 ms. Remains : 272/294 places, 244/266 transitions.
[2024-05-29 18:12:25] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:12:25] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:12:25] [INFO ] Input system was already deterministic with 244 transitions.
[2024-05-29 18:12:25] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:12:25] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:12:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11253769241831824574.gal : 1 ms
[2024-05-29 18:12:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3917857492075881547.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/CTLFireability11253769241831824574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3917857492075881547.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:12:55] [INFO ] Applying decomposition
[2024-05-29 18:12:55] [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/graph7542145620799747678.txt' '-o' '/tmp/graph7542145620799747678.bin' '-w' '/tmp/graph7542145620799747678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7542145620799747678.bin' '-l' '-1' '-v' '-w' '/tmp/graph7542145620799747678.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:12:55] [INFO ] Decomposing Gal with order
[2024-05-29 18:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:12:55] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-29 18:12:55] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6191599568055046134.gal : 3 ms
[2024-05-29 18:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12888604669913649745.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/CTLFireability6191599568055046134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12888604669913649745.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.18509e+26,7.4338,201596,4053,29,339398,424,590,1.16446e+06,52,1044,0
Converting to forward existential form...Done !
original formula: ((AF(!(A(EF((i4.u41.p134==1)) U (E((i11.u72.p235==1) U (i7.u49.p158==1)) * (((i10.u60.p197==1)&&(i15.u79.p256==1))||((i3.u7.p22==1)&&(i3....458
=> equivalent forward existential formula: (([FwdG(Init,!(!(!((E(!((E((i11.u72.p235==1) U (i7.u49.p158==1)) * (((i10.u60.p197==1)&&(i15.u79.p256==1))||((i3...843
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t93, t141, t144, t193, t229, t236, i0.t163, i0.u2.t197, i0.u21.t167, i1.t241, i1.t1...930
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 274 transition count 246
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 274 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 273 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 273 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 272 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 272 transition count 244
Applied a total of 44 rules in 9 ms. Remains 272 /294 variables (removed 22) and now considering 244/266 (removed 22) transitions.
// Phase 1: matrix 244 rows 272 cols
[2024-05-29 18:13:25] [INFO ] Computed 45 invariants in 0 ms
[2024-05-29 18:13:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 18:13:25] [INFO ] Invariant cache hit.
[2024-05-29 18:13:25] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-29 18:13:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:13:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:13:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:13:27] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:13:28] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:13:29] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:13:29] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:13:29] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:13:29] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:13:29] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:13:29] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:13:30] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:32] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 244/516 variables, 272/351 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:13:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:13:39] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:13:39] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:13:45] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:13:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/516 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 14 (OVERLAPS) 0/516 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 360 constraints, problems are : Problem set: 0 solved, 243 unsolved in 26193 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:53] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:54] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 244/516 variables, 272/362 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 243/605 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:13:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:13:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:13:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:13:58] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:13:59] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:13:59] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:13:59] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:13:59] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:13:59] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:14:00] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:14:00] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:14:00] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:14:01] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 13/618 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:14:05] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:14:10] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-29 18:14:14] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 621 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 61/61 constraints]
After SMT, in 56239ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 56241ms
Starting structural reductions in LTL mode, iteration 1 : 272/294 places, 244/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56521 ms. Remains : 272/294 places, 244/266 transitions.
[2024-05-29 18:14:21] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:14:21] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:14:21] [INFO ] Input system was already deterministic with 244 transitions.
[2024-05-29 18:14:21] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:14:21] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4476674219686428279.gal : 1 ms
[2024-05-29 18:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16954181493191914832.ctl : 5 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/CTLFireability4476674219686428279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16954181493191914832.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:14:52] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:14:52] [INFO ] Applying decomposition
[2024-05-29 18:14:52] [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/graph5505749943490975299.txt' '-o' '/tmp/graph5505749943490975299.bin' '-w' '/tmp/graph5505749943490975299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5505749943490975299.bin' '-l' '-1' '-v' '-w' '/tmp/graph5505749943490975299.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:14:52] [INFO ] Decomposing Gal with order
[2024-05-29 18:14:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:14:52] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-29 18:14:52] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:14:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:14:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9335734049273830836.gal : 2 ms
[2024-05-29 18:14:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4798124273954454338.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/CTLFireability9335734049273830836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4798124273954454338.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.19622e+26,2.81273,76972,2303,50,128905,404,560,292971,61,1103,0
Converting to forward existential form...Done !
original formula: E(((!(AF(((i6.u39.p119==1)&&(i10.i0.u60.p180==1)))) + (i12.i2.u76.p228==1)) + (EX(((((i11.i0.u56.p167==1)||(i0.i2.u20.p51==1))||((i16.u98...351
=> equivalent forward existential formula: [(FwdU(Init,((!(!(EG(!(((i6.u39.p119==1)&&(i10.i0.u60.p180==1)))))) + (i12.i2.u76.p228==1)) + (EX(((((i11.i0.u56...403
Reverse transition relation is NOT exact ! Due to transitions t47, t50, t94, t97, t141, t144, t187, t190, t218, t226, t227, t234, t236, i0.t193, i0.i0.u7.t...1035
Detected timeout of ITS tools.
[2024-05-29 18:15:22] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:15:22] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:15:22] [INFO ] Applying decomposition
[2024-05-29 18:15:22] [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/graph9400436862487713627.txt' '-o' '/tmp/graph9400436862487713627.bin' '-w' '/tmp/graph9400436862487713627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9400436862487713627.bin' '-l' '-1' '-v' '-w' '/tmp/graph9400436862487713627.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:15:22] [INFO ] Decomposing Gal with order
[2024-05-29 18:15:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:15:22] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-29 18:15:22] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:15:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10085644835554583047.gal : 16 ms
[2024-05-29 18:15:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16105200591506424657.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/CTLFireability10085644835554583047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16105200591506424657.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 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73524e+26,30.9338,662640,7012,41,1.0773e+06,616,617,3.44932e+06,60,3367,0
Converting to forward existential form...Done !
original formula: E(A(EG(E(((i15.i1.u98.p290==1)&&(i16.u94.p273==1)) U ((i4.u15.p45==1)||((i3.i1.u8.p18==1)&&(i3.i2.u17.p54==1))))) U (!(EF((i3.i0.u6.p14==...403
=> equivalent forward existential formula: [(EY((FwdU(Init,!((E(!((!(E(TRUE U (i3.i0.u6.p14==1))) + (E(((i4.u15.p45==1)&&(i10.i0.u57.p165==1)) U EG((i16.u9...814
Reverse transition relation is NOT exact ! Due to transitions t63, t116, t166, t209, t212, t257, t258, i0.t33, i0.t26, i0.u102.t31, i0.u105.t34, i1.i1.u2.t...1320
Detected timeout of ITS tools.
[2024-05-29 18:44:46] [INFO ] Applying decomposition
[2024-05-29 18:44:46] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:44:46] [INFO ] Decomposing Gal with order
[2024-05-29 18:44:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:44:46] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-29 18:44:46] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:44:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2024-05-29 18:44:46] [INFO ] Time to serialize gal into /tmp/CTLFireability18374278864286203550.gal : 4 ms
[2024-05-29 18:44:46] [INFO ] Time to serialize properties into /tmp/CTLFireability167995540453021841.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/CTLFireability18374278864286203550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability167995540453021841.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
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="ShieldPPPt-PT-004B"
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 ShieldPPPt-PT-004B, 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-171683761400586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004B.tgz
mv ShieldPPPt-PT-004B 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 ;