About the Execution of ITS-Tools for ResAllocation-PT-R050C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2348.151 | 400055.00 | 917024.00 | 827.30 | FFTFFFTFTFFFTFFF | 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.r312-tall-171662339500876.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 ResAllocation-PT-R050C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339500876
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R050C002-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716719253266
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 10:27:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 10:27:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:27:34] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-26 10:27:34] [INFO ] Transformed 200 places.
[2024-05-26 10:27:34] [INFO ] Transformed 102 transitions.
[2024-05-26 10:27:34] [INFO ] Found NUPN structural information;
[2024-05-26 10:27:34] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResAllocation-PT-R050C002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 16 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 200 cols
[2024-05-26 10:27:34] [INFO ] Computed 100 invariants in 11 ms
[2024-05-26 10:27:35] [INFO ] Implicit Places using invariants in 296 ms returned [101, 105, 107, 111, 117, 121, 123, 129, 131, 133, 135, 141, 143, 147, 149, 151, 153, 155, 161, 163, 165, 167, 171, 173, 175, 177, 179, 183, 185, 187, 189, 191, 193, 195, 197, 199]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 330 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/200 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 164/200 places, 102/102 transitions.
Support contains 59 out of 164 places after structural reductions.
[2024-05-26 10:27:35] [INFO ] Flatten gal took : 31 ms
[2024-05-26 10:27:35] [INFO ] Flatten gal took : 13 ms
[2024-05-26 10:27:35] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40000 steps (58 resets) in 1538 ms. (25 steps per ms) remains 14/22 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (12 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
// Phase 1: matrix 102 rows 164 cols
[2024-05-26 10:27:36] [INFO ] Computed 64 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/33 variables, 12/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 19/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/64 variables, 34/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 36/100 variables, 24/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 24/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 10/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 30/130 variables, 18/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/130 variables, 18/176 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/130 variables, 6/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 29/159 variables, 19/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/159 variables, 19/220 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/159 variables, 7/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/159 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 21/180 variables, 13/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/180 variables, 13/253 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/180 variables, 5/258 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/180 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 15/195 variables, 11/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/195 variables, 11/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/195 variables, 5/285 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/195 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 11/206 variables, 7/292 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/206 variables, 7/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/206 variables, 3/302 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/206 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 10/216 variables, 6/308 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/216 variables, 6/314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/216 variables, 2/316 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/216 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 11/227 variables, 7/323 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/227 variables, 7/330 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/227 variables, 3/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/227 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 10/237 variables, 6/339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/237 variables, 6/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/237 variables, 2/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/237 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 10/247 variables, 6/353 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/247 variables, 6/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/247 variables, 2/361 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/247 variables, 0/361 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 11/258 variables, 7/368 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/258 variables, 7/375 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/258 variables, 3/378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/258 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 8/266 variables, 6/384 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/266 variables, 6/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/266 variables, 2/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/266 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 0/266 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 392 constraints, problems are : Problem set: 1 solved, 2 unsolved in 495 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 14/22 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 14/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/45 variables, 23/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 33/78 variables, 21/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 21/97 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 9/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 2/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/78 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 30/108 variables, 18/126 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 18/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 6/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/108 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 30/138 variables, 20/170 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/138 variables, 20/190 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/138 variables, 8/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/138 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 22/160 variables, 14/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/160 variables, 14/226 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/160 variables, 6/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/160 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 22/182 variables, 14/246 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/182 variables, 14/260 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/182 variables, 6/266 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/182 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 21/203 variables, 13/279 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/203 variables, 13/292 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/203 variables, 5/297 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/203 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 13/216 variables, 9/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/216 variables, 9/315 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/216 variables, 3/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/216 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 11/227 variables, 7/325 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/227 variables, 7/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/227 variables, 3/335 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/227 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 10/237 variables, 6/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/237 variables, 6/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/237 variables, 2/349 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/237 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 10/247 variables, 6/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/247 variables, 6/361 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/247 variables, 2/363 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/247 variables, 0/363 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 11/258 variables, 7/370 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/258 variables, 7/377 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/258 variables, 3/380 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/258 variables, 0/380 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 8/266 variables, 6/386 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/266 variables, 6/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/266 variables, 2/394 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/266 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 0/266 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 394 constraints, problems are : Problem set: 1 solved, 2 unsolved in 506 ms.
Refiners :[Domain max(s): 164/164 constraints, Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1032ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 87 ms.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 163 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 161 transition count 100
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 159 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 159 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 157 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 156 transition count 97
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 156 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 154 transition count 96
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 3 with 2 rules applied. Total rules applied 18 place count 153 transition count 95
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 153 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 151 transition count 94
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 24 place count 149 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 149 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 147 transition count 92
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 5 with 2 rules applied. Total rules applied 29 place count 146 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 30 place count 146 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 32 place count 144 transition count 90
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 35 place count 142 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 36 place count 142 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 38 place count 140 transition count 88
Applied a total of 38 rules in 92 ms. Remains 140 /164 variables (removed 24) and now considering 88/102 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 140/164 places, 88/102 transitions.
RANDOM walk for 40000 steps (80 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1877823 steps, run timeout after 3001 ms. (steps per millisecond=625 ) properties seen :0 out of 1
Probabilistic random walk after 1877823 steps, saw 386937 distinct states, run finished after 3005 ms. (steps per millisecond=624 ) properties seen :0
// Phase 1: matrix 88 rows 140 cols
[2024-05-26 10:27:40] [INFO ] Computed 54 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/38 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/59 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/59 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/59 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/59 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/79 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 21/100 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/100 variables, 13/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/100 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/100 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/122 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/122 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/144 variables, 14/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/144 variables, 14/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/144 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/144 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 21/165 variables, 13/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/165 variables, 13/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/165 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/165 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 13/178 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/178 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/178 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/178 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 11/189 variables, 7/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/189 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/189 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/189 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 10/199 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/199 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/199 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/199 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 10/209 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/209 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/209 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/209 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 11/220 variables, 7/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/220 variables, 7/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/220 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/220 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 8/228 variables, 6/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/228 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/228 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/228 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 0/228 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/38 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/59 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/59 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/59 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/59 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/59 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/79 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/79 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/79 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 21/100 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/100 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/100 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/100 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/122 variables, 14/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 14/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/122 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/144 variables, 14/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/144 variables, 14/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/144 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 21/165 variables, 13/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/165 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/165 variables, 5/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/165 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 13/178 variables, 9/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/178 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/178 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/178 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 11/189 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/189 variables, 7/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/189 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/189 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 10/199 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/199 variables, 6/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/199 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/199 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 10/209 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/209 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/209 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/209 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 11/220 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/220 variables, 7/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/220 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/220 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 8/228 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/228 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/228 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/228 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 0/228 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 7 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 140/140 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-26 10:27:41] [INFO ] Invariant cache hit.
[2024-05-26 10:27:41] [INFO ] Implicit Places using invariants in 117 ms returned [90, 94, 96, 102, 104, 108, 115, 117, 123, 130]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 120 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/140 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 129 ms. Remains : 130/140 places, 88/88 transitions.
RANDOM walk for 40000 steps (80 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2143529 steps, run timeout after 3001 ms. (steps per millisecond=714 ) properties seen :0 out of 1
Probabilistic random walk after 2143529 steps, saw 434072 distinct states, run finished after 3001 ms. (steps per millisecond=714 ) properties seen :0
// Phase 1: matrix 88 rows 130 cols
[2024-05-26 10:27:44] [INFO ] Computed 44 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/57 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/77 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/97 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/97 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/97 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/97 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/117 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/117 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/117 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/117 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/137 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/137 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/137 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/137 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 20/157 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/157 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/157 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/157 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 13/170 variables, 9/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/170 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/170 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/170 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 10/180 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/180 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/180 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/180 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 10/190 variables, 6/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/190 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/190 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/190 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 10/200 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/200 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/200 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/200 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 10/210 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/210 variables, 6/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/210 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/210 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 8/218 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/218 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/218 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/57 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/77 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 20/97 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/97 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/97 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/97 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 20/117 variables, 12/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/117 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/117 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/117 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/137 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/137 variables, 12/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/137 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/137 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 20/157 variables, 12/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/157 variables, 12/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/157 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/157 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 13/170 variables, 9/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/170 variables, 9/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/170 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/170 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 10/180 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/180 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/180 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/180 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 10/190 variables, 6/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/190 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/190 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/190 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/200 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/200 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/200 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/200 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 10/210 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/210 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/210 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/210 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 8/218 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/218 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/218 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/218 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 0/218 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 7 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 130/130 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-26 10:27:45] [INFO ] Invariant cache hit.
[2024-05-26 10:27:45] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-26 10:27:45] [INFO ] Invariant cache hit.
[2024-05-26 10:27:45] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-26 10:27:45] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-26 10:27:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 44/174 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-26 10:27:45] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 9 ms to minimize.
[2024-05-26 10:27:45] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-26 10:27:45] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:27:45] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:27:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:27:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:27:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:27:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-26 10:27:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 88/218 variables, 130/345 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 345 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3979 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 44/174 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 41/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 88/218 variables, 130/345 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 86/431 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 431 constraints, problems are : Problem set: 0 solved, 86 unsolved in 7770 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 41/41 constraints]
After SMT, in 11779ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 11781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11999 ms. Remains : 130/130 places, 88/88 transitions.
FORMULA ResAllocation-PT-R050C002-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA ResAllocation-PT-R050C002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 100
Applied a total of 4 rules in 7 ms. Remains 162 /164 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 162 cols
[2024-05-26 10:27:57] [INFO ] Computed 64 invariants in 2 ms
[2024-05-26 10:27:57] [INFO ] Implicit Places using invariants in 116 ms returned [100, 104, 107, 109, 112, 116, 118, 124, 126, 130, 137, 139, 145, 152]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 118 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/164 places, 100/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 148/164 places, 100/102 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-00
Stuttering criterion allowed to conclude after 686 steps with 0 reset in 8 ms.
FORMULA ResAllocation-PT-R050C002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLFireability-00 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 101
Applied a total of 2 rules in 6 ms. Remains 163 /164 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 163 cols
[2024-05-26 10:27:57] [INFO ] Computed 64 invariants in 0 ms
[2024-05-26 10:27:57] [INFO ] Implicit Places using invariants in 98 ms returned [101, 105, 108, 110, 113, 117, 119, 125, 127, 131, 138, 140, 146, 153]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 99 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/164 places, 101/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 149/164 places, 101/102 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-02
Product exploration explored 100000 steps with 158 reset in 312 ms.
Product exploration explored 100000 steps with 157 reset in 268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 32260 steps (48 resets) in 189 ms. (169 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 149 cols
[2024-05-26 10:27:59] [INFO ] Computed 50 invariants in 1 ms
[2024-05-26 10:27:59] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-26 10:27:59] [INFO ] Invariant cache hit.
[2024-05-26 10:27:59] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-26 10:27:59] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-26 10:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 50/199 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:28:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 10 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:28:01] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:28:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:28:02] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:28:02] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:28:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:28:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:28:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 101/250 variables, 149/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 395 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4913 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 50/199 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 47/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 101/250 variables, 149/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 99/494 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/250 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 495 constraints, problems are : Problem set: 0 solved, 99 unsolved in 22419 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 48/48 constraints]
After SMT, in 27350ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 27351ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27581 ms. Remains : 149/149 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 30851 steps (46 resets) in 174 ms. (176 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 319 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 164 reset in 213 ms.
Product exploration explored 100000 steps with 161 reset in 235 ms.
Built C files in :
/tmp/ltsmin9548331084116285176
[2024-05-26 10:28:28] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-26 10:28:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:28:28] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-26 10:28:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:28:28] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-26 10:28:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:28:28] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9548331084116285176
Running compilation step : cd /tmp/ltsmin9548331084116285176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin9548331084116285176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9548331084116285176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16709155290011525214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 101/101 transitions.
Applied a total of 0 rules in 9 ms. Remains 149 /149 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-26 10:28:43] [INFO ] Invariant cache hit.
[2024-05-26 10:28:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-26 10:28:43] [INFO ] Invariant cache hit.
[2024-05-26 10:28:43] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-26 10:28:43] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-26 10:28:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 50/199 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:28:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-26 10:28:45] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:28:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:28:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:28:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:28:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 101/250 variables, 149/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 395 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5212 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 50/199 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 47/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 101/250 variables, 149/395 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 99/494 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-26 10:28:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/250 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 495 constraints, problems are : Problem set: 0 solved, 99 unsolved in 22915 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 48/48 constraints]
After SMT, in 28141ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 28142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28380 ms. Remains : 149/149 places, 101/101 transitions.
Built C files in :
/tmp/ltsmin6272426570523705069
[2024-05-26 10:29:11] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-26 10:29:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:29:11] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-26 10:29:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:29:11] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-26 10:29:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:29:11] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6272426570523705069
Running compilation step : cd /tmp/ltsmin6272426570523705069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 251 ms.
Running link step : cd /tmp/ltsmin6272426570523705069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6272426570523705069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17106633600440305672.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 10:29:26] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:29:27] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:29:27] [INFO ] Time to serialize gal into /tmp/LTL11418206055052282054.gal : 3 ms
[2024-05-26 10:29:27] [INFO ] Time to serialize properties into /tmp/LTL17645514036198579549.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11418206055052282054.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1576169045205732459.hoa' '-atoms' '/tmp/LTL17645514036198579549.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17645514036198579549.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1576169045205732459.hoa
Reverse transition relation is NOT exact ! Due to transitions t51, t49.t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...174
Computing Next relation with stutter on 49 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
934 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.37515,306988,1,0,4272,1.9139e+06,242,2548,4815,2.27164e+06,9109
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R050C002-LTLFireability-02 finished in 101317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G(p1)))))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2024-05-26 10:29:39] [INFO ] Computed 64 invariants in 1 ms
[2024-05-26 10:29:39] [INFO ] Implicit Places using invariants in 104 ms returned [102, 106, 109, 111, 114, 118, 120, 126, 128, 132, 147, 154]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 105 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 152/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-04
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R050C002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLFireability-04 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 10 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 101
Applied a total of 2 rules in 14 ms. Remains 163 /164 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 163 cols
[2024-05-26 10:29:39] [INFO ] Computed 64 invariants in 5 ms
[2024-05-26 10:29:39] [INFO ] Implicit Places using invariants in 104 ms returned [101, 105, 108, 113, 117, 119, 125, 127, 138, 140, 146, 153]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 104 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/164 places, 101/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 151/164 places, 101/102 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-05
Stuttering criterion allowed to conclude after 714 steps with 0 reset in 3 ms.
FORMULA ResAllocation-PT-R050C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLFireability-05 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2024-05-26 10:29:39] [INFO ] Computed 64 invariants in 2 ms
[2024-05-26 10:29:39] [INFO ] Implicit Places using invariants in 97 ms returned [102, 106, 109, 111, 114, 118, 120, 126, 128, 132, 139, 141, 147, 154]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 98 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 150/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R050C002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLFireability-07 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 100
Applied a total of 4 rules in 10 ms. Remains 162 /164 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 162 cols
[2024-05-26 10:29:39] [INFO ] Computed 64 invariants in 1 ms
[2024-05-26 10:29:39] [INFO ] Implicit Places using invariants in 92 ms returned [100, 104, 109, 112, 116, 118, 124, 126, 130, 137, 139, 145, 152]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 93 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/164 places, 100/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107 ms. Remains : 149/164 places, 100/102 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-09
Stuttering criterion allowed to conclude after 651 steps with 0 reset in 5 ms.
FORMULA ResAllocation-PT-R050C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLFireability-09 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U p1))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 100
Applied a total of 4 rules in 9 ms. Remains 162 /164 variables (removed 2) and now considering 100/102 (removed 2) transitions.
[2024-05-26 10:29:40] [INFO ] Invariant cache hit.
[2024-05-26 10:29:40] [INFO ] Implicit Places using invariants in 87 ms returned [100, 107, 109, 112, 116, 124, 126, 130, 137, 139, 145, 152]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 88 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/164 places, 100/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 150/164 places, 100/102 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), p0]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-10
Product exploration explored 100000 steps with 150 reset in 258 ms.
Product exploration explored 100000 steps with 150 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), p0]
RANDOM walk for 40000 steps (59 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 9123 steps (0 resets) in 24 ms. (364 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), p0]
// Phase 1: matrix 100 rows 150 cols
[2024-05-26 10:29:41] [INFO ] Computed 52 invariants in 1 ms
[2024-05-26 10:29:41] [INFO ] [Real]Absence check using 52 positive place invariants in 8 ms returned sat
[2024-05-26 10:29:42] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2024-05-26 10:29:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 10:29:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2024-05-26 10:29:42] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2024-05-26 10:29:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-26 10:29:42] [INFO ] Computed and/alt/rep : 98/98/98 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-26 10:29:42] [INFO ] Added : 55 causal constraints over 11 iterations in 358 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-26 10:29:42] [INFO ] Invariant cache hit.
[2024-05-26 10:29:43] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-26 10:29:43] [INFO ] Invariant cache hit.
[2024-05-26 10:29:43] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-26 10:29:43] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-26 10:29:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 52/202 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-26 10:29:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:29:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:29:45] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:29:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:29:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:29:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:29:46] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:29:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:29:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 100/250 variables, 150/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 398 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4898 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 52/202 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 46/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 100/250 variables, 150/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 98/496 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 496 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12998 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 46/46 constraints]
After SMT, in 17912ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 17914ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18171 ms. Remains : 150/150 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), p0]
RANDOM walk for 40000 steps (60 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 9956 steps (0 resets) in 16 ms. (585 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), p0]
[2024-05-26 10:30:01] [INFO ] Invariant cache hit.
[2024-05-26 10:30:01] [INFO ] [Real]Absence check using 52 positive place invariants in 8 ms returned sat
[2024-05-26 10:30:02] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2024-05-26 10:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 10:30:02] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2024-05-26 10:30:02] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2024-05-26 10:30:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-26 10:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-26 10:30:02] [INFO ] Computed and/alt/rep : 98/98/98 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 10:30:03] [INFO ] Added : 48 causal constraints over 10 iterations in 348 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), p0]
Product exploration explored 100000 steps with 151 reset in 221 ms.
Product exploration explored 100000 steps with 150 reset in 245 ms.
Built C files in :
/tmp/ltsmin8658630819367170121
[2024-05-26 10:30:03] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-26 10:30:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:30:03] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-26 10:30:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:30:03] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-26 10:30:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:30:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8658630819367170121
Running compilation step : cd /tmp/ltsmin8658630819367170121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 252 ms.
Running link step : cd /tmp/ltsmin8658630819367170121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8658630819367170121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18089372426829287754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-26 10:30:19] [INFO ] Invariant cache hit.
[2024-05-26 10:30:19] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-26 10:30:19] [INFO ] Invariant cache hit.
[2024-05-26 10:30:19] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-26 10:30:19] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-26 10:30:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 52/202 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:30:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-26 10:30:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:30:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:30:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:30:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-26 10:30:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:30:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:30:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:30:22] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:30:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:30:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:30:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:30:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:30:22] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 100/250 variables, 150/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 398 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4772 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 52/202 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 46/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 100/250 variables, 150/398 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 98/496 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 496 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12477 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 46/46 constraints]
After SMT, in 17263ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 17265ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17509 ms. Remains : 150/150 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin13548527952741783870
[2024-05-26 10:30:36] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-26 10:30:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:30:36] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-26 10:30:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:30:36] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-26 10:30:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:30:36] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13548527952741783870
Running compilation step : cd /tmp/ltsmin13548527952741783870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 254 ms.
Running link step : cd /tmp/ltsmin13548527952741783870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13548527952741783870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7104077155223612675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 10:30:51] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:30:51] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:30:51] [INFO ] Time to serialize gal into /tmp/LTL762805766092268446.gal : 1 ms
[2024-05-26 10:30:51] [INFO ] Time to serialize properties into /tmp/LTL15204768751930054012.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL762805766092268446.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9880025814130529849.hoa' '-atoms' '/tmp/LTL15204768751930054012.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15204768751930054012.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9880025814130529849.hoa
Reverse transition relation is NOT exact ! Due to transitions t49.t50, t52.t51, Intersection with reachable at each step enabled. (destroyed/reverse/inter...178
Computing Next relation with stutter on 49 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1081 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.8217,378840,1,0,5223,2.1311e+06,227,6212,4636,3.00758e+06,12572
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R050C002-LTLFireability-10 finished in 85451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&((p1 U p0) U X(p2)))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2024-05-26 10:31:05] [INFO ] Computed 64 invariants in 1 ms
[2024-05-26 10:31:05] [INFO ] Implicit Places using invariants in 97 ms returned [102, 106, 109, 111, 114, 120, 126, 128, 132, 139, 141, 147, 154]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 97 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 151/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R050C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLFireability-11 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 100
Applied a total of 4 rules in 6 ms. Remains 162 /164 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 162 cols
[2024-05-26 10:31:05] [INFO ] Computed 64 invariants in 0 ms
[2024-05-26 10:31:06] [INFO ] Implicit Places using invariants in 89 ms returned [100, 104, 107, 109, 112, 116, 118, 124, 126, 130, 137, 139, 145]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 90 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/164 places, 100/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 149/164 places, 100/102 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-13
Product exploration explored 100000 steps with 150 reset in 213 ms.
Product exploration explored 100000 steps with 150 reset in 245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (59 resets) in 159 ms. (250 steps per ms) remains 1/4 properties
BEST_FIRST walk for 9042 steps (0 resets) in 16 ms. (531 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 215 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 149 cols
[2024-05-26 10:31:07] [INFO ] Computed 51 invariants in 1 ms
[2024-05-26 10:31:07] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-26 10:31:07] [INFO ] Invariant cache hit.
[2024-05-26 10:31:07] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-26 10:31:07] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-26 10:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:31:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2024-05-26 10:31:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:31:07] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-26 10:31:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:31:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:31:07] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:07] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 4 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:31:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:31:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:31:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:31:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:31:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 100/249 variables, 149/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 394 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4642 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 45/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 100/249 variables, 149/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 98/492 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 492 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12616 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 45/45 constraints]
After SMT, in 17272ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 17273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17518 ms. Remains : 149/149 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (60 resets) in 117 ms. (338 steps per ms) remains 1/4 properties
BEST_FIRST walk for 8213 steps (0 resets) in 24 ms. (328 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 239 ms.
Product exploration explored 100000 steps with 150 reset in 250 ms.
Built C files in :
/tmp/ltsmin15790883563221720996
[2024-05-26 10:31:25] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-26 10:31:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:31:25] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-26 10:31:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:31:25] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-26 10:31:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:31:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15790883563221720996
Running compilation step : cd /tmp/ltsmin15790883563221720996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 256 ms.
Running link step : cd /tmp/ltsmin15790883563221720996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15790883563221720996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10080697977323143928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-26 10:31:40] [INFO ] Invariant cache hit.
[2024-05-26 10:31:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-26 10:31:40] [INFO ] Invariant cache hit.
[2024-05-26 10:31:40] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-26 10:31:40] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-26 10:31:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:31:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:31:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:31:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 100/249 variables, 149/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 394 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4850 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 45/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 100/249 variables, 149/394 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 98/492 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 492 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12867 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 45/45 constraints]
After SMT, in 17733ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 17734ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17967 ms. Remains : 149/149 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin3691085853593917461
[2024-05-26 10:31:58] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-26 10:31:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:31:58] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-26 10:31:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:31:58] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-26 10:31:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:31:58] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3691085853593917461
Running compilation step : cd /tmp/ltsmin3691085853593917461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 258 ms.
Running link step : cd /tmp/ltsmin3691085853593917461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3691085853593917461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8287141281358169402.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 10:32:13] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:32:13] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:32:13] [INFO ] Time to serialize gal into /tmp/LTL3496534776169373671.gal : 6 ms
[2024-05-26 10:32:13] [INFO ] Time to serialize properties into /tmp/LTL9252228881688518794.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3496534776169373671.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17071533679957661017.hoa' '-atoms' '/tmp/LTL9252228881688518794.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9252228881688518794.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17071533679957661017.hoa
Reverse transition relation is NOT exact ! Due to transitions t49.t50, t52.t51, Intersection with reachable at each step enabled. (destroyed/reverse/inter...178
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2024-05-26 10:32:28] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:32:28] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:32:28] [INFO ] Time to serialize gal into /tmp/LTL7627851845180743271.gal : 1 ms
[2024-05-26 10:32:28] [INFO ] Time to serialize properties into /tmp/LTL1152633569781465600.ltl : 10 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7627851845180743271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1152633569781465600.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("(((r_0_40==0)||(r_1_40==0))||(p_1_41==0))"))||("((p_0_39==1)&&(r_0_40==1))"))))
Formula 0 simplified : G(!"((p_0_39==1)&&(r_0_40==1))" & F!"(((r_0_40==0)||(r_1_40==0))||(p_1_41==0))")
Reverse transition relation is NOT exact ! Due to transitions t49.t50, t52.t51, Intersection with reachable at each step enabled. (destroyed/reverse/inter...178
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2024-05-26 10:32:43] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:32:43] [INFO ] Applying decomposition
[2024-05-26 10:32:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15084405152994292915.txt' '-o' '/tmp/graph15084405152994292915.bin' '-w' '/tmp/graph15084405152994292915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15084405152994292915.bin' '-l' '-1' '-v' '-w' '/tmp/graph15084405152994292915.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:32:43] [INFO ] Decomposing Gal with order
[2024-05-26 10:32:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:32:44] [INFO ] Flatten gal took : 37 ms
[2024-05-26 10:32:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 10:32:44] [INFO ] Time to serialize gal into /tmp/LTL14992764174066085754.gal : 3 ms
[2024-05-26 10:32:44] [INFO ] Time to serialize properties into /tmp/LTL15034509272665036036.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14992764174066085754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15034509272665036036.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i9.i0.u40.r_0_40==0)||(i9.i0.u50.r_1_40==0))||(i9.i0.u41.p_1_41==0))"))||("((i8.i1.u39.p_0_39==1)&&(i9.i0.u40.r_0_40==1))"...159
Formula 0 simplified : G(!"((i8.i1.u39.p_0_39==1)&&(i9.i0.u40.r_0_40==1))" & F!"(((i9.i0.u40.r_0_40==0)||(i9.i0.u50.r_1_40==0))||(i9.i0.u41.p_1_41==0))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t52_t51, i10.i1.t49_t50, Intersection with reachable at each step enabled. (destroyed/...191
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
Treatment of property ResAllocation-PT-R050C002-LTLFireability-13 finished in 113161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2024-05-26 10:32:59] [INFO ] Computed 64 invariants in 2 ms
[2024-05-26 10:32:59] [INFO ] Implicit Places using invariants in 104 ms returned [102, 106, 109, 111, 114, 118, 120, 126, 128, 132, 139, 141, 154]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 106 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 151/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R050C002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLFireability-14 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
[2024-05-26 10:32:59] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7300722153654128182
[2024-05-26 10:32:59] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-26 10:32:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:32:59] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-26 10:32:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:32:59] [INFO ] Applying decomposition
[2024-05-26 10:32:59] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-26 10:32:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 10:32:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7300722153654128182
Running compilation step : cd /tmp/ltsmin7300722153654128182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 10:32:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph670274405077519008.txt' '-o' '/tmp/graph670274405077519008.bin' '-w' '/tmp/graph670274405077519008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph670274405077519008.bin' '-l' '-1' '-v' '-w' '/tmp/graph670274405077519008.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:32:59] [INFO ] Decomposing Gal with order
[2024-05-26 10:32:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:32:59] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:32:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 10:32:59] [INFO ] Time to serialize gal into /tmp/LTLFireability8066214788436712828.gal : 3 ms
[2024-05-26 10:32:59] [INFO ] Time to serialize properties into /tmp/LTLFireability13269757287732622235.ltl : 10 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8066214788436712828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13269757287732622235.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("((i7.i1.u39.p_0_39==1)&&(i7.i1.u40.r_0_40==1))")||(G("(((i7.i1.u40.r_0_40==0)||(i7.i1.u63.r_1_40==0))||(i8.i0.u41.p_1_41==0))")...159
Formula 0 simplified : G(!"((i7.i1.u39.p_0_39==1)&&(i7.i1.u40.r_0_40==1))" & F!"(((i7.i1.u40.r_0_40==0)||(i7.i1.u63.r_1_40==0))||(i8.i0.u41.p_1_41==0))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.u49.t50, Intersection with reachable at each step enabled. (destroyed/rever...187
Computing Next relation with stutter on 49 deadlock states
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin7300722153654128182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7300722153654128182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2970 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.7434,599448,1,0,1.15466e+06,53,1223,690954,89,74,563199
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 398899 ms.
BK_STOP 1716719653321
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="LTLFireability"
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 ResAllocation-PT-R050C002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662339500876"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R050C002.tgz
mv ResAllocation-PT-R050C002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;