About the Execution of ITS-Tools for FireWire-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6878.668 | 3600000.00 | 3772212.00 | 9393.20 | T?F???T?????TFT? | 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-171734898900266.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-13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900266
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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-13-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717364247066
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 21:37:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:37:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:37:28] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 21:37:28] [INFO ] Transformed 205 places.
[2024-06-02 21:37:28] [INFO ] Transformed 610 transitions.
[2024-06-02 21:37:28] [INFO ] Found NUPN structural information;
[2024-06-02 21:37:28] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Support contains 88 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 203 transition count 538
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 203 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 203 transition count 537
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 202 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 202 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 202 transition count 528
Applied a total of 13 rules in 55 ms. Remains 202 /205 variables (removed 3) and now considering 528/542 (removed 14) transitions.
[2024-06-02 21:37:28] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
// Phase 1: matrix 496 rows 202 cols
[2024-06-02 21:37:28] [INFO ] Computed 10 invariants in 10 ms
[2024-06-02 21:37:28] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-06-02 21:37:28] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
[2024-06-02 21:37:28] [INFO ] Invariant cache hit.
[2024-06-02 21:37:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 21:37:29] [INFO ] Implicit Places using invariants and state equation in 436 ms returned [21, 85, 149]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 744 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/205 places, 528/542 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 826 ms. Remains : 199/205 places, 528/542 transitions.
Support contains 88 out of 199 places after structural reductions.
[2024-06-02 21:37:29] [INFO ] Flatten gal took : 63 ms
[2024-06-02 21:37:29] [INFO ] Flatten gal took : 38 ms
[2024-06-02 21:37:29] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 85 out of 199 places (down from 88) after GAL structural reductions.
RANDOM walk for 40000 steps (1166 resets) in 3439 ms. (11 steps per ms) remains 35/71 properties
BEST_FIRST walk for 4003 steps (23 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (23 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 54 ms. (72 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (24 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (23 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (25 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (26 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (24 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 57 ms. (69 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
[2024-06-02 21:37:31] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
// Phase 1: matrix 496 rows 199 cols
[2024-06-02 21:37:31] [INFO ] Computed 7 invariants in 23 ms
[2024-06-02 21:37:31] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 124/177 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 24 unsolved
[2024-06-02 21:37:31] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 9 ms to minimize.
[2024-06-02 21:37:31] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2024-06-02 21:37:31] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/7 constraints. Problems are: Problem set: 9 solved, 24 unsolved
[2024-06-02 21:37:32] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 9/186 variables, 3/11 constraints. Problems are: Problem set: 9 solved, 24 unsolved
[2024-06-02 21:37:32] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:37:32] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:37:32] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 3/14 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/14 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 485/671 variables, 186/200 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 70/270 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/270 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 23/694 variables, 13/283 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 1/284 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/284 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 1/695 variables, 1/285 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/695 variables, 0/285 constraints. Problems are: Problem set: 9 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 0/695 variables, 0/285 constraints. Problems are: Problem set: 9 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 285 constraints, problems are : Problem set: 9 solved, 24 unsolved in 2964 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 199/199 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 9 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 24 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 142/177 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 4/8 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 9/186 variables, 3/11 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 3/14 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/14 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 485/671 variables, 186/200 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 70/270 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 23/293 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/293 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 23/694 variables, 13/306 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 1/307 constraints. Problems are: Problem set: 10 solved, 23 unsolved
[2024-06-02 21:37:36] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:37:36] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 2/309 constraints. Problems are: Problem set: 10 solved, 23 unsolved
[2024-06-02 21:37:37] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/694 variables, 1/310 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/694 variables, 0/310 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 1/695 variables, 1/311 constraints. Problems are: Problem set: 10 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/695 variables, 0/311 constraints. Problems are: Problem set: 10 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 311 constraints, problems are : Problem set: 10 solved, 23 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 199/199 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 23/33 constraints, Known Traps: 10/10 constraints]
After SMT, in 8193ms problems are : Problem set: 10 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 528/528 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 199 transition count 525
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 199 transition count 522
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 196 transition count 522
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 195 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 195 transition count 520
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 194 transition count 517
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 194 transition count 517
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 193 transition count 515
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 193 transition count 515
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 192 transition count 512
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 192 transition count 512
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 191 transition count 510
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 191 transition count 510
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 190 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 190 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 189 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 189 transition count 505
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 1 with 6 rules applied. Total rules applied 29 place count 186 transition count 502
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 183 transition count 508
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 41 place count 183 transition count 502
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 183 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 182 transition count 498
Applied a total of 45 rules in 111 ms. Remains 182 /199 variables (removed 17) and now considering 498/528 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 182/199 places, 498/528 transitions.
RANDOM walk for 40000 steps (1287 resets) in 940 ms. (42 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (27 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (38 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (27 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (38 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 380289 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :6 out of 21
Probabilistic random walk after 380289 steps, saw 98462 distinct states, run finished after 3006 ms. (steps per millisecond=126 ) properties seen :6
[2024-06-02 21:37:42] [INFO ] Flow matrix only has 464 transitions (discarded 34 similar events)
// Phase 1: matrix 464 rows 182 cols
[2024-06-02 21:37:42] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:37:42] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 145/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 21:37:43] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 453/618 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 67/237 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 25/643 variables, 14/251 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 3/646 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 257 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1612 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 145/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 453/618 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 67/237 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 15/252 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 21:37:44] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 25/643 variables, 14/267 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 21:37:45] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/643 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 3/646 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 274 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2725 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
After SMT, in 4385ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 5546 ms.
Support contains 20 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 498/498 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 180 transition count 494
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 180 transition count 494
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 180 transition count 492
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 180 transition count 496
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 178 transition count 492
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 18 place count 178 transition count 488
Applied a total of 18 rules in 36 ms. Remains 178 /182 variables (removed 4) and now considering 488/498 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 178/182 places, 488/498 transitions.
RANDOM walk for 40000 steps (1311 resets) in 225 ms. (176 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (16 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (24 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (38 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 457142 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 15
Probabilistic random walk after 457142 steps, saw 119061 distinct states, run finished after 3002 ms. (steps per millisecond=152 ) properties seen :0
[2024-06-02 21:37:56] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
// Phase 1: matrix 452 rows 178 cols
[2024-06-02 21:37:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:37:56] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 141/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 21:37:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 441/602 variables, 161/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 67/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 25/627 variables, 14/247 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 3/630 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/630 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/630 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 253 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 141/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 441/602 variables, 161/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 67/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 25/627 variables, 14/262 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 3/630 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 21:37:59] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/630 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/630 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 269 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 3994ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 7260 ms.
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 488/488 transitions.
Applied a total of 0 rules in 12 ms. Remains 178 /178 variables (removed 0) and now considering 488/488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 178/178 places, 488/488 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 488/488 transitions.
Applied a total of 0 rules in 9 ms. Remains 178 /178 variables (removed 0) and now considering 488/488 (removed 0) transitions.
[2024-06-02 21:38:07] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
[2024-06-02 21:38:07] [INFO ] Invariant cache hit.
[2024-06-02 21:38:07] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-06-02 21:38:07] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
[2024-06-02 21:38:07] [INFO ] Invariant cache hit.
[2024-06-02 21:38:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 21:38:07] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-06-02 21:38:07] [INFO ] Redundant transitions in 28 ms returned []
Running 482 sub problems to find dead transitions.
[2024-06-02 21:38:07] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
[2024-06-02 21:38:07] [INFO ] Invariant cache hit.
[2024-06-02 21:38:07] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-02 21:38:10] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:38:10] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:38:10] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:38:10] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:38:10] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:38:11] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:38:11] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:38:12] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 452/630 variables, 178/193 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 67/260 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-02 21:38:18] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:38:18] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:38:20] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-02 21:38:26] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:38:26] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (OVERLAPS) 0/630 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 482 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 265 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 452/630 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 67/265 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 482/747 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (OVERLAPS) 0/630 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 482 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 747 constraints, problems are : Problem set: 0 solved, 482 unsolved in 29682 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 13/13 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60882 ms. Remains : 178/178 places, 488/488 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 178 vertex of which 31 / 178 are part of one of the 5 SCC in 2 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 151 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 151 transition count 332
Free-agglomeration rule applied 8 times with reduction of 5 identical transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 19 place count 151 transition count 319
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 30 place count 143 transition count 316
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 143 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 142 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 142 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 142 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 141 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 141 transition count 312
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 141 transition count 312
Applied a total of 43 rules in 48 ms. Remains 141 /178 variables (removed 37) and now considering 312/488 (removed 176) transitions.
Running SMT prover for 15 properties.
[2024-06-02 21:39:08] [INFO ] Flow matrix only has 310 transitions (discarded 2 similar events)
// Phase 1: matrix 310 rows 141 cols
[2024-06-02 21:39:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:39:08] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:39:08] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-06-02 21:39:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:39:09] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
TRAPS : Iteration 0
[2024-06-02 21:39:09] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:39:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-02 21:39:09] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:39:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 1
[2024-06-02 21:39:09] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:39:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
TRAPS : Iteration 2
[2024-06-02 21:39:10] [INFO ] After 1490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
[2024-06-02 21:39:10] [INFO ] After 1832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Over-approximation ignoring read arcs solved 0 properties in 2301 ms.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-13-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:39:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-02 21:39:10] [INFO ] Flatten gal took : 28 ms
FORMULA FireWire-PT-13-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:39:10] [INFO ] Flatten gal took : 26 ms
[2024-06-02 21:39:10] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 64 out of 199 places (down from 68) after GAL structural reductions.
Computed a total of 56 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 520
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 195 transition count 519
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 193 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 193 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 191 transition count 509
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 191 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 190 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 190 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 189 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 189 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 188 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 188 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 187 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 187 transition count 499
Applied a total of 25 rules in 20 ms. Remains 187 /199 variables (removed 12) and now considering 499/528 (removed 29) transitions.
[2024-06-02 21:39:10] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
// Phase 1: matrix 467 rows 187 cols
[2024-06-02 21:39:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:39:10] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-02 21:39:10] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 21:39:10] [INFO ] Invariant cache hit.
[2024-06-02 21:39:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 21:39:11] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 21:39:11] [INFO ] Flow matrix only has 467 transitions (discarded 32 similar events)
[2024-06-02 21:39:11] [INFO ] Invariant cache hit.
[2024-06-02 21:39:11] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 21:39:14] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:39:15] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:39:15] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:39:15] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 3 ms to minimize.
[2024-06-02 21:39:15] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:39:15] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:39:16] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:39:16] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:39:16] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:39:16] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:39:17] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:39:17] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 466/653 variables, 187/206 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/653 variables, 67/273 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/654 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 21:39:31] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 275 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 187/187 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 466/653 variables, 187/207 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/653 variables, 67/274 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 498/772 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 21:39:55] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 21:40:09] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/654 variables, and 774 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 187/187 constraints, ReadFeed: 67/68 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 15/15 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60443ms
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 499/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60941 ms. Remains : 187/199 places, 499/528 transitions.
[2024-06-02 21:40:11] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:40:11] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:40:11] [INFO ] Input system was already deterministic with 499 transitions.
[2024-06-02 21:40:11] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:40:11] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:40:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12338698581761396044.gal : 15 ms
[2024-06-02 21:40:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8758949678910512542.ctl : 8 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/CTLFireability12338698581761396044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8758949678910512542.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-02 21:40:41] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:40:41] [INFO ] Applying decomposition
[2024-06-02 21:40:41] [INFO ] Flatten gal took : 21 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/graph13723140180789667430.txt' '-o' '/tmp/graph13723140180789667430.bin' '-w' '/tmp/graph13723140180789667430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13723140180789667430.bin' '-l' '-1' '-v' '-w' '/tmp/graph13723140180789667430.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:40:42] [INFO ] Decomposing Gal with order
[2024-06-02 21:40:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:40:42] [INFO ] Removed a total of 801 redundant transitions.
[2024-06-02 21:40:42] [INFO ] Flatten gal took : 135 ms
[2024-06-02 21:40:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 19 ms.
[2024-06-02 21:40:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7744506880003545430.gal : 6 ms
[2024-06-02 21:40:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16944734573881733499.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/CTLFireability7744506880003545430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16944734573881733499.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 : 199/199 places, 528/528 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 520
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 195 transition count 518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 193 transition count 512
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 193 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 191 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 191 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 189 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 189 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 187 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 187 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 186 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 186 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 185 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 185 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 184 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 184 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 183 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 183 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 182 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 181 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 181 transition count 484
Applied a total of 38 rules in 42 ms. Remains 181 /199 variables (removed 18) and now considering 484/528 (removed 44) transitions.
[2024-06-02 21:41:12] [INFO ] Flow matrix only has 452 transitions (discarded 32 similar events)
// Phase 1: matrix 452 rows 181 cols
[2024-06-02 21:41:12] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:41:12] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 21:41:12] [INFO ] Flow matrix only has 452 transitions (discarded 32 similar events)
[2024-06-02 21:41:12] [INFO ] Invariant cache hit.
[2024-06-02 21:41:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 21:41:12] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 483 sub problems to find dead transitions.
[2024-06-02 21:41:12] [INFO ] Flow matrix only has 452 transitions (discarded 32 similar events)
[2024-06-02 21:41:12] [INFO ] Invariant cache hit.
[2024-06-02 21:41:12] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 2 ms to minimize.
[2024-06-02 21:41:16] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:41:17] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:41:17] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 451/632 variables, 181/196 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 65/261 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-02 21:41:26] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 8 (OVERLAPS) 1/633 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/633 variables, and 263 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 451/632 variables, 181/197 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 65/262 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 483/745 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-02 21:41:51] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:41:56] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:42:01] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/633 variables, and 748 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 65/66 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 12/12 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 483 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Starting structural reductions in LTL mode, iteration 1 : 181/199 places, 484/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 181/199 places, 484/528 transitions.
[2024-06-02 21:42:13] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:42:13] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:42:13] [INFO ] Input system was already deterministic with 484 transitions.
[2024-06-02 21:42:13] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:42:13] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:42:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13610902798461229263.gal : 3 ms
[2024-06-02 21:42:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17314474223989262665.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/CTLFireability13610902798461229263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17314474223989262665.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-02 21:42:43] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:42:43] [INFO ] Applying decomposition
[2024-06-02 21:42:43] [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/graph6041367439545053510.txt' '-o' '/tmp/graph6041367439545053510.bin' '-w' '/tmp/graph6041367439545053510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6041367439545053510.bin' '-l' '-1' '-v' '-w' '/tmp/graph6041367439545053510.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:42:43] [INFO ] Decomposing Gal with order
[2024-06-02 21:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:42:43] [INFO ] Removed a total of 785 redundant transitions.
[2024-06-02 21:42:43] [INFO ] Flatten gal took : 47 ms
[2024-06-02 21:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 14 ms.
[2024-06-02 21:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2611437142368897973.gal : 3 ms
[2024-06-02 21:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11191026051502113640.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/CTLFireability2611437142368897973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11191026051502113640.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 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 183 transition count 488
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 183 transition count 488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 181 transition count 482
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 181 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 180 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 180 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 179 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 178 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 178 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 177 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 177 transition count 472
Applied a total of 46 rules in 31 ms. Remains 177 /199 variables (removed 22) and now considering 472/528 (removed 56) transitions.
[2024-06-02 21:43:13] [INFO ] Flow matrix only has 440 transitions (discarded 32 similar events)
// Phase 1: matrix 440 rows 177 cols
[2024-06-02 21:43:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:43:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:43:13] [INFO ] Flow matrix only has 440 transitions (discarded 32 similar events)
[2024-06-02 21:43:13] [INFO ] Invariant cache hit.
[2024-06-02 21:43:13] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 21:43:14] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-02 21:43:14] [INFO ] Flow matrix only has 440 transitions (discarded 32 similar events)
[2024-06-02 21:43:14] [INFO ] Invariant cache hit.
[2024-06-02 21:43:14] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-02 21:43:17] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:43:17] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:43:17] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:43:17] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:43:19] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:43:19] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 439/616 variables, 177/194 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 61/255 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (OVERLAPS) 1/617 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 9 (OVERLAPS) 0/617 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 471 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 256 constraints, problems are : Problem set: 0 solved, 471 unsolved in 28641 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 439/616 variables, 177/194 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 61/255 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 471/726 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-02 21:43:52] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:43:56] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:44:00] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:44:02] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:44:02] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 5/731 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/617 variables, and 731 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 15/15 constraints]
After SMT, in 59008ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 59014ms
Starting structural reductions in LTL mode, iteration 1 : 177/199 places, 472/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59400 ms. Remains : 177/199 places, 472/528 transitions.
[2024-06-02 21:44:13] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:44:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:44:13] [INFO ] Input system was already deterministic with 472 transitions.
[2024-06-02 21:44:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:44:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:44:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17730468127686470851.gal : 5 ms
[2024-06-02 21:44:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10985129351914163705.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/CTLFireability17730468127686470851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10985129351914163705.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-02 21:44:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:44:43] [INFO ] Applying decomposition
[2024-06-02 21:44:43] [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/graph5970355592828958641.txt' '-o' '/tmp/graph5970355592828958641.bin' '-w' '/tmp/graph5970355592828958641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5970355592828958641.bin' '-l' '-1' '-v' '-w' '/tmp/graph5970355592828958641.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:44:43] [INFO ] Decomposing Gal with order
[2024-06-02 21:44:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:44:43] [INFO ] Removed a total of 750 redundant transitions.
[2024-06-02 21:44:43] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:44:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 9 ms.
[2024-06-02 21:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2215381287080545640.gal : 3 ms
[2024-06-02 21:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13272568643648980638.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/CTLFireability2215381287080545640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13272568643648980638.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 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 182 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 179 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 176 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 176 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 173 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 173 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 170 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 170 transition count 456
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 167 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 167 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 164 transition count 442
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 164 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 162 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 162 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 160 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 160 transition count 434
Applied a total of 80 rules in 25 ms. Remains 160 /199 variables (removed 39) and now considering 434/528 (removed 94) transitions.
[2024-06-02 21:45:13] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 160 cols
[2024-06-02 21:45:13] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:45:13] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:45:13] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 21:45:13] [INFO ] Invariant cache hit.
[2024-06-02 21:45:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:45:13] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-02 21:45:13] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 21:45:13] [INFO ] Invariant cache hit.
[2024-06-02 21:45:13] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 21:45:16] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:45:16] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:45:16] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:45:16] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:45:17] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:45:17] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:45:17] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:45:17] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:45:18] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 433 unsolved in 24008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 433/666 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 433 unsolved
SMT process timed out in 54297ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 54303ms
Starting structural reductions in LTL mode, iteration 1 : 160/199 places, 434/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54652 ms. Remains : 160/199 places, 434/528 transitions.
[2024-06-02 21:46:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:46:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:46:08] [INFO ] Input system was already deterministic with 434 transitions.
[2024-06-02 21:46:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:46:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:46:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15628800880015426220.gal : 3 ms
[2024-06-02 21:46:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14581819240923390883.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/CTLFireability15628800880015426220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14581819240923390883.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-02 21:46:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:46:38] [INFO ] Applying decomposition
[2024-06-02 21:46:38] [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/graph1255185791878389527.txt' '-o' '/tmp/graph1255185791878389527.bin' '-w' '/tmp/graph1255185791878389527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1255185791878389527.bin' '-l' '-1' '-v' '-w' '/tmp/graph1255185791878389527.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:46:38] [INFO ] Decomposing Gal with order
[2024-06-02 21:46:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:46:38] [INFO ] Removed a total of 677 redundant transitions.
[2024-06-02 21:46:38] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:46:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 8 ms.
[2024-06-02 21:46:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6389091380297771827.gal : 3 ms
[2024-06-02 21:46:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13221772019657757185.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/CTLFireability6389091380297771827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13221772019657757185.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 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 182 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 179 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 176 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 176 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 173 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 173 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 171 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 171 transition count 458
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 169 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 169 transition count 452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 167 transition count 448
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 167 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 165 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 165 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 163 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 163 transition count 440
Applied a total of 74 rules in 31 ms. Remains 163 /199 variables (removed 36) and now considering 440/528 (removed 88) transitions.
[2024-06-02 21:47:08] [INFO ] Flow matrix only has 408 transitions (discarded 32 similar events)
// Phase 1: matrix 408 rows 163 cols
[2024-06-02 21:47:08] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:47:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 21:47:08] [INFO ] Flow matrix only has 408 transitions (discarded 32 similar events)
[2024-06-02 21:47:08] [INFO ] Invariant cache hit.
[2024-06-02 21:47:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:47:08] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2024-06-02 21:47:08] [INFO ] Flow matrix only has 408 transitions (discarded 32 similar events)
[2024-06-02 21:47:08] [INFO ] Invariant cache hit.
[2024-06-02 21:47:08] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-06-02 21:47:11] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:47:11] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:47:12] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:47:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:47:12] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:47:13] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:47:13] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 407/570 variables, 163/177 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 57/234 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (OVERLAPS) 1/571 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 9 (OVERLAPS) 0/571 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 439 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 235 constraints, problems are : Problem set: 0 solved, 439 unsolved in 25064 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 407/570 variables, 163/177 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 57/234 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 439/673 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-06-02 21:47:41] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:47:48] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 2/675 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-06-02 21:47:59] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/571 variables, and 676 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 57/58 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 10/10 constraints]
After SMT, in 55377ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 55382ms
Starting structural reductions in LTL mode, iteration 1 : 163/199 places, 440/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55896 ms. Remains : 163/199 places, 440/528 transitions.
[2024-06-02 21:48:04] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:48:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:48:04] [INFO ] Input system was already deterministic with 440 transitions.
[2024-06-02 21:48:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:48:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8545715414961605812.gal : 2 ms
[2024-06-02 21:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2035795942433185656.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/CTLFireability8545715414961605812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2035795942433185656.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-02 21:48:34] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:48:34] [INFO ] Applying decomposition
[2024-06-02 21:48:34] [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/graph15226233706039431805.txt' '-o' '/tmp/graph15226233706039431805.bin' '-w' '/tmp/graph15226233706039431805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15226233706039431805.bin' '-l' '-1' '-v' '-w' '/tmp/graph15226233706039431805.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:48:34] [INFO ] Decomposing Gal with order
[2024-06-02 21:48:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:48:34] [INFO ] Removed a total of 719 redundant transitions.
[2024-06-02 21:48:34] [INFO ] Flatten gal took : 27 ms
[2024-06-02 21:48:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 8 ms.
[2024-06-02 21:48:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17279074540790128298.gal : 3 ms
[2024-06-02 21:48:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15817743579837417715.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/CTLFireability17279074540790128298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15817743579837417715.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 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 180 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 179 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 179 transition count 478
Applied a total of 42 rules in 26 ms. Remains 179 /199 variables (removed 20) and now considering 478/528 (removed 50) transitions.
[2024-06-02 21:49:04] [INFO ] Flow matrix only has 446 transitions (discarded 32 similar events)
// Phase 1: matrix 446 rows 179 cols
[2024-06-02 21:49:04] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:49:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:49:04] [INFO ] Flow matrix only has 446 transitions (discarded 32 similar events)
[2024-06-02 21:49:04] [INFO ] Invariant cache hit.
[2024-06-02 21:49:04] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 21:49:04] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-06-02 21:49:04] [INFO ] Flow matrix only has 446 transitions (discarded 32 similar events)
[2024-06-02 21:49:05] [INFO ] Invariant cache hit.
[2024-06-02 21:49:05] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 21:49:08] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:49:08] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:49:08] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:49:09] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:49:09] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:49:10] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:49:10] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 21:49:11] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 445/624 variables, 179/194 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 63/257 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 8 (OVERLAPS) 1/625 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/625 variables, and 258 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 445/624 variables, 179/194 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 63/257 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 477/734 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 21:49:44] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:49:48] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:49:52] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:49:52] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 21:50:03] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/625 variables, and 739 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 63/64 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 13/13 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 179/199 places, 478/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60854 ms. Remains : 179/199 places, 478/528 transitions.
[2024-06-02 21:50:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:50:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:50:05] [INFO ] Input system was already deterministic with 478 transitions.
[2024-06-02 21:50:05] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:50:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:50:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1133791289246784305.gal : 1 ms
[2024-06-02 21:50:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2529064041458314597.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/CTLFireability1133791289246784305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2529064041458314597.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-02 21:50:35] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:50:35] [INFO ] Applying decomposition
[2024-06-02 21:50:35] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8792681548302981089.txt' '-o' '/tmp/graph8792681548302981089.bin' '-w' '/tmp/graph8792681548302981089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8792681548302981089.bin' '-l' '-1' '-v' '-w' '/tmp/graph8792681548302981089.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:50:35] [INFO ] Decomposing Gal with order
[2024-06-02 21:50:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:50:35] [INFO ] Removed a total of 733 redundant transitions.
[2024-06-02 21:50:35] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:50:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 7 ms.
[2024-06-02 21:50:35] [INFO ] Time to serialize gal into /tmp/CTLFireability596319544741266601.gal : 3 ms
[2024-06-02 21:50:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17989424188052647972.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/CTLFireability596319544741266601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17989424188052647972.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 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 189 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 189 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 187 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 187 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 185 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 185 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 183 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 183 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 181 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 181 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 179 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 177 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 177 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 175 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 175 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 173 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 173 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 172 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 172 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 171 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 171 transition count 459
Applied a total of 58 rules in 17 ms. Remains 171 /199 variables (removed 28) and now considering 459/528 (removed 69) transitions.
[2024-06-02 21:51:05] [INFO ] Flow matrix only has 427 transitions (discarded 32 similar events)
// Phase 1: matrix 427 rows 171 cols
[2024-06-02 21:51:05] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:51:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:51:05] [INFO ] Flow matrix only has 427 transitions (discarded 32 similar events)
[2024-06-02 21:51:05] [INFO ] Invariant cache hit.
[2024-06-02 21:51:05] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 21:51:06] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2024-06-02 21:51:06] [INFO ] Flow matrix only has 427 transitions (discarded 32 similar events)
[2024-06-02 21:51:06] [INFO ] Invariant cache hit.
[2024-06-02 21:51:06] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:51:10] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:51:10] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:51:10] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:51:11] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (OVERLAPS) 426/597 variables, 171/187 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 60/247 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 21:51:15] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 8 (OVERLAPS) 1/598 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 10 (OVERLAPS) 0/598 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 458 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 249 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (OVERLAPS) 426/597 variables, 171/188 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 60/248 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 458/706 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 21:51:44] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:51:51] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:51:51] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 4/710 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 458 unsolved
SMT process timed out in 60370ms, After SMT, problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Starting structural reductions in LTL mode, iteration 1 : 171/199 places, 459/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 171/199 places, 459/528 transitions.
[2024-06-02 21:52:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:52:06] [INFO ] Input system was already deterministic with 459 transitions.
[2024-06-02 21:52:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:52:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14191408346723786122.gal : 2 ms
[2024-06-02 21:52:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6625184797928225235.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/CTLFireability14191408346723786122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6625184797928225235.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-02 21:52:36] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:52:36] [INFO ] Applying decomposition
[2024-06-02 21:52:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12219208316614524314.txt' '-o' '/tmp/graph12219208316614524314.bin' '-w' '/tmp/graph12219208316614524314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12219208316614524314.bin' '-l' '-1' '-v' '-w' '/tmp/graph12219208316614524314.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:52:36] [INFO ] Decomposing Gal with order
[2024-06-02 21:52:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:52:36] [INFO ] Removed a total of 741 redundant transitions.
[2024-06-02 21:52:36] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:52:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 6 ms.
[2024-06-02 21:52:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16318412472701142287.gal : 3 ms
[2024-06-02 21:52:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13219476110591472120.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/CTLFireability16318412472701142287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13219476110591472120.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 : 199/199 places, 528/528 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 199 transition count 525
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 196 transition count 525
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 192 transition count 517
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 192 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 192 transition count 515
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 190 transition count 509
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 190 transition count 509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 188 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 188 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 187 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 187 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 186 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 186 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 185 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 185 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 184 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 184 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 183 transition count 492
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 183 transition count 492
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 181 transition count 490
Applied a total of 38 rules in 46 ms. Remains 181 /199 variables (removed 18) and now considering 490/528 (removed 38) transitions.
[2024-06-02 21:53:06] [INFO ] Flow matrix only has 458 transitions (discarded 32 similar events)
// Phase 1: matrix 458 rows 181 cols
[2024-06-02 21:53:06] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:53:06] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 21:53:06] [INFO ] Flow matrix only has 458 transitions (discarded 32 similar events)
[2024-06-02 21:53:06] [INFO ] Invariant cache hit.
[2024-06-02 21:53:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 21:53:07] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-06-02 21:53:07] [INFO ] Redundant transitions in 5 ms returned []
Running 489 sub problems to find dead transitions.
[2024-06-02 21:53:07] [INFO ] Flow matrix only has 458 transitions (discarded 32 similar events)
[2024-06-02 21:53:07] [INFO ] Invariant cache hit.
[2024-06-02 21:53:07] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-06-02 21:53:10] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:53:10] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:53:10] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:53:10] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:53:11] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:53:11] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:53:12] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:53:12] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (OVERLAPS) 457/638 variables, 181/196 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/638 variables, 66/262 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-06-02 21:53:21] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (OVERLAPS) 1/639 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 264 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (OVERLAPS) 457/638 variables, 181/197 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/638 variables, 66/263 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 489/752 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-06-02 21:53:46] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:53:47] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:53:55] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-06-02 21:54:03] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 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 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(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 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 1)
(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 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(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 timeout
0)
(s147 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/639 variables, and 756 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 66/67 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 13/13 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Starting structural reductions in SI_CTL mode, iteration 1 : 181/199 places, 490/528 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60897 ms. Remains : 181/199 places, 490/528 transitions.
[2024-06-02 21:54:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:07] [INFO ] Input system was already deterministic with 490 transitions.
[2024-06-02 21:54:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16497429718412796580.gal : 4 ms
[2024-06-02 21:54:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9679412272065587825.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/CTLFireability16497429718412796580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9679412272065587825.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-02 21:54:37] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:54:37] [INFO ] Applying decomposition
[2024-06-02 21:54:37] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1087924161190098281.txt' '-o' '/tmp/graph1087924161190098281.bin' '-w' '/tmp/graph1087924161190098281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1087924161190098281.bin' '-l' '-1' '-v' '-w' '/tmp/graph1087924161190098281.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:54:37] [INFO ] Decomposing Gal with order
[2024-06-02 21:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:54:37] [INFO ] Removed a total of 780 redundant transitions.
[2024-06-02 21:54:37] [INFO ] Flatten gal took : 24 ms
[2024-06-02 21:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 7 ms.
[2024-06-02 21:54:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14297565379459860904.gal : 5 ms
[2024-06-02 21:54:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17041932976195315112.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/CTLFireability14297565379459860904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17041932976195315112.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 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 182 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 179 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 176 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 176 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 173 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 173 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 170 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 170 transition count 456
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 167 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 167 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 164 transition count 442
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 164 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 162 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 162 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 160 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 160 transition count 434
Applied a total of 80 rules in 16 ms. Remains 160 /199 variables (removed 39) and now considering 434/528 (removed 94) transitions.
[2024-06-02 21:55:07] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 160 cols
[2024-06-02 21:55:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:55:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:55:08] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 21:55:08] [INFO ] Invariant cache hit.
[2024-06-02 21:55:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:55:08] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-02 21:55:08] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 21:55:08] [INFO ] Invariant cache hit.
[2024-06-02 21:55:08] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:55:12] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:55:12] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:55:12] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:55:12] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (OVERLAPS) 1/562 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 234 constraints, problems are : Problem set: 0 solved, 433 unsolved in 24098 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 401/561 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 433/666 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 21:55:45] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:55:45] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 433 unsolved
SMT process timed out in 54426ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 54432ms
Starting structural reductions in LTL mode, iteration 1 : 160/199 places, 434/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54786 ms. Remains : 160/199 places, 434/528 transitions.
[2024-06-02 21:56:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:56:02] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:56:02] [INFO ] Input system was already deterministic with 434 transitions.
[2024-06-02 21:56:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:56:02] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:56:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18061691057027189064.gal : 2 ms
[2024-06-02 21:56:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9675690010921760180.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/CTLFireability18061691057027189064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9675690010921760180.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-02 21:56:32] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:56:32] [INFO ] Applying decomposition
[2024-06-02 21:56:32] [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/graph2738637755898491477.txt' '-o' '/tmp/graph2738637755898491477.bin' '-w' '/tmp/graph2738637755898491477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2738637755898491477.bin' '-l' '-1' '-v' '-w' '/tmp/graph2738637755898491477.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:56:32] [INFO ] Decomposing Gal with order
[2024-06-02 21:56:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:56:32] [INFO ] Removed a total of 708 redundant transitions.
[2024-06-02 21:56:32] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:56:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 5 ms.
[2024-06-02 21:56:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17001300132659598703.gal : 3 ms
[2024-06-02 21:56:32] [INFO ] Time to serialize properties into /tmp/CTLFireability947867830569642548.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/CTLFireability17001300132659598703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability947867830569642548.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 : 199/199 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 198 transition count 524
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 195 transition count 524
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 190 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 190 transition count 514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 190 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 187 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 187 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 184 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 184 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 181 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 181 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 178 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 178 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 175 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 175 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 172 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 172 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 170 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 170 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 168 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 168 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 166 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 166 transition count 452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 164 transition count 448
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 164 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 163 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 163 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 162 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 162 transition count 444
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 159 transition count 441
Applied a total of 80 rules in 52 ms. Remains 159 /199 variables (removed 40) and now considering 441/528 (removed 87) transitions.
[2024-06-02 21:57:03] [INFO ] Flow matrix only has 409 transitions (discarded 32 similar events)
// Phase 1: matrix 409 rows 159 cols
[2024-06-02 21:57:03] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:57:03] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-02 21:57:03] [INFO ] Flow matrix only has 409 transitions (discarded 32 similar events)
[2024-06-02 21:57:03] [INFO ] Invariant cache hit.
[2024-06-02 21:57:03] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:57:03] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-06-02 21:57:03] [INFO ] Redundant transitions in 3 ms returned []
Running 434 sub problems to find dead transitions.
[2024-06-02 21:57:03] [INFO ] Flow matrix only has 409 transitions (discarded 32 similar events)
[2024-06-02 21:57:03] [INFO ] Invariant cache hit.
[2024-06-02 21:57:03] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-02 21:57:05] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:57:05] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:57:05] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:57:05] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:57:05] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (OVERLAPS) 408/567 variables, 159/175 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 56/231 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-02 21:57:13] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:57:15] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 434 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/568 variables, and 233 constraints, problems are : Problem set: 0 solved, 434 unsolved in 21716 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-02 21:57:27] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:57:27] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (OVERLAPS) 408/567 variables, 159/179 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 56/235 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 434/669 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-02 21:57:35] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:57:37] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:57:37] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/568 variables, and 672 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 16/16 constraints]
After SMT, in 52053ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 52058ms
Starting structural reductions in SI_CTL mode, iteration 1 : 159/199 places, 441/528 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52571 ms. Remains : 159/199 places, 441/528 transitions.
[2024-06-02 21:57:55] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:57:55] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:57:55] [INFO ] Input system was already deterministic with 441 transitions.
[2024-06-02 21:57:55] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:57:55] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:57:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11127994993578942805.gal : 7 ms
RANDOM walk for 40000 steps (1316 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (47 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-06-02 21:57:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14357767634173562190.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11127994993578942805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14357767634173562190.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14357767634173562190.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 39
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39 after 57
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :57 after 93
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :93 after 228
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :228 after 334
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :334 after 2733
Reachability property FireWire-PT-13-CTLFireability-2024-12 is true.
FORMULA FireWire-PT-13-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4831,0.689269,26260,2,4167,16,47046,6,0,1074,45754,0
Total reachable state count : 4831
Verifying 1 reachability properties.
Reachability property FireWire-PT-13-CTLFireability-2024-12 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-13-CTLFireability-2024-12,1,0.690584,26260,2,160,16,47046,7,0,1080,45754,0
Interrupted probabilistic random walk after 1585287 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :0 out of 1
Probabilistic random walk after 1585287 steps, saw 341389 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 198 transition count 524
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 195 transition count 524
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 190 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 190 transition count 514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 190 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 187 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 187 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 184 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 184 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 181 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 181 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 178 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 178 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 175 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 175 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 172 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 172 transition count 467
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 169 transition count 458
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 169 transition count 458
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 166 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 166 transition count 452
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 163 transition count 444
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 163 transition count 444
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 160 transition count 438
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 158 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 156 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 153 transition count 427
Applied a total of 92 rules in 38 ms. Remains 153 /199 variables (removed 46) and now considering 427/528 (removed 101) transitions.
[2024-06-02 21:57:58] [INFO ] Flow matrix only has 395 transitions (discarded 32 similar events)
// Phase 1: matrix 395 rows 153 cols
[2024-06-02 21:57:58] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:57:58] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:57:58] [INFO ] Flow matrix only has 395 transitions (discarded 32 similar events)
[2024-06-02 21:57:58] [INFO ] Invariant cache hit.
[2024-06-02 21:57:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 21:57:58] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-02 21:57:58] [INFO ] Redundant transitions in 6 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:57:58] [INFO ] Flow matrix only has 395 transitions (discarded 32 similar events)
[2024-06-02 21:57:58] [INFO ] Invariant cache hit.
[2024-06-02 21:57:58] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:58:00] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:58:00] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:58:00] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:58:00] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:58:01] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:58:01] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:58:01] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:58:01] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:58:04] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 394/547 variables, 153/169 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 54/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:58:07] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:58:07] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:58:07] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:58:08] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:58:10] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:58:10] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/548 variables, and 230 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20653 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 394/547 variables, 153/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 54/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 420/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:58:31] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/548 variables, and 651 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 17/17 constraints]
After SMT, in 50965ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 50975ms
Starting structural reductions in SI_CTL mode, iteration 1 : 153/199 places, 427/528 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51303 ms. Remains : 153/199 places, 427/528 transitions.
[2024-06-02 21:58:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:58:50] [INFO ] Input system was already deterministic with 427 transitions.
RANDOM walk for 40000 steps (1310 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2024-06-02 21:58:50] [INFO ] Flatten gal took : 27 ms
[2024-06-02 21:58:50] [INFO ] Flatten gal took : 9 ms
BEST_FIRST walk for 23857 steps (153 resets) in 50 ms. (467 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-13-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 21:58:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1923995062477374538.gal : 2 ms
[2024-06-02 21:58:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9363579500734875844.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1923995062477374538.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9363579500734875844.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 198 transition count 524
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 195 transition count 524
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 190 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 190 transition count 514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 190 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 187 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 187 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 184 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 184 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 181 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 181 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 178 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 178 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 175 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 175 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 172 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 172 transition count 467
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 169 transition count 458
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 169 transition count 458
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 166 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 166 transition count 452
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 163 transition count 444
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 163 transition count 444
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 160 transition count 438
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 158 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 156 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 153 transition count 427
Applied a total of 92 rules in 39 ms. Remains 153 /199 variables (removed 46) and now considering 427/528 (removed 101) transitions.
[2024-06-02 21:58:50] [INFO ] Flow matrix only has 395 transitions (discarded 32 similar events)
[2024-06-02 21:58:50] [INFO ] Invariant cache hit.
[2024-06-02 21:58:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:58:50] [INFO ] Flow matrix only has 395 transitions (discarded 32 similar events)
[2024-06-02 21:58:50] [INFO ] Invariant cache hit.
[2024-06-02 21:58:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 21:58:50] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-02 21:58:50] [INFO ] Redundant transitions in 3 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:58:50] [INFO ] Flow matrix only has 395 transitions (discarded 32 similar events)
[2024-06-02 21:58:50] [INFO ] Invariant cache hit.
[2024-06-02 21:58:50] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:58:52] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:58:53] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:58:53] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:58:55] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 394/547 variables, 153/169 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 54/223 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:58:59] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:58:59] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:58:59] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:58:59] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-02 21:58:59] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:59:01] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:59:02] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/548 variables, and 230 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20857 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 394/547 variables, 153/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 54/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 420/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:59:23] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/548 variables, and 651 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 17/17 constraints]
After SMT, in 51173ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 51177ms
Starting structural reductions in SI_CTL mode, iteration 1 : 153/199 places, 427/528 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51491 ms. Remains : 153/199 places, 427/528 transitions.
[2024-06-02 21:59:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:59:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:59:41] [INFO ] Input system was already deterministic with 427 transitions.
[2024-06-02 21:59:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:59:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:59:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17118779943086378697.gal : 2 ms
[2024-06-02 21:59:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5502434204144441843.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/CTLFireability17118779943086378697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5502434204144441843.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-02 22:00:11] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:00:11] [INFO ] Applying decomposition
[2024-06-02 22:00:11] [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/graph9353696477606719644.txt' '-o' '/tmp/graph9353696477606719644.bin' '-w' '/tmp/graph9353696477606719644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9353696477606719644.bin' '-l' '-1' '-v' '-w' '/tmp/graph9353696477606719644.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:00:11] [INFO ] Decomposing Gal with order
[2024-06-02 22:00:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:00:11] [INFO ] Removed a total of 704 redundant transitions.
[2024-06-02 22:00:11] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:00:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 5 ms.
[2024-06-02 22:00:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9091052982690330802.gal : 3 ms
[2024-06-02 22:00:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14763670930034644471.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/CTLFireability9091052982690330802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14763670930034644471.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.
[2024-06-02 22:00:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:00:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:00:41] [INFO ] Applying decomposition
[2024-06-02 22:00:41] [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/graph415811437559185952.txt' '-o' '/tmp/graph415811437559185952.bin' '-w' '/tmp/graph415811437559185952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph415811437559185952.bin' '-l' '-1' '-v' '-w' '/tmp/graph415811437559185952.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:00:41] [INFO ] Decomposing Gal with order
[2024-06-02 22:00:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:00:41] [INFO ] Removed a total of 837 redundant transitions.
[2024-06-02 22:00:41] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 6 ms.
[2024-06-02 22:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2361489511491470.gal : 3 ms
[2024-06-02 22:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3527223429640271119.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/CTLFireability2361489511491470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3527223429640271119.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 -...259
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.66759e+08,191.853,2209188,8758,453,1.77573e+06,15570,947,1.45663e+07,159,128821,0
Converting to forward existential form...Done !
original formula: E(E(!((EF(((i0.i0.u3.p10==1)&&(i4.u37.p109==1))) + ((i3.i0.u0.p3==1)&&(i3.i1.u53.p155==1)))) U (A(AX(((i3.i0.u0.p3==1)&&(i4.u36.p107==1))...489
=> equivalent forward existential formula: [(FwdU(Init,E(!((E(TRUE U ((i0.i0.u3.p10==1)&&(i4.u37.p109==1))) + ((i3.i0.u0.p3==1)&&(i3.i1.u53.p155==1)))) U (...860
Reverse transition relation is NOT exact ! Due to transitions t51, t54, t55, t57, t65, t66, t70, t75, t80, t83, t85, t89, t100, t103, t105, t142, t143, t14...1511
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
[2024-06-02 22:28:26] [INFO ] Applying decomposition
[2024-06-02 22:28:26] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:28:26] [INFO ] Decomposing Gal with order
[2024-06-02 22:28:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:28:26] [INFO ] Removed a total of 686 redundant transitions.
[2024-06-02 22:28:26] [INFO ] Flatten gal took : 38 ms
[2024-06-02 22:28:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 2 ms.
[2024-06-02 22:28:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17900524974158934283.gal : 2 ms
[2024-06-02 22:28:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16847899849648235542.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/CTLFireability17900524974158934283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16847899849648235542.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.66759e+08,12.2698,325920,1334,4151,198066,336014,210,563391,409,3.21631e+06,0
Converting to forward existential form...Done !
original formula: E(E(!((EF(((u1.p10==1)&&(u9.p109==1))) + ((u1.p3==1)&&(u13.p155==1)))) U (A(AX(((u1.p3==1)&&(u9.p107==1))) U ((((u1.p3==1)&&(u9.p91==1))&...380
=> equivalent forward existential formula: [(FwdU(Init,E(!((E(TRUE U ((u1.p10==1)&&(u9.p109==1))) + ((u1.p3==1)&&(u13.p155==1)))) U (!((E(!(((((u1.p3==1)&&...683
Reverse transition relation is NOT exact ! Due to transitions t56, t75, t97, t98, t183, t193, t195, t282, t283, t294, t333, t335, t346, t347, t434, t476, t...633
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-13"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-13, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;