About the Execution of ITS-Tools for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.111 | 3598620.00 | 3854709.00 | 10199.10 | ??T???F????????? | 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.r550-tall-171734899100321.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 FireWire-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100321
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 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 FireWire-PT-20-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717372977043
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-03 00:02:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 00:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:02:58] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-03 00:02:58] [INFO ] Transformed 626 places.
[2024-06-03 00:02:58] [INFO ] Transformed 1031 transitions.
[2024-06-03 00:02:58] [INFO ] Found NUPN structural information;
[2024-06-03 00:02:58] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 615 transition count 1031
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 129 place count 497 transition count 913
Iterating global reduction 1 with 118 rules applied. Total rules applied 247 place count 497 transition count 913
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 248 place count 497 transition count 912
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 270 place count 475 transition count 793
Iterating global reduction 2 with 22 rules applied. Total rules applied 292 place count 475 transition count 793
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 475 transition count 792
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 297 place count 471 transition count 786
Iterating global reduction 3 with 4 rules applied. Total rules applied 301 place count 471 transition count 786
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 471 transition count 785
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 303 place count 470 transition count 782
Iterating global reduction 4 with 1 rules applied. Total rules applied 304 place count 470 transition count 782
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 305 place count 469 transition count 780
Iterating global reduction 4 with 1 rules applied. Total rules applied 306 place count 469 transition count 780
Applied a total of 306 rules in 128 ms. Remains 469 /626 variables (removed 157) and now considering 780/1031 (removed 251) transitions.
// Phase 1: matrix 780 rows 469 cols
[2024-06-03 00:02:58] [INFO ] Computed 10 invariants in 28 ms
[2024-06-03 00:02:58] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-06-03 00:02:58] [INFO ] Invariant cache hit.
[2024-06-03 00:02:59] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Running 779 sub problems to find dead transitions.
[2024-06-03 00:02:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-03 00:03:10] [INFO ] Deduced a trap composed of 285 places in 212 ms of which 27 ms to minimize.
[2024-06-03 00:03:10] [INFO ] Deduced a trap composed of 247 places in 192 ms of which 3 ms to minimize.
[2024-06-03 00:03:11] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-06-03 00:03:11] [INFO ] Deduced a trap composed of 100 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:03:11] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 280 places in 167 ms of which 3 ms to minimize.
[2024-06-03 00:03:12] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:03:14] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 2 ms to minimize.
[2024-06-03 00:03:14] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:03:14] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:03:14] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:03:15] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-06-03 00:03:15] [INFO ] Deduced a trap composed of 127 places in 165 ms of which 2 ms to minimize.
[2024-06-03 00:03:16] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 3 ms to minimize.
[2024-06-03 00:03:17] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-06-03 00:03:19] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:03:19] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-03 00:03:21] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-06-03 00:03:21] [INFO ] Deduced a trap composed of 283 places in 159 ms of which 2 ms to minimize.
[2024-06-03 00:03:21] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 2 ms to minimize.
[2024-06-03 00:03:21] [INFO ] Deduced a trap composed of 270 places in 142 ms of which 3 ms to minimize.
[2024-06-03 00:03:22] [INFO ] Deduced a trap composed of 107 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1249 variables, and 32 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/469 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-03 00:03:35] [INFO ] Deduced a trap composed of 269 places in 149 ms of which 3 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 275 places in 142 ms of which 3 ms to minimize.
[2024-06-03 00:03:36] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 2 ms to minimize.
[2024-06-03 00:03:37] [INFO ] Deduced a trap composed of 111 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:03:37] [INFO ] Deduced a trap composed of 117 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:03:37] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-03 00:03:45] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-03 00:03:54] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 2 ms to minimize.
(s106 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0timeout
)
(s107 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/1249 variables, and 40 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/469 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 30/30 constraints]
After SMT, in 60667ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60691ms
Starting structural reductions in LTL mode, iteration 1 : 469/626 places, 780/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61784 ms. Remains : 469/626 places, 780/1031 transitions.
Support contains 94 out of 469 places after structural reductions.
[2024-06-03 00:04:00] [INFO ] Flatten gal took : 87 ms
[2024-06-03 00:04:00] [INFO ] Flatten gal took : 44 ms
[2024-06-03 00:04:00] [INFO ] Input system was already deterministic with 780 transitions.
Support contains 85 out of 469 places (down from 94) after GAL structural reductions.
FORMULA FireWire-PT-20-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (28 resets) in 2360 ms. (16 steps per ms) remains 24/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
[2024-06-03 00:04:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 365/428 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 749/1177 variables, 428/438 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1177 variables, 0/438 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 48/1225 variables, 28/466 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1225 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 17/1242 variables, 8/474 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1242 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 7/1249 variables, 5/479 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1249 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/1249 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1249/1249 variables, and 479 constraints, problems are : Problem set: 1 solved, 23 unsolved in 2521 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 469/469 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 367/428 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-03 00:04:04] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 3 ms to minimize.
[2024-06-03 00:04:04] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-06-03 00:04:04] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-06-03 00:04:04] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 1 ms to minimize.
[2024-06-03 00:04:04] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 5 ms to minimize.
[2024-06-03 00:04:05] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-06-03 00:04:05] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 2 ms to minimize.
[2024-06-03 00:04:05] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 8/18 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 749/1177 variables, 428/446 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1177 variables, 20/466 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-03 00:04:06] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1177 variables, 1/467 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1177 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 48/1225 variables, 28/495 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1225 variables, 3/498 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-03 00:04:08] [INFO ] Deduced a trap composed of 135 places in 169 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 1/499 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1225/1249 variables, and 499 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 456/469 constraints, PredecessorRefiner: 23/24 constraints, Known Traps: 10/10 constraints]
After SMT, in 7549ms problems are : Problem set: 1 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 780/780 transitions.
Graph (trivial) has 251 edges and 469 vertex of which 8 / 469 are part of one of the 2 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 1441 edges and 463 vertex of which 461 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 461 transition count 727
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 44 rules applied. Total rules applied 87 place count 420 transition count 724
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 96 place count 419 transition count 716
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 104 place count 411 transition count 716
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 104 place count 411 transition count 686
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 164 place count 381 transition count 686
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 171 place count 374 transition count 678
Iterating global reduction 4 with 7 rules applied. Total rules applied 178 place count 374 transition count 678
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 178 place count 374 transition count 676
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 182 place count 372 transition count 676
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 183 place count 371 transition count 675
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 371 transition count 675
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 264 place count 331 transition count 635
Performed 25 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 314 place count 306 transition count 683
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 317 place count 306 transition count 680
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 345 place count 306 transition count 652
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 375 place count 278 transition count 650
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 378 place count 275 transition count 647
Iterating global reduction 5 with 3 rules applied. Total rules applied 381 place count 275 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 382 place count 275 transition count 646
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 390 place count 275 transition count 638
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 400 place count 275 transition count 638
Applied a total of 400 rules in 213 ms. Remains 275 /469 variables (removed 194) and now considering 638/780 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 275/469 places, 638/780 transitions.
RANDOM walk for 40000 steps (1152 resets) in 1179 ms. (33 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40004 steps (217 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (220 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (216 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (214 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (219 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (217 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (222 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (225 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (217 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (224 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (177 resets) in 42 ms. (930 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (234 resets) in 47 ms. (833 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (220 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
[2024-06-03 00:04:09] [INFO ] Flow matrix only has 637 transitions (discarded 1 similar events)
// Phase 1: matrix 637 rows 275 cols
[2024-06-03 00:04:09] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:04:09] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 222/256 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 634/890 variables, 256/266 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 97/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 21/911 variables, 18/381 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/912 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 382 constraints, problems are : Problem set: 0 solved, 12 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 275/275 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 222/256 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 00:04:11] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:04:11] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-03 00:04:11] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:04:11] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 0 ms to minimize.
[2024-06-03 00:04:11] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:04:11] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 634/890 variables, 256/272 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 97/369 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 10/379 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 00:04:11] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/890 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/890 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 21/911 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/911 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 12 (OVERLAPS) 1/912 variables, 1/401 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/912 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/912 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 401 constraints, problems are : Problem set: 1 solved, 11 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 275/275 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints]
After SMT, in 3564ms problems are : Problem set: 1 solved, 11 unsolved
Parikh walk visited 0 properties in 12304 ms.
Support contains 26 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 638/638 transitions.
Graph (trivial) has 64 edges and 275 vertex of which 2 / 275 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 274 transition count 627
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 265 transition count 626
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 20 place count 265 transition count 619
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 258 transition count 619
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 253 transition count 612
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 253 transition count 612
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 253 transition count 610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 252 transition count 607
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 252 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 252 transition count 606
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 49 place count 252 transition count 605
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 251 transition count 605
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 63 place count 245 transition count 599
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 244 transition count 597
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 244 transition count 597
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 71 place count 241 transition count 600
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 241 transition count 599
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 75 place count 241 transition count 596
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 80 place count 241 transition count 591
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 85 place count 236 transition count 591
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 236 transition count 590
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 90 place count 236 transition count 590
Applied a total of 90 rules in 87 ms. Remains 236 /275 variables (removed 39) and now considering 590/638 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 236/275 places, 590/638 transitions.
RANDOM walk for 40000 steps (1297 resets) in 428 ms. (93 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (247 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (259 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (252 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (258 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (256 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (242 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (259 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (258 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (254 resets) in 41 ms. (952 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (263 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (268 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 424057 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :5 out of 10
Probabilistic random walk after 424057 steps, saw 138324 distinct states, run finished after 3004 ms. (steps per millisecond=141 ) properties seen :5
[2024-06-03 00:04:29] [INFO ] Flow matrix only has 585 transitions (discarded 5 similar events)
// Phase 1: matrix 585 rows 236 cols
[2024-06-03 00:04:29] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:04:29] [INFO ] State equation strengthened by 95 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 172/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/218 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:04:29] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-06-03 00:04:29] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 583/801 variables, 218/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 95/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/801 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 19/820 variables, 17/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:04:29] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/821 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/821 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/821 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 344 constraints, problems are : Problem set: 0 solved, 5 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 236/236 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 172/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:04:30] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 31/218 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:04:30] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 583/801 variables, 218/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 95/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 5/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/801 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 19/820 variables, 17/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/821 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/821 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/821 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 351 constraints, problems are : Problem set: 0 solved, 5 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 236/236 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1714ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1031 ms.
Support contains 15 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 590/590 transitions.
Graph (complete) has 1103 edges and 236 vertex of which 234 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 234 transition count 588
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 232 transition count 588
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 11 place count 226 transition count 580
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 226 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 225 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 225 transition count 578
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 224 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 224 transition count 575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 223 transition count 573
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 223 transition count 573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 222 transition count 570
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 222 transition count 570
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 221 transition count 568
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 221 transition count 568
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 220 transition count 565
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 220 transition count 565
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 219 transition count 563
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 219 transition count 563
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 218 transition count 561
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 218 transition count 561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 217 transition count 559
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 217 transition count 559
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 215 transition count 557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 214 transition count 556
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 214 transition count 556
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 213 transition count 550
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 213 transition count 550
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 212 transition count 548
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 212 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 212 transition count 544
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 212 transition count 541
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 209 transition count 541
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 209 transition count 544
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 208 transition count 543
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 208 transition count 542
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 208 transition count 542
Applied a total of 61 rules in 109 ms. Remains 208 /236 variables (removed 28) and now considering 542/590 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 208/236 places, 542/590 transitions.
RANDOM walk for 40000 steps (1369 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (253 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (261 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (259 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (275 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (262 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 572008 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 5
Probabilistic random walk after 572008 steps, saw 162227 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2024-06-03 00:04:35] [INFO ] Flow matrix only has 536 transitions (discarded 6 similar events)
// Phase 1: matrix 536 rows 208 cols
[2024-06-03 00:04:35] [INFO ] Computed 10 invariants in 10 ms
[2024-06-03 00:04:35] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/196 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 536/732 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 88/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/744 variables, 12/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/744 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/744 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 306 constraints, problems are : Problem set: 0 solved, 5 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:04:35] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 31/196 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:04:35] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2024-06-03 00:04:36] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:04:36] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:04:36] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:04:36] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 536/732 variables, 196/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/732 variables, 88/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/732 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/732 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/744 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/744 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/744 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 317 constraints, problems are : Problem set: 0 solved, 5 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1371ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1126 ms.
Support contains 15 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 208/208 places, 542/542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 542/542 transitions.
Applied a total of 0 rules in 7 ms. Remains 208 /208 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-06-03 00:04:37] [INFO ] Flow matrix only has 536 transitions (discarded 6 similar events)
[2024-06-03 00:04:37] [INFO ] Invariant cache hit.
[2024-06-03 00:04:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-03 00:04:37] [INFO ] Flow matrix only has 536 transitions (discarded 6 similar events)
[2024-06-03 00:04:37] [INFO ] Invariant cache hit.
[2024-06-03 00:04:38] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-03 00:04:38] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-06-03 00:04:38] [INFO ] Redundant transitions in 41 ms returned [422]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 537 sub problems to find dead transitions.
[2024-06-03 00:04:38] [INFO ] Flow matrix only has 535 transitions (discarded 6 similar events)
// Phase 1: matrix 535 rows 208 cols
[2024-06-03 00:04:38] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:04:38] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-03 00:04:42] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:04:42] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:04:43] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:04:43] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:04:43] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:04:43] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:04:44] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:04:45] [INFO ] Deduced a trap composed of 149 places in 95 ms of which 2 ms to minimize.
[2024-06-03 00:04:45] [INFO ] Deduced a trap composed of 161 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-03 00:04:47] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 535/743 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 88/316 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 8 (OVERLAPS) 0/743 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 537 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 316 constraints, problems are : Problem set: 0 solved, 537 unsolved in 26187 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 535/743 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 88/316 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 537/853 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-03 00:05:25] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 854 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 11/11 constraints]
After SMT, in 56770ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 56775ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/208 places, 541/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 541/541 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57330 ms. Remains : 208/208 places, 541/542 transitions.
RANDOM walk for 40000 steps (1366 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (262 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (269 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (261 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 497814 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 5
Probabilistic random walk after 497814 steps, saw 139670 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-03 00:05:38] [INFO ] Flow matrix only has 535 transitions (discarded 6 similar events)
[2024-06-03 00:05:38] [INFO ] Invariant cache hit.
[2024-06-03 00:05:38] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/196 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:05:38] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:05:38] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:05:38] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:05:38] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 535/731 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 88/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 12/743 variables, 12/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/743 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 310 constraints, problems are : Problem set: 0 solved, 5 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:05:39] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 31/196 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:05:39] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:05:39] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:05:39] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 535/731 variables, 196/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 88/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/731 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 12/743 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/743 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/743 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 743/743 variables, and 319 constraints, problems are : Problem set: 0 solved, 5 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2331 ms.
Support contains 15 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 541/541 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 541/541 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 208/208 places, 541/541 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 541/541 transitions.
Applied a total of 0 rules in 10 ms. Remains 208 /208 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2024-06-03 00:05:42] [INFO ] Flow matrix only has 535 transitions (discarded 6 similar events)
[2024-06-03 00:05:42] [INFO ] Invariant cache hit.
[2024-06-03 00:05:42] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-03 00:05:42] [INFO ] Flow matrix only has 535 transitions (discarded 6 similar events)
[2024-06-03 00:05:42] [INFO ] Invariant cache hit.
[2024-06-03 00:05:42] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-03 00:05:42] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-06-03 00:05:42] [INFO ] Redundant transitions in 6 ms returned []
Running 537 sub problems to find dead transitions.
[2024-06-03 00:05:42] [INFO ] Flow matrix only has 535 transitions (discarded 6 similar events)
[2024-06-03 00:05:42] [INFO ] Invariant cache hit.
[2024-06-03 00:05:42] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-03 00:05:47] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:05:47] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:05:47] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:05:47] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-06-03 00:05:48] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 0 ms to minimize.
[2024-06-03 00:05:48] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-03 00:05:48] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:05:50] [INFO ] Deduced a trap composed of 149 places in 80 ms of which 1 ms to minimize.
[2024-06-03 00:05:50] [INFO ] Deduced a trap composed of 161 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-03 00:05:51] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 535/743 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 88/316 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-03 00:06:03] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/743 variables, and 317 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 535/743 variables, 208/229 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 88/317 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 537/854 constraints. Problems are: Problem set: 0 solved, 537 unsolved
[2024-06-03 00:06:27] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 855 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 12/12 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60590ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61095 ms. Remains : 208/208 places, 541/541 transitions.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-06-03 00:06:43] [INFO ] Flatten gal took : 33 ms
[2024-06-03 00:06:43] [INFO ] Flatten gal took : 33 ms
[2024-06-03 00:06:43] [INFO ] Input system was already deterministic with 780 transitions.
Computed a total of 143 stabilizing places and 218 stable transitions
Graph (complete) has 1454 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 34 place count 435 transition count 747
Iterating global reduction 1 with 30 rules applied. Total rules applied 64 place count 435 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 435 transition count 746
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 78 place count 422 transition count 726
Iterating global reduction 2 with 13 rules applied. Total rules applied 91 place count 422 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 422 transition count 725
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 418 transition count 717
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 418 transition count 717
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 416 transition count 712
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 416 transition count 712
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 414 transition count 707
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 414 transition count 707
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 412 transition count 702
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 412 transition count 702
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 410 transition count 697
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 410 transition count 697
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 408 transition count 692
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 408 transition count 692
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 406 transition count 688
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 406 transition count 688
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 404 transition count 683
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 404 transition count 683
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 402 transition count 680
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 402 transition count 680
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 401 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 401 transition count 677
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 400 transition count 675
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 400 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 399 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 399 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 398 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 398 transition count 671
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 397 transition count 670
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 397 transition count 670
Applied a total of 142 rules in 66 ms. Remains 397 /469 variables (removed 72) and now considering 670/780 (removed 110) transitions.
// Phase 1: matrix 670 rows 397 cols
[2024-06-03 00:06:43] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 00:06:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-03 00:06:43] [INFO ] Invariant cache hit.
[2024-06-03 00:06:44] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 669 sub problems to find dead transitions.
[2024-06-03 00:06:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-03 00:06:52] [INFO ] Deduced a trap composed of 260 places in 133 ms of which 3 ms to minimize.
[2024-06-03 00:06:52] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:06:52] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:06:52] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:06:53] [INFO ] Deduced a trap composed of 227 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:06:53] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:06:53] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:06:54] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:06:55] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:06:55] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:06:55] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 3 ms to minimize.
[2024-06-03 00:06:56] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 3 ms to minimize.
[2024-06-03 00:06:57] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:06:57] [INFO ] Deduced a trap composed of 78 places in 37 ms of which 1 ms to minimize.
[2024-06-03 00:06:59] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (OVERLAPS) 670/1067 variables, 397/422 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-03 00:07:10] [INFO ] Deduced a trap composed of 191 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1067/1067 variables, and 423 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-03 00:07:18] [INFO ] Deduced a trap composed of 237 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:07:19] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:07:19] [INFO ] Deduced a trap composed of 230 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:07:19] [INFO ] Deduced a trap composed of 227 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (OVERLAPS) 670/1067 variables, 397/427 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1067 variables, 669/1096 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-03 00:07:38] [INFO ] Deduced a trap composed of 230 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1067/1067 variables, and 1097 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 21/21 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 397/469 places, 670/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60930 ms. Remains : 397/469 places, 670/780 transitions.
[2024-06-03 00:07:44] [INFO ] Flatten gal took : 28 ms
[2024-06-03 00:07:44] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:07:44] [INFO ] Input system was already deterministic with 670 transitions.
[2024-06-03 00:07:44] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:07:44] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:07:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17542660476434374383.gal : 31 ms
[2024-06-03 00:07:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5299918710441563379.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/CTLCardinality17542660476434374383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5299918710441563379.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-06-03 00:08:14] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:08:14] [INFO ] Applying decomposition
[2024-06-03 00:08:14] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17129408911641733153.txt' '-o' '/tmp/graph17129408911641733153.bin' '-w' '/tmp/graph17129408911641733153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17129408911641733153.bin' '-l' '-1' '-v' '-w' '/tmp/graph17129408911641733153.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:08:15] [INFO ] Decomposing Gal with order
[2024-06-03 00:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:08:15] [INFO ] Removed a total of 734 redundant transitions.
[2024-06-03 00:08:15] [INFO ] Flatten gal took : 127 ms
[2024-06-03 00:08:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 32 ms.
[2024-06-03 00:08:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality1905645191245067481.gal : 12 ms
[2024-06-03 00:08:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality9485416046585753466.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/CTLCardinality1905645191245067481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9485416046585753466.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 380 transition count 634
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 379 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 379 transition count 633
Applied a total of 178 rules in 66 ms. Remains 379 /469 variables (removed 90) and now considering 633/780 (removed 147) transitions.
// Phase 1: matrix 633 rows 379 cols
[2024-06-03 00:08:45] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:08:45] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-03 00:08:45] [INFO ] Invariant cache hit.
[2024-06-03 00:08:46] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 632 sub problems to find dead transitions.
[2024-06-03 00:08:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:08:53] [INFO ] Deduced a trap composed of 235 places in 125 ms of which 3 ms to minimize.
[2024-06-03 00:08:53] [INFO ] Deduced a trap composed of 238 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:08:53] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-06-03 00:08:53] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-06-03 00:08:53] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 2 ms to minimize.
[2024-06-03 00:08:54] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-06-03 00:08:55] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:08:55] [INFO ] Deduced a trap composed of 77 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:08:55] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:08:56] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:08:56] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 3 ms to minimize.
[2024-06-03 00:08:56] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:08:59] [INFO ] Deduced a trap composed of 231 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:08:59] [INFO ] Deduced a trap composed of 218 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:08:59] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-06-03 00:09:00] [INFO ] Deduced a trap composed of 221 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:09:00] [INFO ] Deduced a trap composed of 216 places in 107 ms of which 3 ms to minimize.
[2024-06-03 00:09:00] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:09:01] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:09:01] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:09:01] [INFO ] Deduced a trap composed of 224 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:09:01] [INFO ] Deduced a trap composed of 225 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:09:03] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:09:09] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:09:09] [INFO ] Deduced a trap composed of 221 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:09:10] [INFO ] Deduced a trap composed of 215 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:09:10] [INFO ] Deduced a trap composed of 225 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:09:10] [INFO ] Deduced a trap composed of 223 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:09:11] [INFO ] Deduced a trap composed of 220 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1012 variables, and 39 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 633/1012 variables, 379/418 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 632/1050 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 00:09:31] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:09:33] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 2 ms to minimize.
[2024-06-03 00:09:34] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:09:34] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1054 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 33/33 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 379/469 places, 633/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60821 ms. Remains : 379/469 places, 633/780 transitions.
[2024-06-03 00:09:46] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:09:46] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:09:46] [INFO ] Input system was already deterministic with 633 transitions.
[2024-06-03 00:09:46] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:09:46] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:09:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality16722227663772016471.gal : 3 ms
[2024-06-03 00:09:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality492690683031006183.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/CTLCardinality16722227663772016471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality492690683031006183.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-06-03 00:10:16] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:10:16] [INFO ] Applying decomposition
[2024-06-03 00:10:16] [INFO ] Flatten gal took : 15 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/graph196454046161711639.txt' '-o' '/tmp/graph196454046161711639.bin' '-w' '/tmp/graph196454046161711639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph196454046161711639.bin' '-l' '-1' '-v' '-w' '/tmp/graph196454046161711639.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:10:16] [INFO ] Decomposing Gal with order
[2024-06-03 00:10:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:10:16] [INFO ] Removed a total of 674 redundant transitions.
[2024-06-03 00:10:16] [INFO ] Flatten gal took : 29 ms
[2024-06-03 00:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 9 ms.
[2024-06-03 00:10:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12683444140710027458.gal : 5 ms
[2024-06-03 00:10:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7059092937791536634.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/CTLCardinality12683444140710027458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7059092937791536634.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 466 transition count 780
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 33 place count 436 transition count 745
Iterating global reduction 1 with 30 rules applied. Total rules applied 63 place count 436 transition count 745
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 75 place count 424 transition count 726
Iterating global reduction 1 with 12 rules applied. Total rules applied 87 place count 424 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 421 transition count 718
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 421 transition count 718
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 419 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 419 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 417 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 417 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 415 transition count 703
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 415 transition count 703
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 413 transition count 698
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 413 transition count 698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 411 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 411 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 409 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 409 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 407 transition count 684
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 407 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 405 transition count 681
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 405 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 404 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 404 transition count 678
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 403 transition count 676
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 403 transition count 676
Applied a total of 130 rules in 58 ms. Remains 403 /469 variables (removed 66) and now considering 676/780 (removed 104) transitions.
// Phase 1: matrix 676 rows 403 cols
[2024-06-03 00:10:46] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:10:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-03 00:10:46] [INFO ] Invariant cache hit.
[2024-06-03 00:10:47] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 675 sub problems to find dead transitions.
[2024-06-03 00:10:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-03 00:10:55] [INFO ] Deduced a trap composed of 226 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:10:55] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 0 ms to minimize.
[2024-06-03 00:10:55] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2024-06-03 00:10:56] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:10:57] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:10:57] [INFO ] Deduced a trap composed of 90 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:10:57] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:10:58] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:10:58] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (OVERLAPS) 676/1078 variables, 402/423 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-03 00:11:13] [INFO ] Deduced a trap composed of 205 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:11:14] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1078/1079 variables, and 426 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 402/403 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-03 00:11:24] [INFO ] Deduced a trap composed of 118 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-03 00:11:28] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:11:28] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 6 (OVERLAPS) 676/1078 variables, 402/429 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1078 variables, 668/1097 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-03 00:11:45] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:11:47] [INFO ] Deduced a trap composed of 232 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1079 variables, and 1099 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 402/403 constraints, PredecessorRefiner: 668/675 constraints, Known Traps: 19/19 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Starting structural reductions in LTL mode, iteration 1 : 403/469 places, 676/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60874 ms. Remains : 403/469 places, 676/780 transitions.
[2024-06-03 00:11:47] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:11:47] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:11:47] [INFO ] Input system was already deterministic with 676 transitions.
[2024-06-03 00:11:47] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:11:47] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:11:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality5170505769526576933.gal : 3 ms
[2024-06-03 00:11:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9465110152605552482.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/CTLCardinality5170505769526576933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9465110152605552482.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-06-03 00:12:17] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:12:17] [INFO ] Applying decomposition
[2024-06-03 00:12:17] [INFO ] Flatten gal took : 16 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/graph9021275055371068775.txt' '-o' '/tmp/graph9021275055371068775.bin' '-w' '/tmp/graph9021275055371068775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9021275055371068775.bin' '-l' '-1' '-v' '-w' '/tmp/graph9021275055371068775.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:12:17] [INFO ] Decomposing Gal with order
[2024-06-03 00:12:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:12:17] [INFO ] Removed a total of 711 redundant transitions.
[2024-06-03 00:12:18] [INFO ] Flatten gal took : 36 ms
[2024-06-03 00:12:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 10 ms.
[2024-06-03 00:12:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality10141144627230021567.gal : 5 ms
[2024-06-03 00:12:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15539855540283900448.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/CTLCardinality10141144627230021567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15539855540283900448.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Graph (trivial) has 313 edges and 469 vertex of which 11 / 469 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1444 edges and 461 vertex of which 457 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 456 transition count 709
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 64 rules applied. Total rules applied 127 place count 395 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 394 transition count 706
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 128 place count 394 transition count 674
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 192 place count 362 transition count 674
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 216 place count 338 transition count 644
Iterating global reduction 3 with 24 rules applied. Total rules applied 240 place count 338 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 243 place count 338 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 337 transition count 641
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 244 place count 337 transition count 638
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 250 place count 334 transition count 638
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 257 place count 327 transition count 629
Iterating global reduction 5 with 7 rules applied. Total rules applied 264 place count 327 transition count 629
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 5 with 2 rules applied. Total rules applied 266 place count 327 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 267 place count 326 transition count 627
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 270 place count 323 transition count 620
Iterating global reduction 7 with 3 rules applied. Total rules applied 273 place count 323 transition count 620
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 275 place count 321 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 277 place count 321 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 279 place count 319 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 281 place count 319 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 282 place count 318 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 283 place count 318 transition count 608
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 284 place count 317 transition count 605
Iterating global reduction 7 with 1 rules applied. Total rules applied 285 place count 317 transition count 605
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 286 place count 316 transition count 603
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 316 transition count 603
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 288 place count 315 transition count 601
Iterating global reduction 7 with 1 rules applied. Total rules applied 289 place count 315 transition count 601
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 290 place count 314 transition count 599
Iterating global reduction 7 with 1 rules applied. Total rules applied 291 place count 314 transition count 599
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 333 place count 293 transition count 578
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 335 place count 291 transition count 574
Iterating global reduction 7 with 2 rules applied. Total rules applied 337 place count 291 transition count 574
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 338 place count 291 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 339 place count 290 transition count 573
Applied a total of 339 rules in 131 ms. Remains 290 /469 variables (removed 179) and now considering 573/780 (removed 207) transitions.
[2024-06-03 00:12:48] [INFO ] Flow matrix only has 568 transitions (discarded 5 similar events)
// Phase 1: matrix 568 rows 290 cols
[2024-06-03 00:12:48] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:12:48] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-03 00:12:48] [INFO ] Flow matrix only has 568 transitions (discarded 5 similar events)
[2024-06-03 00:12:48] [INFO ] Invariant cache hit.
[2024-06-03 00:12:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 00:12:48] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-06-03 00:12:48] [INFO ] Redundant transitions in 29 ms returned []
Running 561 sub problems to find dead transitions.
[2024-06-03 00:12:48] [INFO ] Flow matrix only has 568 transitions (discarded 5 similar events)
[2024-06-03 00:12:48] [INFO ] Invariant cache hit.
[2024-06-03 00:12:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:12:51] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-06-03 00:12:52] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:12:52] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 0 ms to minimize.
[2024-06-03 00:12:53] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:12:54] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:12:55] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (OVERLAPS) 1/288 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-03 00:13:04] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (OVERLAPS) 567/855 variables, 288/307 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2024-06-03 00:13:19] [INFO ] Deduced a trap composed of 196 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30303ms
Starting structural reductions in SI_CTL mode, iteration 1 : 290/469 places, 573/780 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30926 ms. Remains : 290/469 places, 573/780 transitions.
[2024-06-03 00:13:19] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:13:19] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:13:19] [INFO ] Input system was already deterministic with 573 transitions.
[2024-06-03 00:13:19] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:13:19] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:13:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality11373951802665376437.gal : 4 ms
[2024-06-03 00:13:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9057762071786669249.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/CTLCardinality11373951802665376437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9057762071786669249.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-06-03 00:13:49] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:13:49] [INFO ] Applying decomposition
[2024-06-03 00:13:49] [INFO ] Flatten gal took : 14 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/graph9831482821221099016.txt' '-o' '/tmp/graph9831482821221099016.bin' '-w' '/tmp/graph9831482821221099016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9831482821221099016.bin' '-l' '-1' '-v' '-w' '/tmp/graph9831482821221099016.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:13:49] [INFO ] Decomposing Gal with order
[2024-06-03 00:13:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:13:49] [INFO ] Removed a total of 725 redundant transitions.
[2024-06-03 00:13:49] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:13:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 11 ms.
[2024-06-03 00:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1659352906884212287.gal : 5 ms
[2024-06-03 00:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10727092206970792783.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/CTLCardinality1659352906884212287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10727092206970792783.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 466 transition count 780
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 437 transition count 748
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 437 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 437 transition count 747
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 74 place count 425 transition count 729
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 425 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 425 transition count 728
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 423 transition count 724
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 423 transition count 724
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 421 transition count 718
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 421 transition count 718
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 419 transition count 714
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 419 transition count 714
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 417 transition count 708
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 417 transition count 708
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 415 transition count 704
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 415 transition count 704
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 413 transition count 698
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 413 transition count 698
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 411 transition count 694
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 411 transition count 694
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 409 transition count 688
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 409 transition count 688
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 407 transition count 684
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 407 transition count 684
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 405 transition count 678
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 405 transition count 678
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 403 transition count 674
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 403 transition count 674
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 401 transition count 670
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 401 transition count 670
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 399 transition count 666
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 399 transition count 666
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 397 transition count 664
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 397 transition count 664
Applied a total of 143 rules in 66 ms. Remains 397 /469 variables (removed 72) and now considering 664/780 (removed 116) transitions.
// Phase 1: matrix 664 rows 397 cols
[2024-06-03 00:14:19] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:14:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-03 00:14:19] [INFO ] Invariant cache hit.
[2024-06-03 00:14:19] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 663 sub problems to find dead transitions.
[2024-06-03 00:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:14:27] [INFO ] Deduced a trap composed of 238 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:14:27] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:14:28] [INFO ] Deduced a trap composed of 247 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:14:28] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:14:28] [INFO ] Deduced a trap composed of 234 places in 118 ms of which 3 ms to minimize.
[2024-06-03 00:14:28] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 2 ms to minimize.
[2024-06-03 00:14:28] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:14:28] [INFO ] Deduced a trap composed of 77 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:14:29] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:14:30] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2024-06-03 00:14:30] [INFO ] Deduced a trap composed of 79 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:14:31] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:14:35] [INFO ] Deduced a trap composed of 91 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (OVERLAPS) 664/1060 variables, 396/419 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/1061 variables, and 419 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 396/397 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:14:55] [INFO ] Deduced a trap composed of 80 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 253 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 239 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:15:00] [INFO ] Deduced a trap composed of 258 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:15:01] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:15:02] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:15:03] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:15:07] [INFO ] Deduced a trap composed of 238 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:15:07] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-06-03 00:15:07] [INFO ] Deduced a trap composed of 224 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:15:08] [INFO ] Deduced a trap composed of 227 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:15:14] [INFO ] Deduced a trap composed of 228 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1061 variables, and 37 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/397 constraints, PredecessorRefiner: 0/663 constraints, Known Traps: 27/27 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 397/469 places, 664/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60813 ms. Remains : 397/469 places, 664/780 transitions.
[2024-06-03 00:15:20] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:15:20] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:15:20] [INFO ] Input system was already deterministic with 664 transitions.
[2024-06-03 00:15:20] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:15:20] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:15:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7023630675230999676.gal : 3 ms
[2024-06-03 00:15:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality2984274627541992474.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/CTLCardinality7023630675230999676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2984274627541992474.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-06-03 00:15:50] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:15:50] [INFO ] Applying decomposition
[2024-06-03 00:15:50] [INFO ] Flatten gal took : 15 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/graph12500137398243600840.txt' '-o' '/tmp/graph12500137398243600840.bin' '-w' '/tmp/graph12500137398243600840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12500137398243600840.bin' '-l' '-1' '-v' '-w' '/tmp/graph12500137398243600840.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:15:50] [INFO ] Decomposing Gal with order
[2024-06-03 00:15:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:15:50] [INFO ] Removed a total of 720 redundant transitions.
[2024-06-03 00:15:50] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:15:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 11 ms.
[2024-06-03 00:15:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality1552692917584065997.gal : 14 ms
[2024-06-03 00:15:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality18425492675859638272.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/CTLCardinality1552692917584065997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18425492675859638272.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 466 transition count 780
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 433 transition count 742
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 433 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 433 transition count 741
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 82 place count 421 transition count 722
Iterating global reduction 2 with 12 rules applied. Total rules applied 94 place count 421 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 421 transition count 721
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 418 transition count 714
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 418 transition count 714
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 416 transition count 709
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 416 transition count 709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 414 transition count 704
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 414 transition count 704
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 412 transition count 699
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 412 transition count 699
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 410 transition count 694
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 410 transition count 694
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 408 transition count 689
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 408 transition count 689
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 406 transition count 685
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 406 transition count 685
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 404 transition count 680
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 404 transition count 680
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 402 transition count 677
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 402 transition count 677
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 401 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 401 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 400 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 400 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 399 transition count 670
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 399 transition count 670
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 398 transition count 668
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 398 transition count 668
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 397 transition count 667
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 397 transition count 667
Applied a total of 143 rules in 63 ms. Remains 397 /469 variables (removed 72) and now considering 667/780 (removed 113) transitions.
// Phase 1: matrix 667 rows 397 cols
[2024-06-03 00:16:20] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:16:20] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-03 00:16:20] [INFO ] Invariant cache hit.
[2024-06-03 00:16:21] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2024-06-03 00:16:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:16:28] [INFO ] Deduced a trap composed of 239 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 4 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 221 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 230 places in 141 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 223 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 236 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 228 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 223 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 234 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 240 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:16:31] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2024-06-03 00:16:32] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:16:33] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:16:33] [INFO ] Deduced a trap composed of 226 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:16:33] [INFO ] Deduced a trap composed of 241 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:16:33] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:16:34] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:16:34] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:16:35] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:16:36] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 5 (OVERLAPS) 667/1063 variables, 396/430 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:16:51] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1064 variables, and 431 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 396/397 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (OVERLAPS) 667/1063 variables, 396/431 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1063 variables, 659/1090 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:17:06] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:17:07] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 3 ms to minimize.
[2024-06-03 00:17:08] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:17:08] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:17:12] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1064 variables, and 1095 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 396/397 constraints, PredecessorRefiner: 659/666 constraints, Known Traps: 30/30 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Starting structural reductions in LTL mode, iteration 1 : 397/469 places, 667/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60873 ms. Remains : 397/469 places, 667/780 transitions.
[2024-06-03 00:17:21] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:17:21] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:17:21] [INFO ] Input system was already deterministic with 667 transitions.
[2024-06-03 00:17:21] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:17:21] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:17:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3392348470722346787.gal : 4 ms
[2024-06-03 00:17:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1375863437789381216.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/CTLCardinality3392348470722346787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1375863437789381216.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-06-03 00:17:51] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:17:51] [INFO ] Applying decomposition
[2024-06-03 00:17:51] [INFO ] Flatten gal took : 14 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/graph6941863163001615936.txt' '-o' '/tmp/graph6941863163001615936.bin' '-w' '/tmp/graph6941863163001615936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6941863163001615936.bin' '-l' '-1' '-v' '-w' '/tmp/graph6941863163001615936.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:17:51] [INFO ] Decomposing Gal with order
[2024-06-03 00:17:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:17:51] [INFO ] Removed a total of 733 redundant transitions.
[2024-06-03 00:17:51] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:17:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 6 ms.
[2024-06-03 00:17:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6344193942900731835.gal : 5 ms
[2024-06-03 00:17:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8272357844423964830.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/CTLCardinality6344193942900731835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8272357844423964830.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 37 place count 432 transition count 742
Iterating global reduction 1 with 33 rules applied. Total rules applied 70 place count 432 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 432 transition count 741
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 418 transition count 720
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 418 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 418 transition count 719
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 413 transition count 709
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 413 transition count 709
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 410 transition count 701
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 410 transition count 701
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 407 transition count 694
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 407 transition count 694
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 405 transition count 689
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 405 transition count 689
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 403 transition count 684
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 403 transition count 684
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 401 transition count 679
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 401 transition count 679
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 399 transition count 675
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 399 transition count 675
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 397 transition count 670
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 397 transition count 670
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 395 transition count 667
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 395 transition count 667
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 394 transition count 664
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 394 transition count 664
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 393 transition count 662
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 393 transition count 662
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 392 transition count 660
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 392 transition count 660
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 391 transition count 658
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 391 transition count 658
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 390 transition count 657
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 390 transition count 657
Applied a total of 156 rules in 69 ms. Remains 390 /469 variables (removed 79) and now considering 657/780 (removed 123) transitions.
// Phase 1: matrix 657 rows 390 cols
[2024-06-03 00:18:21] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:18:22] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 00:18:22] [INFO ] Invariant cache hit.
[2024-06-03 00:18:22] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 656 sub problems to find dead transitions.
[2024-06-03 00:18:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-06-03 00:18:29] [INFO ] Deduced a trap composed of 232 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:18:30] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:18:30] [INFO ] Deduced a trap composed of 220 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:18:30] [INFO ] Deduced a trap composed of 231 places in 125 ms of which 3 ms to minimize.
[2024-06-03 00:18:30] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 2 ms to minimize.
[2024-06-03 00:18:30] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:18:30] [INFO ] Deduced a trap composed of 230 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:18:31] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-06-03 00:18:31] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 3 ms to minimize.
[2024-06-03 00:18:31] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 3 ms to minimize.
[2024-06-03 00:18:31] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:18:31] [INFO ] Deduced a trap composed of 224 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:18:31] [INFO ] Deduced a trap composed of 129 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:18:31] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 3 ms to minimize.
[2024-06-03 00:18:32] [INFO ] Deduced a trap composed of 229 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:18:32] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:18:32] [INFO ] Deduced a trap composed of 221 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:18:32] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:18:32] [INFO ] Deduced a trap composed of 222 places in 120 ms of which 3 ms to minimize.
[2024-06-03 00:18:33] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-06-03 00:18:34] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:18:34] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:18:34] [INFO ] Deduced a trap composed of 228 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:18:34] [INFO ] Deduced a trap composed of 229 places in 122 ms of which 3 ms to minimize.
[2024-06-03 00:18:36] [INFO ] Deduced a trap composed of 90 places in 44 ms of which 0 ms to minimize.
[2024-06-03 00:18:37] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:18:38] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 4 ms to minimize.
[2024-06-03 00:18:39] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:18:39] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-06-03 00:18:44] [INFO ] Deduced a trap composed of 239 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:18:44] [INFO ] Deduced a trap composed of 227 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-06-03 00:18:50] [INFO ] Deduced a trap composed of 232 places in 131 ms of which 2 ms to minimize.
[2024-06-03 00:18:50] [INFO ] Deduced a trap composed of 229 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:18:50] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:18:51] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-03 00:18:51] [INFO ] Deduced a trap composed of 234 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/1047 variables, and 46 constraints, problems are : Problem set: 0 solved, 656 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/390 constraints, PredecessorRefiner: 656/656 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-06-03 00:18:56] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2024-06-03 00:18:56] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-06-03 00:19:03] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 6 (OVERLAPS) 657/1047 variables, 390/439 constraints. Problems are: Problem set: 0 solved, 656 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1047 variables, 656/1095 constraints. Problems are: Problem set: 0 solved, 656 unsolved
[2024-06-03 00:19:21] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 1096 constraints, problems are : Problem set: 0 solved, 656 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 656/656 constraints, Known Traps: 40/40 constraints]
After SMT, in 60262ms problems are : Problem set: 0 solved, 656 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 390/469 places, 657/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60874 ms. Remains : 390/469 places, 657/780 transitions.
[2024-06-03 00:19:22] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:19:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:19:22] [INFO ] Input system was already deterministic with 657 transitions.
[2024-06-03 00:19:22] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:19:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:19:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality10553184935988894174.gal : 2 ms
[2024-06-03 00:19:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality3058526574793232244.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/CTLCardinality10553184935988894174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3058526574793232244.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-06-03 00:19:52] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:19:52] [INFO ] Applying decomposition
[2024-06-03 00:19:52] [INFO ] Flatten gal took : 13 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/graph10245480733905302028.txt' '-o' '/tmp/graph10245480733905302028.bin' '-w' '/tmp/graph10245480733905302028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10245480733905302028.bin' '-l' '-1' '-v' '-w' '/tmp/graph10245480733905302028.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:19:52] [INFO ] Decomposing Gal with order
[2024-06-03 00:19:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:19:52] [INFO ] Removed a total of 719 redundant transitions.
[2024-06-03 00:19:52] [INFO ] Flatten gal took : 39 ms
[2024-06-03 00:19:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-06-03 00:19:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7748157286884223222.gal : 7 ms
[2024-06-03 00:19:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality9156688415195096617.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/CTLCardinality7748157286884223222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9156688415195096617.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 35 place count 434 transition count 745
Iterating global reduction 1 with 31 rules applied. Total rules applied 66 place count 434 transition count 745
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 434 transition count 744
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 423 transition count 727
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 423 transition count 727
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 94 place count 418 transition count 717
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 418 transition count 717
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 415 transition count 709
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 415 transition count 709
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 412 transition count 702
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 412 transition count 702
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 409 transition count 694
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 409 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 407 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 407 transition count 690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 405 transition count 684
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 405 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 403 transition count 680
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 403 transition count 680
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 401 transition count 674
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 401 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 399 transition count 670
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 399 transition count 670
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 397 transition count 664
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 397 transition count 664
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 395 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 395 transition count 660
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 393 transition count 656
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 393 transition count 656
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 391 transition count 652
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 391 transition count 652
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 389 transition count 650
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 389 transition count 650
Applied a total of 157 rules in 64 ms. Remains 389 /469 variables (removed 80) and now considering 650/780 (removed 130) transitions.
// Phase 1: matrix 650 rows 389 cols
[2024-06-03 00:20:23] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:20:23] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-03 00:20:23] [INFO ] Invariant cache hit.
[2024-06-03 00:20:23] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 649 sub problems to find dead transitions.
[2024-06-03 00:20:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (OVERLAPS) 1/389 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-03 00:20:31] [INFO ] Deduced a trap composed of 231 places in 143 ms of which 3 ms to minimize.
[2024-06-03 00:20:31] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-06-03 00:20:31] [INFO ] Deduced a trap composed of 223 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:20:31] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:20:31] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:20:32] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:20:32] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:20:33] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:20:34] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-03 00:20:37] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:20:37] [INFO ] Deduced a trap composed of 229 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:20:37] [INFO ] Deduced a trap composed of 224 places in 133 ms of which 3 ms to minimize.
[2024-06-03 00:20:38] [INFO ] Deduced a trap composed of 226 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:20:38] [INFO ] Deduced a trap composed of 230 places in 115 ms of which 3 ms to minimize.
[2024-06-03 00:20:39] [INFO ] Deduced a trap composed of 232 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:20:39] [INFO ] Deduced a trap composed of 233 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:20:39] [INFO ] Deduced a trap composed of 246 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:20:39] [INFO ] Deduced a trap composed of 222 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:20:40] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:20:40] [INFO ] Deduced a trap composed of 228 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:20:40] [INFO ] Deduced a trap composed of 248 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:20:41] [INFO ] Deduced a trap composed of 234 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:20:41] [INFO ] Deduced a trap composed of 246 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:20:41] [INFO ] Deduced a trap composed of 228 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:20:41] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:20:42] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:20:42] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:20:43] [INFO ] Deduced a trap composed of 236 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/389 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-03 00:20:49] [INFO ] Deduced a trap composed of 227 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 236 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:20:51] [INFO ] Deduced a trap composed of 233 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:20:52] [INFO ] Deduced a trap composed of 251 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:20:52] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 389/1039 variables, and 43 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/389 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (OVERLAPS) 1/389 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-03 00:20:58] [INFO ] Deduced a trap composed of 220 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:20:58] [INFO ] Deduced a trap composed of 220 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:20:58] [INFO ] Deduced a trap composed of 225 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:20:59] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:21:01] [INFO ] Deduced a trap composed of 224 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:21:01] [INFO ] Deduced a trap composed of 222 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:21:01] [INFO ] Deduced a trap composed of 229 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:21:01] [INFO ] Deduced a trap composed of 231 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:21:01] [INFO ] Deduced a trap composed of 226 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:21:01] [INFO ] Deduced a trap composed of 232 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:21:02] [INFO ] Deduced a trap composed of 233 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:21:02] [INFO ] Deduced a trap composed of 228 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:21:02] [INFO ] Deduced a trap composed of 224 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:21:02] [INFO ] Deduced a trap composed of 221 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/389 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-03 00:21:07] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 0 ms to minimize.
[2024-06-03 00:21:07] [INFO ] Deduced a trap composed of 98 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:21:08] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-03 00:21:14] [INFO ] Deduced a trap composed of 225 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:21:15] [INFO ] Deduced a trap composed of 248 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:21:15] [INFO ] Deduced a trap composed of 260 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-06-03 00:21:19] [INFO ] Deduced a trap composed of 222 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:21:19] [INFO ] Deduced a trap composed of 225 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:21:19] [INFO ] Deduced a trap composed of 223 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:21:19] [INFO ] Deduced a trap composed of 224 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/1039 variables, and 67 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/389 constraints, PredecessorRefiner: 0/649 constraints, Known Traps: 57/57 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 389/469 places, 650/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60789 ms. Remains : 389/469 places, 650/780 transitions.
[2024-06-03 00:21:23] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:21:23] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:21:23] [INFO ] Input system was already deterministic with 650 transitions.
[2024-06-03 00:21:23] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:21:23] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:21:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2563972171210559394.gal : 7 ms
[2024-06-03 00:21:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8837724178923464616.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/CTLCardinality2563972171210559394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8837724178923464616.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-06-03 00:21:54] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:21:54] [INFO ] Applying decomposition
[2024-06-03 00:21:54] [INFO ] Flatten gal took : 13 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/graph2130357946555918156.txt' '-o' '/tmp/graph2130357946555918156.bin' '-w' '/tmp/graph2130357946555918156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2130357946555918156.bin' '-l' '-1' '-v' '-w' '/tmp/graph2130357946555918156.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:21:54] [INFO ] Decomposing Gal with order
[2024-06-03 00:21:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:21:54] [INFO ] Removed a total of 709 redundant transitions.
[2024-06-03 00:21:54] [INFO ] Flatten gal took : 22 ms
[2024-06-03 00:21:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2024-06-03 00:21:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality12499625459081644161.gal : 3 ms
[2024-06-03 00:21:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18137661858441711787.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/CTLCardinality12499625459081644161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18137661858441711787.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 379 transition count 632
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 379 transition count 632
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 377 transition count 630
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 377 transition count 630
Applied a total of 182 rules in 65 ms. Remains 377 /469 variables (removed 92) and now considering 630/780 (removed 150) transitions.
// Phase 1: matrix 630 rows 377 cols
[2024-06-03 00:22:24] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:22:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 00:22:24] [INFO ] Invariant cache hit.
[2024-06-03 00:22:24] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 629 sub problems to find dead transitions.
[2024-06-03 00:22:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 243 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 227 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 215 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:22:32] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 0 ms to minimize.
[2024-06-03 00:22:34] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-06-03 00:22:35] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:22:38] [INFO ] Deduced a trap composed of 214 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:22:39] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (OVERLAPS) 630/1007 variables, 377/399 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:22:53] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:22:54] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 401 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 630/1007 variables, 377/401 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 629/1030 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:23:08] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:23:09] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:23:09] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:23:09] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:23:10] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1035 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 19/19 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 377/469 places, 630/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60828 ms. Remains : 377/469 places, 630/780 transitions.
[2024-06-03 00:23:25] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:23:25] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:23:25] [INFO ] Input system was already deterministic with 630 transitions.
[2024-06-03 00:23:25] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:23:25] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:23:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9128036602395730787.gal : 2 ms
[2024-06-03 00:23:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality8098317273700306784.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/CTLCardinality9128036602395730787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8098317273700306784.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-06-03 00:23:55] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:23:55] [INFO ] Applying decomposition
[2024-06-03 00:23:55] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3935028051827042012.txt' '-o' '/tmp/graph3935028051827042012.bin' '-w' '/tmp/graph3935028051827042012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3935028051827042012.bin' '-l' '-1' '-v' '-w' '/tmp/graph3935028051827042012.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:23:55] [INFO ] Decomposing Gal with order
[2024-06-03 00:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:23:55] [INFO ] Removed a total of 687 redundant transitions.
[2024-06-03 00:23:55] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:23:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2024-06-03 00:23:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8460116157147869554.gal : 4 ms
[2024-06-03 00:23:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality9309307500634341611.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/CTLCardinality8460116157147869554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9309307500634341611.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Graph (trivial) has 327 edges and 469 vertex of which 11 / 469 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1444 edges and 461 vertex of which 457 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 456 transition count 702
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 72 rules applied. Total rules applied 142 place count 388 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 387 transition count 698
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 143 place count 387 transition count 666
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 207 place count 355 transition count 666
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 233 place count 329 transition count 633
Iterating global reduction 3 with 26 rules applied. Total rules applied 259 place count 329 transition count 633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 262 place count 329 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 328 transition count 630
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 263 place count 328 transition count 626
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 271 place count 324 transition count 626
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 279 place count 316 transition count 615
Iterating global reduction 5 with 8 rules applied. Total rules applied 287 place count 316 transition count 615
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 5 with 2 rules applied. Total rules applied 289 place count 316 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 315 transition count 613
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 294 place count 311 transition count 604
Iterating global reduction 7 with 4 rules applied. Total rules applied 298 place count 311 transition count 604
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 301 place count 308 transition count 596
Iterating global reduction 7 with 3 rules applied. Total rules applied 304 place count 308 transition count 596
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 307 place count 305 transition count 589
Iterating global reduction 7 with 3 rules applied. Total rules applied 310 place count 305 transition count 589
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 313 place count 302 transition count 581
Iterating global reduction 7 with 3 rules applied. Total rules applied 316 place count 302 transition count 581
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 319 place count 299 transition count 574
Iterating global reduction 7 with 3 rules applied. Total rules applied 322 place count 299 transition count 574
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 325 place count 296 transition count 566
Iterating global reduction 7 with 3 rules applied. Total rules applied 328 place count 296 transition count 566
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 331 place count 293 transition count 560
Iterating global reduction 7 with 3 rules applied. Total rules applied 334 place count 293 transition count 560
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 337 place count 290 transition count 552
Iterating global reduction 7 with 3 rules applied. Total rules applied 340 place count 290 transition count 552
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 342 place count 288 transition count 548
Iterating global reduction 7 with 2 rules applied. Total rules applied 344 place count 288 transition count 548
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 346 place count 286 transition count 542
Iterating global reduction 7 with 2 rules applied. Total rules applied 348 place count 286 transition count 542
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 350 place count 284 transition count 538
Iterating global reduction 7 with 2 rules applied. Total rules applied 352 place count 284 transition count 538
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 354 place count 282 transition count 534
Iterating global reduction 7 with 2 rules applied. Total rules applied 356 place count 282 transition count 534
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 358 place count 280 transition count 530
Iterating global reduction 7 with 2 rules applied. Total rules applied 360 place count 280 transition count 530
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 402 place count 259 transition count 509
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 404 place count 257 transition count 505
Iterating global reduction 7 with 2 rules applied. Total rules applied 406 place count 257 transition count 505
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 256 transition count 504
Applied a total of 407 rules in 98 ms. Remains 256 /469 variables (removed 213) and now considering 504/780 (removed 276) transitions.
[2024-06-03 00:24:25] [INFO ] Flow matrix only has 499 transitions (discarded 5 similar events)
// Phase 1: matrix 499 rows 256 cols
[2024-06-03 00:24:25] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:24:25] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-03 00:24:25] [INFO ] Flow matrix only has 499 transitions (discarded 5 similar events)
[2024-06-03 00:24:25] [INFO ] Invariant cache hit.
[2024-06-03 00:24:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 00:24:25] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-03 00:24:25] [INFO ] Redundant transitions in 15 ms returned []
Running 491 sub problems to find dead transitions.
[2024-06-03 00:24:25] [INFO ] Flow matrix only has 499 transitions (discarded 5 similar events)
[2024-06-03 00:24:25] [INFO ] Invariant cache hit.
[2024-06-03 00:24:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-06-03 00:24:28] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:24:29] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-03 00:24:29] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-06-03 00:24:29] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:24:29] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 0 ms to minimize.
[2024-06-03 00:24:30] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:24:30] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:24:31] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-06-03 00:24:31] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (OVERLAPS) 498/751 variables, 253/272 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 7 (OVERLAPS) 3/754 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 (/ 1.0 2.0))
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 754/755 variables, and 278 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 256/256 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (OVERLAPS) 498/751 variables, 253/272 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 491/766 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-06-03 00:25:03] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 1/767 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 491 unsolved
SMT process timed out in 60230ms, After SMT, problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Starting structural reductions in SI_CTL mode, iteration 1 : 256/469 places, 504/780 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60865 ms. Remains : 256/469 places, 504/780 transitions.
[2024-06-03 00:25:26] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:25:26] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:25:26] [INFO ] Input system was already deterministic with 504 transitions.
[2024-06-03 00:25:26] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:25:26] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:25:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality11216566209756345042.gal : 2 ms
[2024-06-03 00:25:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality5152721142979111162.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/CTLCardinality11216566209756345042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5152721142979111162.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-06-03 00:25:56] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:25:56] [INFO ] Applying decomposition
[2024-06-03 00:25:56] [INFO ] Flatten gal took : 10 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/graph2833286625963913375.txt' '-o' '/tmp/graph2833286625963913375.bin' '-w' '/tmp/graph2833286625963913375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2833286625963913375.bin' '-l' '-1' '-v' '-w' '/tmp/graph2833286625963913375.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:25:56] [INFO ] Decomposing Gal with order
[2024-06-03 00:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:25:56] [INFO ] Removed a total of 626 redundant transitions.
[2024-06-03 00:25:56] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:25:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 5 ms.
[2024-06-03 00:25:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14489574022939429783.gal : 2 ms
[2024-06-03 00:25:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5082391842036741614.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/CTLCardinality14489574022939429783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5082391842036741614.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 403 transition count 687
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 403 transition count 687
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 401 transition count 682
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 401 transition count 682
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 399 transition count 677
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 397 transition count 673
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 397 transition count 673
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 395 transition count 668
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 395 transition count 668
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 393 transition count 665
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 393 transition count 665
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 392 transition count 662
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 392 transition count 662
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 391 transition count 660
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 391 transition count 660
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 390 transition count 658
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 390 transition count 658
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 389 transition count 656
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 389 transition count 656
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 388 transition count 655
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 388 transition count 655
Applied a total of 160 rules in 65 ms. Remains 388 /469 variables (removed 81) and now considering 655/780 (removed 125) transitions.
// Phase 1: matrix 655 rows 388 cols
[2024-06-03 00:26:26] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:26:26] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-03 00:26:26] [INFO ] Invariant cache hit.
[2024-06-03 00:26:27] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 654 sub problems to find dead transitions.
[2024-06-03 00:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-03 00:26:34] [INFO ] Deduced a trap composed of 227 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:26:35] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:26:35] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:26:35] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:26:35] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:26:35] [INFO ] Deduced a trap composed of 92 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:26:36] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:26:37] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:26:37] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:26:38] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-03 00:26:41] [INFO ] Deduced a trap composed of 219 places in 132 ms of which 3 ms to minimize.
[2024-06-03 00:26:42] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:26:44] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-03 00:26:52] [INFO ] Deduced a trap composed of 225 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:26:52] [INFO ] Deduced a trap composed of 245 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:26:52] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:26:52] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:26:52] [INFO ] Deduced a trap composed of 227 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:26:52] [INFO ] Deduced a trap composed of 225 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:26:53] [INFO ] Deduced a trap composed of 226 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:26:53] [INFO ] Deduced a trap composed of 223 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:26:53] [INFO ] Deduced a trap composed of 224 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:26:53] [INFO ] Deduced a trap composed of 223 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:26:53] [INFO ] Deduced a trap composed of 223 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:26:54] [INFO ] Deduced a trap composed of 219 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:26:54] [INFO ] Deduced a trap composed of 223 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:26:54] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 2 ms to minimize.
[2024-06-03 00:26:54] [INFO ] Deduced a trap composed of 232 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:26:55] [INFO ] Deduced a trap composed of 221 places in 109 ms of which 1 ms to minimize.
[2024-06-03 00:26:55] [INFO ] Deduced a trap composed of 225 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:26:56] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:26:56] [INFO ] Deduced a trap composed of 221 places in 119 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1043 variables, and 42 constraints, problems are : Problem set: 0 solved, 654 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/388 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 654 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-03 00:27:01] [INFO ] Deduced a trap composed of 222 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:27:01] [INFO ] Deduced a trap composed of 222 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:27:01] [INFO ] Deduced a trap composed of 220 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:27:02] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 3 ms to minimize.
[2024-06-03 00:27:02] [INFO ] Deduced a trap composed of 228 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:27:02] [INFO ] Deduced a trap composed of 235 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 243 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 234 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 246 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 253 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 240 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 244 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 247 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:27:03] [INFO ] Deduced a trap composed of 251 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 5 (OVERLAPS) 655/1043 variables, 388/444 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 654/1098 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1043/1043 variables, and 1098 constraints, problems are : Problem set: 0 solved, 654 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 46/46 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 654 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in LTL mode, iteration 1 : 388/469 places, 655/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60823 ms. Remains : 388/469 places, 655/780 transitions.
[2024-06-03 00:27:27] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:27:27] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:27:27] [INFO ] Input system was already deterministic with 655 transitions.
[2024-06-03 00:27:27] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:27:27] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:27:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12240882483306758568.gal : 2 ms
[2024-06-03 00:27:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1553575189055466995.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/CTLCardinality12240882483306758568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1553575189055466995.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-06-03 00:27:57] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:27:57] [INFO ] Applying decomposition
[2024-06-03 00:27:57] [INFO ] Flatten gal took : 14 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/graph5504612353553755715.txt' '-o' '/tmp/graph5504612353553755715.bin' '-w' '/tmp/graph5504612353553755715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5504612353553755715.bin' '-l' '-1' '-v' '-w' '/tmp/graph5504612353553755715.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:27:57] [INFO ] Decomposing Gal with order
[2024-06-03 00:27:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:27:57] [INFO ] Removed a total of 720 redundant transitions.
[2024-06-03 00:27:57] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:27:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 6 ms.
[2024-06-03 00:27:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17147541032392755510.gal : 4 ms
[2024-06-03 00:27:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7621138289640248770.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/CTLCardinality17147541032392755510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7621138289640248770.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 379 transition count 632
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 379 transition count 632
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 377 transition count 630
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 377 transition count 630
Applied a total of 182 rules in 65 ms. Remains 377 /469 variables (removed 92) and now considering 630/780 (removed 150) transitions.
// Phase 1: matrix 630 rows 377 cols
[2024-06-03 00:28:27] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 00:28:27] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 00:28:27] [INFO ] Invariant cache hit.
[2024-06-03 00:28:28] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 629 sub problems to find dead transitions.
[2024-06-03 00:28:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:28:35] [INFO ] Deduced a trap composed of 243 places in 116 ms of which 3 ms to minimize.
[2024-06-03 00:28:35] [INFO ] Deduced a trap composed of 227 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:28:35] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:28:35] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:28:35] [INFO ] Deduced a trap composed of 215 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:28:36] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:28:36] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 0 ms to minimize.
[2024-06-03 00:28:36] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:28:38] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:28:38] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:28:41] [INFO ] Deduced a trap composed of 214 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:28:42] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (OVERLAPS) 630/1007 variables, 377/399 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:28:57] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:28:58] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 401 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 630/1007 variables, 377/401 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 629/1030 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:29:12] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 3 ms to minimize.
[2024-06-03 00:29:12] [INFO ] Deduced a trap composed of 121 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:29:13] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:29:13] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:29:14] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1035 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 19/19 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 377/469 places, 630/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60833 ms. Remains : 377/469 places, 630/780 transitions.
[2024-06-03 00:29:28] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:29:28] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:29:28] [INFO ] Input system was already deterministic with 630 transitions.
[2024-06-03 00:29:28] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:29:28] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:29:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15476066750022318570.gal : 3 ms
[2024-06-03 00:29:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14236973446929325642.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/CTLCardinality15476066750022318570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14236973446929325642.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-06-03 00:29:58] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:29:58] [INFO ] Applying decomposition
[2024-06-03 00:29:58] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13336496574289677430.txt' '-o' '/tmp/graph13336496574289677430.bin' '-w' '/tmp/graph13336496574289677430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13336496574289677430.bin' '-l' '-1' '-v' '-w' '/tmp/graph13336496574289677430.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:29:58] [INFO ] Decomposing Gal with order
[2024-06-03 00:29:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:29:58] [INFO ] Removed a total of 682 redundant transitions.
[2024-06-03 00:29:58] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:29:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-06-03 00:29:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5218382493101234714.gal : 4 ms
[2024-06-03 00:29:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2190870766216567856.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/CTLCardinality5218382493101234714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2190870766216567856.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 379 transition count 632
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 379 transition count 632
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 377 transition count 630
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 377 transition count 630
Applied a total of 182 rules in 55 ms. Remains 377 /469 variables (removed 92) and now considering 630/780 (removed 150) transitions.
[2024-06-03 00:30:28] [INFO ] Invariant cache hit.
[2024-06-03 00:30:29] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-03 00:30:29] [INFO ] Invariant cache hit.
[2024-06-03 00:30:29] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 629 sub problems to find dead transitions.
[2024-06-03 00:30:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:30:36] [INFO ] Deduced a trap composed of 243 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:30:36] [INFO ] Deduced a trap composed of 227 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:30:36] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:30:36] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:30:36] [INFO ] Deduced a trap composed of 215 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:30:37] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:30:37] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:30:37] [INFO ] Deduced a trap composed of 76 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:30:39] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:30:39] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:30:42] [INFO ] Deduced a trap composed of 214 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:30:43] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (OVERLAPS) 630/1007 variables, 377/399 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:30:58] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:30:58] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 401 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 630/1007 variables, 377/401 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 629/1030 constraints. Problems are: Problem set: 0 solved, 629 unsolved
[2024-06-03 00:31:13] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 2 ms to minimize.
[2024-06-03 00:31:13] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 3 ms to minimize.
[2024-06-03 00:31:13] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:31:13] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:31:15] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1035 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 19/19 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 377/469 places, 630/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60833 ms. Remains : 377/469 places, 630/780 transitions.
[2024-06-03 00:31:29] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:31:29] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:31:29] [INFO ] Input system was already deterministic with 630 transitions.
[2024-06-03 00:31:29] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:31:29] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:31:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4557050189774939159.gal : 3 ms
[2024-06-03 00:31:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality10798207674329191065.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/CTLCardinality4557050189774939159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10798207674329191065.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-06-03 00:31:59] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:31:59] [INFO ] Applying decomposition
[2024-06-03 00:31:59] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10014105639566592849.txt' '-o' '/tmp/graph10014105639566592849.bin' '-w' '/tmp/graph10014105639566592849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10014105639566592849.bin' '-l' '-1' '-v' '-w' '/tmp/graph10014105639566592849.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:31:59] [INFO ] Decomposing Gal with order
[2024-06-03 00:31:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:31:59] [INFO ] Removed a total of 682 redundant transitions.
[2024-06-03 00:31:59] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:31:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 5 ms.
[2024-06-03 00:31:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality18364655105179259627.gal : 3 ms
[2024-06-03 00:31:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7303828374718499759.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/CTLCardinality18364655105179259627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7303828374718499759.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 37 place count 432 transition count 742
Iterating global reduction 1 with 33 rules applied. Total rules applied 70 place count 432 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 432 transition count 741
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 83 place count 420 transition count 723
Iterating global reduction 2 with 12 rules applied. Total rules applied 95 place count 420 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 420 transition count 722
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 416 transition count 714
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 416 transition count 714
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 413 transition count 706
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 413 transition count 706
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 410 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 410 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 407 transition count 691
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 407 transition count 691
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 404 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 404 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 401 transition count 676
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 401 transition count 676
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 398 transition count 670
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 398 transition count 670
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 395 transition count 662
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 395 transition count 662
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 392 transition count 657
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 392 transition count 657
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 390 transition count 651
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 390 transition count 651
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 388 transition count 647
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 388 transition count 647
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 386 transition count 643
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 386 transition count 643
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 384 transition count 639
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 384 transition count 639
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 382 transition count 637
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 382 transition count 637
Applied a total of 172 rules in 57 ms. Remains 382 /469 variables (removed 87) and now considering 637/780 (removed 143) transitions.
// Phase 1: matrix 637 rows 382 cols
[2024-06-03 00:32:30] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 00:32:30] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-03 00:32:30] [INFO ] Invariant cache hit.
[2024-06-03 00:32:30] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 636 sub problems to find dead transitions.
[2024-06-03 00:32:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-03 00:32:37] [INFO ] Deduced a trap composed of 243 places in 112 ms of which 3 ms to minimize.
[2024-06-03 00:32:37] [INFO ] Deduced a trap composed of 261 places in 113 ms of which 3 ms to minimize.
[2024-06-03 00:32:38] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:32:38] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:32:38] [INFO ] Deduced a trap composed of 219 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:32:39] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 4 ms to minimize.
[2024-06-03 00:32:40] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:32:40] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:32:40] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:32:41] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:32:41] [INFO ] Deduced a trap composed of 80 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:32:41] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-03 00:32:44] [INFO ] Deduced a trap composed of 218 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:32:44] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:32:45] [INFO ] Deduced a trap composed of 149 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:32:45] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:32:48] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-03 00:32:53] [INFO ] Deduced a trap composed of 219 places in 125 ms of which 6 ms to minimize.
[2024-06-03 00:32:53] [INFO ] Deduced a trap composed of 237 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:32:53] [INFO ] Deduced a trap composed of 224 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:32:53] [INFO ] Deduced a trap composed of 218 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:32:54] [INFO ] Deduced a trap composed of 219 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:32:54] [INFO ] Deduced a trap composed of 229 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:32:55] [INFO ] Deduced a trap composed of 232 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:32:55] [INFO ] Deduced a trap composed of 226 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:32:56] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:32:56] [INFO ] Deduced a trap composed of 228 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:32:56] [INFO ] Deduced a trap composed of 232 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:32:56] [INFO ] Deduced a trap composed of 226 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:32:56] [INFO ] Deduced a trap composed of 225 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:32:57] [INFO ] Deduced a trap composed of 220 places in 112 ms of which 2 ms to minimize.
[2024-06-03 00:32:57] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:32:57] [INFO ] Deduced a trap composed of 245 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-03 00:33:00] [INFO ] Deduced a trap composed of 236 places in 113 ms of which 3 ms to minimize.
SMT process timed out in 30301ms, After SMT, problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 30308ms
Starting structural reductions in LTL mode, iteration 1 : 382/469 places, 637/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30856 ms. Remains : 382/469 places, 637/780 transitions.
[2024-06-03 00:33:00] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:33:00] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:33:00] [INFO ] Input system was already deterministic with 637 transitions.
[2024-06-03 00:33:00] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:33:00] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:33:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17289474586614778605.gal : 2 ms
[2024-06-03 00:33:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality9520517944536716861.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/CTLCardinality17289474586614778605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9520517944536716861.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-06-03 00:33:30] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:33:30] [INFO ] Applying decomposition
[2024-06-03 00:33:30] [INFO ] Flatten gal took : 13 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/graph10953527808543960635.txt' '-o' '/tmp/graph10953527808543960635.bin' '-w' '/tmp/graph10953527808543960635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10953527808543960635.bin' '-l' '-1' '-v' '-w' '/tmp/graph10953527808543960635.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:33:31] [INFO ] Decomposing Gal with order
[2024-06-03 00:33:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:33:31] [INFO ] Removed a total of 672 redundant transitions.
[2024-06-03 00:33:31] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 5 ms.
[2024-06-03 00:33:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality2648709867403908036.gal : 4 ms
[2024-06-03 00:33:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality1755185975657202441.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/CTLCardinality2648709867403908036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1755185975657202441.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:34:01] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:34:01] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:34:01] [INFO ] Applying decomposition
[2024-06-03 00:34:01] [INFO ] Flatten gal took : 16 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/graph12018966066075277089.txt' '-o' '/tmp/graph12018966066075277089.bin' '-w' '/tmp/graph12018966066075277089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12018966066075277089.bin' '-l' '-1' '-v' '-w' '/tmp/graph12018966066075277089.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:34:01] [INFO ] Decomposing Gal with order
[2024-06-03 00:34:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:34:01] [INFO ] Removed a total of 846 redundant transitions.
[2024-06-03 00:34:01] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:34:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2024-06-03 00:34:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1765633601427617814.gal : 4 ms
[2024-06-03 00:34:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality12876167354221135373.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/CTLCardinality1765633601427617814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12876167354221135373.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 00:41:30] [INFO ] Applying decomposition
[2024-06-03 00:41:30] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:41:30] [INFO ] Decomposing Gal with order
[2024-06-03 00:41:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:41:30] [INFO ] Removed a total of 620 redundant transitions.
[2024-06-03 00:41:30] [INFO ] Flatten gal took : 34 ms
[2024-06-03 00:41:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 629 labels/synchronizations in 5 ms.
[2024-06-03 00:41:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8323162275299718739.gal : 3 ms
[2024-06-03 00:41:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality3528018105234471711.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/CTLCardinality8323162275299718739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3528018105234471711.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 00:52:11] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:52:11] [INFO ] Input system was already deterministic with 780 transitions.
[2024-06-03 00:52:11] [INFO ] Transformed 469 places.
[2024-06-03 00:52:11] [INFO ] Transformed 780 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-03 00:52:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality12467073610958279594.gal : 3 ms
[2024-06-03 00:52:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality11531352179412860897.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/CTLCardinality12467073610958279594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11531352179412860897.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3597464 ms.
BK_STOP 1717376575663
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="FireWire-PT-20"
export BK_EXAMINATION="CTLCardinality"
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 FireWire-PT-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899100321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;