About the Execution of ITS-Tools for ShieldRVs-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16213.819 | 3600000.00 | 12264205.00 | 26952.80 | FFF??FFFF??FFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025800828.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800828
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.0K Apr 30 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 370K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653057042233
Running Version 202205111006
[2022-05-20 14:30:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 14:30:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 14:30:43] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-20 14:30:43] [INFO ] Transformed 1203 places.
[2022-05-20 14:30:43] [INFO ] Transformed 1353 transitions.
[2022-05-20 14:30:43] [INFO ] Found NUPN structural information;
[2022-05-20 14:30:43] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-030B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Discarding 206 places :
Symmetric choice reduction at 0 with 206 rule applications. Total rules 206 place count 997 transition count 1147
Iterating global reduction 0 with 206 rules applied. Total rules applied 412 place count 997 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 413 place count 996 transition count 1146
Iterating global reduction 0 with 1 rules applied. Total rules applied 414 place count 996 transition count 1146
Applied a total of 414 rules in 221 ms. Remains 996 /1203 variables (removed 207) and now considering 1146/1353 (removed 207) transitions.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:30:44] [INFO ] Computed 121 place invariants in 30 ms
[2022-05-20 14:30:44] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:30:44] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:30:45] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:30:45] [INFO ] Computed 121 place invariants in 14 ms
[2022-05-20 14:30:45] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 996/1203 places, 1146/1353 transitions.
Finished structural reductions, in 1 iterations. Remains : 996/1203 places, 1146/1353 transitions.
Support contains 41 out of 996 places after structural reductions.
[2022-05-20 14:30:46] [INFO ] Flatten gal took : 125 ms
[2022-05-20 14:30:47] [INFO ] Flatten gal took : 74 ms
[2022-05-20 14:30:47] [INFO ] Input system was already deterministic with 1146 transitions.
Support contains 39 out of 996 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:30:47] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:30:47] [INFO ] [Real]Absence check using 121 positive place invariants in 46 ms returned sat
[2022-05-20 14:30:48] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 14:30:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2022-05-20 14:30:48] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 14:30:49] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 6 ms to minimize.
[2022-05-20 14:30:49] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 1 ms to minimize.
[2022-05-20 14:30:49] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2022-05-20 14:30:50] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 2 ms to minimize.
[2022-05-20 14:30:50] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 4 ms to minimize.
[2022-05-20 14:30:50] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 1 ms to minimize.
[2022-05-20 14:30:50] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 1 ms to minimize.
[2022-05-20 14:30:51] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2022-05-20 14:30:51] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 0 ms to minimize.
[2022-05-20 14:30:51] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 1 ms to minimize.
[2022-05-20 14:30:51] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 1 ms to minimize.
[2022-05-20 14:30:52] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2022-05-20 14:30:52] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2022-05-20 14:30:52] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 0 ms to minimize.
[2022-05-20 14:30:52] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2022-05-20 14:30:53] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 1 ms to minimize.
[2022-05-20 14:30:53] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 1 ms to minimize.
[2022-05-20 14:30:53] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2022-05-20 14:30:53] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 1 ms to minimize.
[2022-05-20 14:30:53] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 1 ms to minimize.
[2022-05-20 14:30:54] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2022-05-20 14:30:54] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 0 ms to minimize.
[2022-05-20 14:30:54] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 1 ms to minimize.
[2022-05-20 14:30:54] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 0 ms to minimize.
[2022-05-20 14:30:54] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 0 ms to minimize.
[2022-05-20 14:30:55] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2022-05-20 14:30:55] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 1 ms to minimize.
[2022-05-20 14:30:55] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 1 ms to minimize.
[2022-05-20 14:30:55] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2022-05-20 14:30:55] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 1 ms to minimize.
[2022-05-20 14:30:55] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2022-05-20 14:30:56] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 0 ms to minimize.
[2022-05-20 14:30:56] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 0 ms to minimize.
[2022-05-20 14:30:56] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2022-05-20 14:30:56] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 4 ms to minimize.
[2022-05-20 14:30:56] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-05-20 14:30:57] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 1 ms to minimize.
[2022-05-20 14:30:57] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 1 ms to minimize.
[2022-05-20 14:30:57] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-05-20 14:30:57] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2022-05-20 14:30:57] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2022-05-20 14:30:57] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 0 ms to minimize.
[2022-05-20 14:30:58] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2022-05-20 14:30:58] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2022-05-20 14:30:58] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2022-05-20 14:30:58] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2022-05-20 14:30:58] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 0 ms to minimize.
[2022-05-20 14:30:58] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 0 ms to minimize.
[2022-05-20 14:30:58] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 1 ms to minimize.
[2022-05-20 14:30:59] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 0 ms to minimize.
[2022-05-20 14:30:59] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2022-05-20 14:30:59] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 0 ms to minimize.
[2022-05-20 14:30:59] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2022-05-20 14:30:59] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 0 ms to minimize.
[2022-05-20 14:30:59] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 1 ms to minimize.
[2022-05-20 14:30:59] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2022-05-20 14:31:00] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2022-05-20 14:31:00] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2022-05-20 14:31:00] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 0 ms to minimize.
[2022-05-20 14:31:00] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 0 ms to minimize.
[2022-05-20 14:31:00] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 11687 ms
[2022-05-20 14:31:00] [INFO ] After 12189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-20 14:31:00] [INFO ] After 12434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 996 transition count 1026
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 876 transition count 1026
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 240 place count 876 transition count 876
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 540 place count 726 transition count 876
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 544 place count 722 transition count 872
Iterating global reduction 2 with 4 rules applied. Total rules applied 548 place count 722 transition count 872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 548 place count 722 transition count 871
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 550 place count 721 transition count 871
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 297
Deduced a syphon composed of 297 places in 1 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 2 with 594 rules applied. Total rules applied 1144 place count 424 transition count 574
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 2 with 61 rules applied. Total rules applied 1205 place count 424 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1206 place count 423 transition count 573
Applied a total of 1206 rules in 282 ms. Remains 423 /996 variables (removed 573) and now considering 573/1146 (removed 573) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/996 places, 573/1146 transitions.
Finished random walk after 229 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=114 )
Computed a total of 241 stabilizing places and 241 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U !(X(G(p1))||F(p1))))))'
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 993 transition count 1143
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 993 transition count 1143
Applied a total of 6 rules in 218 ms. Remains 993 /996 variables (removed 3) and now considering 1143/1146 (removed 3) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:31:01] [INFO ] Computed 121 place invariants in 12 ms
[2022-05-20 14:31:02] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:31:02] [INFO ] Computed 121 place invariants in 9 ms
[2022-05-20 14:31:03] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:31:03] [INFO ] Computed 121 place invariants in 10 ms
[2022-05-20 14:31:03] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/996 places, 1143/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 993/996 places, 1143/1146 transitions.
Stuttering acceptance computed with spot in 277 ms :[p1, p1, true, p1]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s100 1), p0:(OR (EQ s117 1) (EQ s386 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 545 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-01 finished in 2416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(!F(X((F(p1) U F(p2))))))))'
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 48 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:03] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:31:04] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:04] [INFO ] Computed 121 place invariants in 9 ms
[2022-05-20 14:31:05] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:05] [INFO ] Computed 121 place invariants in 10 ms
[2022-05-20 14:31:05] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s421 1), p2:(OR (EQ s421 1) (EQ s737 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1753 reset in 337 ms.
Product exploration explored 100000 steps with 1750 reset in 265 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 722 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:07] [INFO ] Computed 121 place invariants in 20 ms
[2022-05-20 14:31:08] [INFO ] [Real]Absence check using 121 positive place invariants in 164 ms returned sat
[2022-05-20 14:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:31:10] [INFO ] [Real]Absence check using state equation in 1918 ms returned sat
[2022-05-20 14:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:31:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 235 ms returned sat
[2022-05-20 14:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:31:25] [INFO ] [Nat]Absence check using state equation in 14453 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Applied a total of 0 rules in 31 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:25] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:31:25] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:25] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:31:26] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:26] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:31:27] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/992 places, 1142/1142 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 763 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p2), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:31:28] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:31:29] [INFO ] [Real]Absence check using 121 positive place invariants in 160 ms returned sat
[2022-05-20 14:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:31:31] [INFO ] [Real]Absence check using state equation in 1932 ms returned sat
[2022-05-20 14:31:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:31:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 246 ms returned sat
[2022-05-20 14:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:31:46] [INFO ] [Nat]Absence check using state equation in 14409 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1757 reset in 231 ms.
Product exploration explored 100000 steps with 1797 reset in 370 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 992 transition count 1142
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 120 place count 992 transition count 1172
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 181 place count 992 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 991 transition count 1171
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 991 transition count 1171
Performed 385 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 565 places in 5 ms
Iterating global reduction 1 with 385 rules applied. Total rules applied 568 place count 991 transition count 1171
Renaming transitions due to excessive name length > 1024 char.
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 776 place count 783 transition count 963
Deduced a syphon composed of 357 places in 1 ms
Iterating global reduction 1 with 208 rules applied. Total rules applied 984 place count 783 transition count 963
Deduced a syphon composed of 357 places in 0 ms
Applied a total of 984 rules in 253 ms. Remains 783 /992 variables (removed 209) and now considering 963/1142 (removed 179) transitions.
[2022-05-20 14:31:47] [INFO ] Redundant transitions in 148 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 783 cols
[2022-05-20 14:31:47] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:31:47] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 783/992 places, 962/1142 transitions.
Deduced a syphon composed of 357 places in 4 ms
Applied a total of 0 rules in 39 ms. Remains 783 /783 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 783/992 places, 962/1142 transitions.
Product exploration explored 100000 steps with 10329 reset in 1140 ms.
Product exploration explored 100000 steps with 10359 reset in 1045 ms.
Built C files in :
/tmp/ltsmin148286712078406267
[2022-05-20 14:31:50] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin148286712078406267
Running compilation step : cd /tmp/ltsmin148286712078406267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1953 ms.
Running link step : cd /tmp/ltsmin148286712078406267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin148286712078406267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4444715396222491243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Applied a total of 0 rules in 15 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:32:05] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:32:05] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:32:05] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:32:06] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:32:06] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:32:06] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/992 places, 1142/1142 transitions.
Built C files in :
/tmp/ltsmin490472153833742592
[2022-05-20 14:32:06] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin490472153833742592
Running compilation step : cd /tmp/ltsmin490472153833742592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1918 ms.
Running link step : cd /tmp/ltsmin490472153833742592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin490472153833742592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5886099848148209850.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:32:22] [INFO ] Flatten gal took : 56 ms
[2022-05-20 14:32:22] [INFO ] Flatten gal took : 57 ms
[2022-05-20 14:32:22] [INFO ] Time to serialize gal into /tmp/LTL9398061303963778919.gal : 8 ms
[2022-05-20 14:32:22] [INFO ] Time to serialize properties into /tmp/LTL12679681831471892307.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9398061303963778919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12679681831471892307.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9398061...267
Read 1 LTL properties
Checking formula 0 : !((X(!(("(p505==1)")U(X(!(F(X((F("(p891==1)"))U(F("((p505==1)||(p891==1))")))))))))))
Formula 0 simplified : !X!("(p505==1)" U X!FX(F"(p891==1)" U F"((p505==1)||(p891==1))"))
Detected timeout of ITS tools.
[2022-05-20 14:32:37] [INFO ] Flatten gal took : 49 ms
[2022-05-20 14:32:37] [INFO ] Applying decomposition
[2022-05-20 14:32:37] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8771756485341756993.txt' '-o' '/tmp/graph8771756485341756993.bin' '-w' '/tmp/graph8771756485341756993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8771756485341756993.bin' '-l' '-1' '-v' '-w' '/tmp/graph8771756485341756993.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:32:37] [INFO ] Decomposing Gal with order
[2022-05-20 14:32:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:32:37] [INFO ] Removed a total of 1071 redundant transitions.
[2022-05-20 14:32:37] [INFO ] Flatten gal took : 122 ms
[2022-05-20 14:32:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-20 14:32:37] [INFO ] Time to serialize gal into /tmp/LTL3614529577444614238.gal : 15 ms
[2022-05-20 14:32:37] [INFO ] Time to serialize properties into /tmp/LTL1497837986205576243.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3614529577444614238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1497837986205576243.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3614529...245
Read 1 LTL properties
Checking formula 0 : !((X(!(("(i6.u161.p505==1)")U(X(!(F(X((F("(i12.u279.p891==1)"))U(F("((i6.u161.p505==1)||(i12.u279.p891==1))")))))))))))
Formula 0 simplified : !X!("(i6.u161.p505==1)" U X!FX(F"(i12.u279.p891==1)" U F"((i6.u161.p505==1)||(i12.u279.p891==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7827006271119035079
[2022-05-20 14:32:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7827006271119035079
Running compilation step : cd /tmp/ltsmin7827006271119035079;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1918 ms.
Running link step : cd /tmp/ltsmin7827006271119035079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7827006271119035079;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(!((LTLAPp0==true) U X(!<>(X((<>((LTLAPp1==true)) U <>((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-03 finished in 123916 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((!(p0 U p1)&&F(p2)))&&G(p2)&&p3))))'
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 39 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:33:07] [INFO ] Computed 121 place invariants in 10 ms
[2022-05-20 14:33:08] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:33:08] [INFO ] Computed 121 place invariants in 12 ms
[2022-05-20 14:33:08] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:33:08] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:33:09] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), (NOT p2), p1]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND p3 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p3 p2), acceptance={1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 p2 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 p2 p1), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 1}, { cond=p2, acceptance={1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p2) p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p3 p2 p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p3 p2 p1), acceptance={1} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s974 0) (EQ s985 0)), p2:(EQ s709 0), p1:(EQ s709 1), p0:(AND (EQ s974 1) (EQ s985 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 302 reset in 393 ms.
Product exploration explored 100000 steps with 278 reset in 423 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1)))), (X (NOT (AND p3 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND p3 p2)), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1))))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (AND p3 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1409 ms. Reduced automaton from 6 states, 19 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), (NOT p2), p1, false, false]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:33:12] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:33:12] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-20 14:33:12] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-20 14:33:12] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1)))), (X (NOT (AND p3 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND p3 p2)), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1))))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (AND p3 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p3 (NOT p1) p2 p0))), (G (NOT (AND p3 p1 p2))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p1) p2))), (F (OR (AND (NOT p3) p1) (AND p1 (NOT p2)))), (F (NOT (AND p3 (NOT p1) p2 (NOT p0)))), (F (OR (NOT p3) (NOT p2))), (F (NOT (AND p3 p2))), (F (AND (NOT p1) p0)), (F (NOT p2))]
Knowledge based reduction with 20 factoid took 1325 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Support contains 3 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 991 transition count 1020
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 870 transition count 1020
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 242 place count 870 transition count 872
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 538 place count 722 transition count 872
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1128 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 425 transition count 575
Applied a total of 1130 rules in 86 ms. Remains 425 /992 variables (removed 567) and now considering 575/1142 (removed 567) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:33:14] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:33:14] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:33:14] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:33:15] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2022-05-20 14:33:15] [INFO ] Redundant transitions in 98 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:33:15] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:33:15] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/992 places, 574/1142 transitions.
Applied a total of 0 rules in 12 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/992 places, 574/1142 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (NOT p3) p1)), (X (NOT (OR (NOT p3) p1))), (X (NOT p2)), (X p2), (X (AND p3 (NOT p1))), (X (NOT (AND p3 (NOT p1)))), (X (X (OR (NOT p3) p1))), (X (X (NOT (OR (NOT p3) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 481 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Finished random walk after 7 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (NOT p3) p1)), (X (NOT (OR (NOT p3) p1))), (X (NOT p2)), (X p2), (X (AND p3 (NOT p1))), (X (NOT (AND p3 (NOT p1)))), (X (X (OR (NOT p3) p1))), (X (X (NOT (OR (NOT p3) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (AND (NOT p1) p0)), (F (OR (NOT p3) p1)), (F p1), (F (NOT (AND p3 (NOT p1))))]
Knowledge based reduction with 4 factoid took 1109 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Product exploration explored 100000 steps with 397 reset in 390 ms.
Product exploration explored 100000 steps with 451 reset in 465 ms.
Built C files in :
/tmp/ltsmin16227658326416620707
[2022-05-20 14:33:19] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:33:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:33:19] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:33:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:33:19] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:33:19] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:33:19] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16227658326416620707
Running compilation step : cd /tmp/ltsmin16227658326416620707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1301 ms.
Running link step : cd /tmp/ltsmin16227658326416620707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16227658326416620707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18066506520794021105.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:33:34] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:33:34] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:33:34] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:33:34] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2022-05-20 14:33:34] [INFO ] Redundant transitions in 105 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:33:34] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:33:35] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 574/574 transitions.
Built C files in :
/tmp/ltsmin6559133273868573482
[2022-05-20 14:33:35] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:33:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:33:35] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:33:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:33:35] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:33:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:33:35] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6559133273868573482
Running compilation step : cd /tmp/ltsmin6559133273868573482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1337 ms.
Running link step : cd /tmp/ltsmin6559133273868573482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6559133273868573482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12651256799089518794.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:33:50] [INFO ] Flatten gal took : 21 ms
[2022-05-20 14:33:50] [INFO ] Flatten gal took : 20 ms
[2022-05-20 14:33:50] [INFO ] Time to serialize gal into /tmp/LTL3382893500581996913.gal : 4 ms
[2022-05-20 14:33:50] [INFO ] Time to serialize properties into /tmp/LTL2964657337094094462.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3382893500581996913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2964657337094094462.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3382893...266
Read 1 LTL properties
Checking formula 0 : !((G(F(((X((!(("((p1181==1)&&(p1194==1))")U("(p856==1)")))&&(F("(p856==0)"))))&&(G("(p856==0)")))&&("((p1181==0)||(p1194==0))")))))
Formula 0 simplified : !GF("((p1181==0)||(p1194==0))" & X(!("((p1181==1)&&(p1194==1))" U "(p856==1)") & F"(p856==0)") & G"(p856==0)")
Detected timeout of ITS tools.
[2022-05-20 14:34:05] [INFO ] Flatten gal took : 21 ms
[2022-05-20 14:34:05] [INFO ] Applying decomposition
[2022-05-20 14:34:05] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9192085014194122208.txt' '-o' '/tmp/graph9192085014194122208.bin' '-w' '/tmp/graph9192085014194122208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9192085014194122208.bin' '-l' '-1' '-v' '-w' '/tmp/graph9192085014194122208.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:34:05] [INFO ] Decomposing Gal with order
[2022-05-20 14:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:34:05] [INFO ] Removed a total of 631 redundant transitions.
[2022-05-20 14:34:05] [INFO ] Flatten gal took : 39 ms
[2022-05-20 14:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 642 labels/synchronizations in 16 ms.
[2022-05-20 14:34:05] [INFO ] Time to serialize gal into /tmp/LTL16578413955868331746.gal : 3 ms
[2022-05-20 14:34:05] [INFO ] Time to serialize properties into /tmp/LTL6358350103921970434.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16578413955868331746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6358350103921970434.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1657841...246
Read 1 LTL properties
Checking formula 0 : !((G(F(((X((!(("((i13.u119.p1181==1)&&(i13.u121.p1194==1))")U("(i9.i1.u85.p856==1)")))&&(F("(i9.i1.u85.p856==0)"))))&&(G("(i9.i1.u85.p...218
Formula 0 simplified : !GF("((i13.u119.p1181==0)||(i13.u121.p1194==0))" & X(!("((i13.u119.p1181==1)&&(i13.u121.p1194==1))" U "(i9.i1.u85.p856==1)") & F"(i9...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16452408961881142517
[2022-05-20 14:34:20] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16452408961881142517
Running compilation step : cd /tmp/ltsmin16452408961881142517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 939 ms.
Running link step : cd /tmp/ltsmin16452408961881142517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16452408961881142517;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp2==true))))&&[]((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 87948 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 995 transition count 1026
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 239 place count 876 transition count 1025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 875 transition count 1025
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 240 place count 875 transition count 876
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 538 place count 726 transition count 876
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 542 place count 722 transition count 872
Iterating global reduction 3 with 4 rules applied. Total rules applied 546 place count 722 transition count 872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 546 place count 722 transition count 871
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 548 place count 721 transition count 871
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1136 place count 427 transition count 577
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1138 place count 425 transition count 575
Applied a total of 1138 rules in 91 ms. Remains 425 /996 variables (removed 571) and now considering 575/1146 (removed 571) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:34:35] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:34:36] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:34:36] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:34:36] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2022-05-20 14:34:36] [INFO ] Redundant transitions in 85 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:34:36] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:34:36] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/996 places, 574/1146 transitions.
Applied a total of 0 rules in 15 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/996 places, 574/1146 transitions.
Stuttering acceptance computed with spot in 795 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s317 1), p0:(EQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 458 steps with 5 reset in 5 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-05 finished in 1826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 1 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 995 transition count 1025
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 875 transition count 1025
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 875 transition count 876
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 726 transition count 876
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 542 place count 722 transition count 872
Iterating global reduction 2 with 4 rules applied. Total rules applied 546 place count 722 transition count 872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 546 place count 722 transition count 871
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 548 place count 721 transition count 871
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 0 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1140 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1142 place count 423 transition count 573
Applied a total of 1142 rules in 84 ms. Remains 423 /996 variables (removed 573) and now considering 573/1146 (removed 573) transitions.
// Phase 1: matrix 573 rows 423 cols
[2022-05-20 14:34:37] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:34:37] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 573 rows 423 cols
[2022-05-20 14:34:37] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:34:38] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2022-05-20 14:34:38] [INFO ] Redundant transitions in 103 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:34:38] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:34:38] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/996 places, 572/1146 transitions.
Applied a total of 0 rules in 11 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 423/996 places, 572/1146 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 417 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-06 finished in 1030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||X(G(p2)))))'
Support contains 7 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 45 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:38] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 14:34:38] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:38] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:34:39] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:39] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 14:34:40] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s295 1) (EQ s331 1) (EQ s350 1)), p1:(AND (OR (EQ s598 0) (EQ s605 0) (EQ s626 0)) (EQ s504 0)), p2:(EQ s504 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1265 steps with 0 reset in 8 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 1818 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 45 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:40] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 14:34:40] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:40] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:34:41] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:41] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:34:42] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-08 finished in 1828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 46 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:42] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:34:42] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:42] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 14:34:43] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:43] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 14:34:43] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s315 1), p0:(EQ s899 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 205 reset in 369 ms.
Product exploration explored 100000 steps with 216 reset in 409 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 897 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:34:45] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:34:46] [INFO ] [Real]Absence check using 121 positive place invariants in 67 ms returned sat
[2022-05-20 14:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:34:47] [INFO ] [Real]Absence check using state equation in 1883 ms returned sat
[2022-05-20 14:34:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:34:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 71 ms returned sat
[2022-05-20 14:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:34:50] [INFO ] [Nat]Absence check using state equation in 2072 ms returned sat
[2022-05-20 14:34:50] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2022-05-20 14:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-20 14:34:50] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 66 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 14:35:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:35:02] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 14:35:03] [INFO ] [Real]Absence check using 121 positive place invariants in 64 ms returned sat
[2022-05-20 14:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:35:05] [INFO ] [Real]Absence check using state equation in 1880 ms returned sat
[2022-05-20 14:35:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:35:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 74 ms returned sat
[2022-05-20 14:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:35:08] [INFO ] [Nat]Absence check using state equation in 2558 ms returned sat
[2022-05-20 14:35:08] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 61 ms.
[2022-05-20 14:35:20] [INFO ] Deduced a trap composed of 14 places in 588 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 14:35:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Applied a total of 0 rules in 23 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:35:20] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:35:21] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:35:21] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:35:22] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:35:22] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:35:22] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/992 places, 1142/1142 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 909 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:35:23] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:35:24] [INFO ] [Real]Absence check using 121 positive place invariants in 63 ms returned sat
[2022-05-20 14:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:35:25] [INFO ] [Real]Absence check using state equation in 1877 ms returned sat
[2022-05-20 14:35:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:35:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 67 ms returned sat
[2022-05-20 14:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:35:28] [INFO ] [Nat]Absence check using state equation in 2071 ms returned sat
[2022-05-20 14:35:28] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2022-05-20 14:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-20 14:35:28] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 57 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 14:35:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:35:41] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:35:41] [INFO ] [Real]Absence check using 121 positive place invariants in 64 ms returned sat
[2022-05-20 14:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:35:43] [INFO ] [Real]Absence check using state equation in 1873 ms returned sat
[2022-05-20 14:35:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:35:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 72 ms returned sat
[2022-05-20 14:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:35:46] [INFO ] [Nat]Absence check using state equation in 2465 ms returned sat
[2022-05-20 14:35:46] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 60 ms.
[2022-05-20 14:35:58] [INFO ] Added : 670 causal constraints over 134 iterations in 12065 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 206 reset in 355 ms.
Product exploration explored 100000 steps with 221 reset in 405 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 992 transition count 1142
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 119 place count 992 transition count 1171
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 180 place count 992 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 991 transition count 1170
Deduced a syphon composed of 179 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 991 transition count 1170
Performed 386 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 565 places in 1 ms
Iterating global reduction 1 with 386 rules applied. Total rules applied 568 place count 991 transition count 1170
Renaming transitions due to excessive name length > 1024 char.
Discarding 209 places :
Symmetric choice reduction at 1 with 209 rule applications. Total rules 777 place count 782 transition count 961
Deduced a syphon composed of 356 places in 1 ms
Iterating global reduction 1 with 209 rules applied. Total rules applied 986 place count 782 transition count 961
Deduced a syphon composed of 356 places in 1 ms
Applied a total of 986 rules in 154 ms. Remains 782 /992 variables (removed 210) and now considering 961/1142 (removed 181) transitions.
[2022-05-20 14:35:59] [INFO ] Redundant transitions in 136 ms returned [960]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 782 cols
[2022-05-20 14:35:59] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:36:00] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 782/992 places, 960/1142 transitions.
Deduced a syphon composed of 356 places in 1 ms
Applied a total of 0 rules in 20 ms. Remains 782 /782 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 782/992 places, 960/1142 transitions.
Product exploration explored 100000 steps with 759 reset in 498 ms.
Product exploration explored 100000 steps with 752 reset in 524 ms.
Built C files in :
/tmp/ltsmin1471516584523619170
[2022-05-20 14:36:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1471516584523619170
Running compilation step : cd /tmp/ltsmin1471516584523619170;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1882 ms.
Running link step : cd /tmp/ltsmin1471516584523619170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1471516584523619170;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13159659258080319843.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Applied a total of 0 rules in 28 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:36:16] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:36:16] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:36:16] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:36:17] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:36:17] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:36:18] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/992 places, 1142/1142 transitions.
Built C files in :
/tmp/ltsmin13034320616366293501
[2022-05-20 14:36:18] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13034320616366293501
Running compilation step : cd /tmp/ltsmin13034320616366293501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1851 ms.
Running link step : cd /tmp/ltsmin13034320616366293501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13034320616366293501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9637618390806855839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:36:33] [INFO ] Flatten gal took : 34 ms
[2022-05-20 14:36:33] [INFO ] Flatten gal took : 34 ms
[2022-05-20 14:36:33] [INFO ] Time to serialize gal into /tmp/LTL11166811804417883103.gal : 22 ms
[2022-05-20 14:36:33] [INFO ] Time to serialize properties into /tmp/LTL5739754706937470676.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11166811804417883103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5739754706937470676.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1116681...267
Read 1 LTL properties
Checking formula 0 : !(((X(F("(p1088==1)")))&&(F("(p376==1)"))))
Formula 0 simplified : !(XF"(p1088==1)" & F"(p376==1)")
Detected timeout of ITS tools.
[2022-05-20 14:36:48] [INFO ] Flatten gal took : 36 ms
[2022-05-20 14:36:48] [INFO ] Applying decomposition
[2022-05-20 14:36:48] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17478763506693061375.txt' '-o' '/tmp/graph17478763506693061375.bin' '-w' '/tmp/graph17478763506693061375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17478763506693061375.bin' '-l' '-1' '-v' '-w' '/tmp/graph17478763506693061375.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:36:48] [INFO ] Decomposing Gal with order
[2022-05-20 14:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:36:48] [INFO ] Removed a total of 1071 redundant transitions.
[2022-05-20 14:36:48] [INFO ] Flatten gal took : 67 ms
[2022-05-20 14:36:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-20 14:36:48] [INFO ] Time to serialize gal into /tmp/LTL15193977485646305791.gal : 42 ms
[2022-05-20 14:36:48] [INFO ] Time to serialize properties into /tmp/LTL2145176553129772171.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15193977485646305791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2145176553129772171.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1519397...246
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i15.u339.p1088==1)")))&&(F("(i4.u120.p376==1)"))))
Formula 0 simplified : !(XF"(i15.u339.p1088==1)" & F"(i4.u120.p376==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2805146338058798278
[2022-05-20 14:37:03] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2805146338058798278
Running compilation step : cd /tmp/ltsmin2805146338058798278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1951 ms.
Running link step : cd /tmp/ltsmin2805146338058798278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2805146338058798278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-09 finished in 156618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(F(p0)))&&p1))))'
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 995 transition count 1024
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 874 transition count 1024
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 874 transition count 874
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 724 transition count 874
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 546 place count 720 transition count 870
Iterating global reduction 2 with 4 rules applied. Total rules applied 550 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 550 place count 720 transition count 869
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 552 place count 719 transition count 869
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1140 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1142 place count 423 transition count 573
Applied a total of 1142 rules in 87 ms. Remains 423 /996 variables (removed 573) and now considering 573/1146 (removed 573) transitions.
// Phase 1: matrix 573 rows 423 cols
[2022-05-20 14:37:18] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:37:19] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 573 rows 423 cols
[2022-05-20 14:37:19] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:37:19] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2022-05-20 14:37:19] [INFO ] Redundant transitions in 94 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:37:19] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:37:19] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/996 places, 572/1146 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 423/996 places, 572/1146 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s418 0), p1:(EQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6181 reset in 439 ms.
Product exploration explored 100000 steps with 5837 reset in 488 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 308 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 14 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:37:21] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:37:22] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:37:22] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:37:22] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2022-05-20 14:37:22] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:37:22] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:37:22] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 572/572 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 274 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 320 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5963 reset in 357 ms.
Product exploration explored 100000 steps with 5802 reset in 413 ms.
Built C files in :
/tmp/ltsmin1832504637115780538
[2022-05-20 14:37:24] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-05-20 14:37:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:37:24] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-05-20 14:37:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:37:24] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-05-20 14:37:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:37:24] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1832504637115780538
Running compilation step : cd /tmp/ltsmin1832504637115780538;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1346 ms.
Running link step : cd /tmp/ltsmin1832504637115780538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1832504637115780538;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6970687633385436009.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 18 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:37:39] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:37:39] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:37:39] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:37:40] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2022-05-20 14:37:40] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:37:40] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:37:40] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 572/572 transitions.
Built C files in :
/tmp/ltsmin5913964845946607441
[2022-05-20 14:37:40] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-05-20 14:37:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:37:40] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-05-20 14:37:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:37:40] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-05-20 14:37:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:37:40] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5913964845946607441
Running compilation step : cd /tmp/ltsmin5913964845946607441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1325 ms.
Running link step : cd /tmp/ltsmin5913964845946607441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5913964845946607441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9093074967125380883.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:37:55] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:37:55] [INFO ] Flatten gal took : 18 ms
[2022-05-20 14:37:55] [INFO ] Time to serialize gal into /tmp/LTL5353855167967197274.gal : 5 ms
[2022-05-20 14:37:55] [INFO ] Time to serialize properties into /tmp/LTL16132513911528654871.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5353855167967197274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16132513911528654871.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5353855...267
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G(F("(p1188==0)"))))&&("(p115==0)")))))
Formula 0 simplified : !GF("(p115==0)" & FGF"(p1188==0)")
Detected timeout of ITS tools.
[2022-05-20 14:38:10] [INFO ] Flatten gal took : 18 ms
[2022-05-20 14:38:10] [INFO ] Applying decomposition
[2022-05-20 14:38:10] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9833758398446489102.txt' '-o' '/tmp/graph9833758398446489102.bin' '-w' '/tmp/graph9833758398446489102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9833758398446489102.bin' '-l' '-1' '-v' '-w' '/tmp/graph9833758398446489102.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:38:10] [INFO ] Decomposing Gal with order
[2022-05-20 14:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:38:10] [INFO ] Removed a total of 631 redundant transitions.
[2022-05-20 14:38:10] [INFO ] Flatten gal took : 34 ms
[2022-05-20 14:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 628 labels/synchronizations in 9 ms.
[2022-05-20 14:38:10] [INFO ] Time to serialize gal into /tmp/LTL10086401866814965886.gal : 4 ms
[2022-05-20 14:38:10] [INFO ] Time to serialize properties into /tmp/LTL17513857527595921042.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10086401866814965886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17513857527595921042.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1008640...247
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G(F("(i12.i2.u120.p1188==0)"))))&&("(i1.i0.u9.p115==0)")))))
Formula 0 simplified : !GF("(i1.i0.u9.p115==0)" & FGF"(i12.i2.u120.p1188==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1953302654807855598
[2022-05-20 14:38:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1953302654807855598
Running compilation step : cd /tmp/ltsmin1953302654807855598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 962 ms.
Running link step : cd /tmp/ltsmin1953302654807855598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1953302654807855598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((<>([](<>((LTLAPp0==true))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-10 finished in 82219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((p0&&((p1 U p2)||G(p3)))))))'
Support contains 6 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 995 transition count 1027
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 877 transition count 1027
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 236 place count 877 transition count 877
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 536 place count 727 transition count 877
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 538 place count 725 transition count 875
Iterating global reduction 2 with 2 rules applied. Total rules applied 540 place count 725 transition count 875
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1130 place count 430 transition count 580
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 428 transition count 578
Applied a total of 1132 rules in 81 ms. Remains 428 /996 variables (removed 568) and now considering 578/1146 (removed 568) transitions.
// Phase 1: matrix 578 rows 428 cols
[2022-05-20 14:38:41] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:38:41] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 578 rows 428 cols
[2022-05-20 14:38:41] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:38:41] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2022-05-20 14:38:41] [INFO ] Redundant transitions in 91 ms returned [577]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 577 rows 428 cols
[2022-05-20 14:38:41] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:38:42] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/996 places, 577/1146 transitions.
Applied a total of 0 rules in 9 ms. Remains 428 /428 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 428/996 places, 577/1146 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0) (AND p0 p3)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=0 dest: 3}], [{ cond=(OR (AND p2 p0 (NOT p3)) (AND p1 p0 (NOT p3))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p2 p0 p3) (AND p1 p0 p3)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) p3) (AND (NOT p0) p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p1 (NOT p0)) (AND (NOT p2) p1 (NOT p3))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s370 1), p0:(EQ s183 1), p1:(EQ s3 1), p3:(AND (EQ s324 1) (EQ s327 1) (EQ s336 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 432 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-12 finished in 1245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 45 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:42] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:38:42] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:42] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:38:43] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:43] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:38:43] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s340 1) (EQ s351 1) (EQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-13 finished in 1764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((X(p0) U p0)))))'
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 43 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:44] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:38:44] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:44] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:38:45] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:45] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:38:45] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s683 1) (EQ s686 1) (EQ s693 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1315 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-14 finished in 1729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0||F(p1)))&&F(p0))))'
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 992 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 992 transition count 1142
Applied a total of 8 rules in 51 ms. Remains 992 /996 variables (removed 4) and now considering 1142/1146 (removed 4) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:45] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 14:38:46] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:46] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:38:46] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:46] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:38:47] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/996 places, 1142/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/996 places, 1142/1146 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s227 1), p1:(AND (EQ s822 1) (EQ s831 1) (EQ s850 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 225 reset in 318 ms.
Product exploration explored 100000 steps with 229 reset in 335 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 391 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=195 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 1142 rows 992 cols
[2022-05-20 14:38:48] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:38:49] [INFO ] [Real]Absence check using 121 positive place invariants in 69 ms returned sat
[2022-05-20 14:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:38:51] [INFO ] [Real]Absence check using state equation in 2262 ms returned sat
[2022-05-20 14:38:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:38:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 71 ms returned sat
[2022-05-20 14:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:38:54] [INFO ] [Nat]Absence check using state equation in 1969 ms returned sat
[2022-05-20 14:38:54] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2022-05-20 14:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 719 ms
[2022-05-20 14:38:54] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 64 ms.
[2022-05-20 14:39:06] [INFO ] Added : 680 causal constraints over 136 iterations in 11887 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 992 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 991 transition count 1023
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 873 transition count 1023
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 236 place count 873 transition count 872
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 538 place count 722 transition count 872
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1126 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1128 place count 426 transition count 576
Applied a total of 1128 rules in 59 ms. Remains 426 /992 variables (removed 566) and now considering 576/1142 (removed 566) transitions.
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:39:06] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:39:06] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:39:06] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:39:07] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2022-05-20 14:39:07] [INFO ] Redundant transitions in 94 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2022-05-20 14:39:07] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:39:07] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/992 places, 575/1142 transitions.
Applied a total of 0 rules in 9 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 426/992 places, 575/1142 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/426 stabilizing places and 2/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 575 rows 426 cols
[2022-05-20 14:39:08] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:39:08] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-20 14:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:39:08] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-05-20 14:39:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:39:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:39:09] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2022-05-20 14:39:09] [INFO ] Computed and/alt/rep : 507/2173/507 causal constraints (skipped 64 transitions) in 33 ms.
[2022-05-20 14:39:14] [INFO ] Added : 440 causal constraints over 90 iterations in 5474 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21175 reset in 397 ms.
Product exploration explored 100000 steps with 21328 reset in 417 ms.
Built C files in :
/tmp/ltsmin10194180281103723555
[2022-05-20 14:39:15] [INFO ] Computing symmetric may disable matrix : 575 transitions.
[2022-05-20 14:39:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:39:15] [INFO ] Computing symmetric may enable matrix : 575 transitions.
[2022-05-20 14:39:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:39:15] [INFO ] Computing Do-Not-Accords matrix : 575 transitions.
[2022-05-20 14:39:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:39:15] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10194180281103723555
Running compilation step : cd /tmp/ltsmin10194180281103723555;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1491 ms.
Running link step : cd /tmp/ltsmin10194180281103723555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10194180281103723555;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12242292208654052178.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 575/575 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 426 transition count 573
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 424 transition count 573
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 6 place count 423 transition count 572
Applied a total of 6 rules in 20 ms. Remains 423 /426 variables (removed 3) and now considering 572/575 (removed 3) transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:39:30] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:39:30] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:39:30] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:39:31] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2022-05-20 14:39:31] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:39:31] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:39:31] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/426 places, 572/575 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/426 places, 572/575 transitions.
Built C files in :
/tmp/ltsmin4442240869350546621
[2022-05-20 14:39:31] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-05-20 14:39:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:39:31] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-05-20 14:39:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:39:31] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-05-20 14:39:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:39:31] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4442240869350546621
Running compilation step : cd /tmp/ltsmin4442240869350546621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1295 ms.
Running link step : cd /tmp/ltsmin4442240869350546621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4442240869350546621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9995128049957270593.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:39:46] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:39:46] [INFO ] Flatten gal took : 18 ms
[2022-05-20 14:39:46] [INFO ] Time to serialize gal into /tmp/LTL10372285022976952408.gal : 3 ms
[2022-05-20 14:39:46] [INFO ] Time to serialize properties into /tmp/LTL13267871072619964808.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10372285022976952408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13267871072619964808.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1037228...268
Read 1 LTL properties
Checking formula 0 : !((F((X(("(p269==1)")||(F("(((p994==1)&&(p1005==1))&&(p1028==1))"))))&&(F("(p269==1)")))))
Formula 0 simplified : !F(X("(p269==1)" | F"(((p994==1)&&(p1005==1))&&(p1028==1))") & F"(p269==1)")
Detected timeout of ITS tools.
[2022-05-20 14:40:01] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:40:01] [INFO ] Applying decomposition
[2022-05-20 14:40:01] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph133785435567217106.txt' '-o' '/tmp/graph133785435567217106.bin' '-w' '/tmp/graph133785435567217106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph133785435567217106.bin' '-l' '-1' '-v' '-w' '/tmp/graph133785435567217106.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:40:01] [INFO ] Decomposing Gal with order
[2022-05-20 14:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:40:01] [INFO ] Removed a total of 634 redundant transitions.
[2022-05-20 14:40:01] [INFO ] Flatten gal took : 39 ms
[2022-05-20 14:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 684 labels/synchronizations in 9 ms.
[2022-05-20 14:40:01] [INFO ] Time to serialize gal into /tmp/LTL845174231737656488.gal : 3 ms
[2022-05-20 14:40:01] [INFO ] Time to serialize properties into /tmp/LTL9167065179708228007.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL845174231737656488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9167065179708228007.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8451742...244
Read 1 LTL properties
Checking formula 0 : !((F((X(("(i3.i1.u25.p269==1)")||(F("(((i12.i0.u100.p994==1)&&(i12.i0.u102.p1005==1))&&(i12.i1.u106.p1028==1))"))))&&(F("(i3.i1.u25.p2...167
Formula 0 simplified : !F(X("(i3.i1.u25.p269==1)" | F"(((i12.i0.u100.p994==1)&&(i12.i0.u102.p1005==1))&&(i12.i1.u106.p1028==1))") & F"(i3.i1.u25.p269==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18118469577172707193
[2022-05-20 14:40:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18118469577172707193
Running compilation step : cd /tmp/ltsmin18118469577172707193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 939 ms.
Running link step : cd /tmp/ltsmin18118469577172707193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18118469577172707193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(((LTLAPp0==true)||<>((LTLAPp1==true))))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-15 finished in 106343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(!F(X((F(p1) U F(p2))))))))'
Found a CL insensitive property : ShieldRVs-PT-030B-LTLFireability-03
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 995 transition count 1025
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 875 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 874 transition count 1024
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 242 place count 874 transition count 874
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 542 place count 724 transition count 874
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 546 place count 720 transition count 870
Iterating global reduction 3 with 4 rules applied. Total rules applied 550 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 550 place count 720 transition count 869
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 552 place count 719 transition count 869
Performed 292 Post agglomeration using F-continuation condition.Transition count delta: 292
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1136 place count 427 transition count 577
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1138 place count 425 transition count 575
Applied a total of 1138 rules in 89 ms. Remains 425 /996 variables (removed 571) and now considering 575/1146 (removed 571) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:32] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:40:32] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:32] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:40:33] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:33] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:40:33] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 425/996 places, 575/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/996 places, 575/1146 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s172 1), p2:(OR (EQ s172 1) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18538 reset in 509 ms.
Product exploration explored 100000 steps with 18386 reset in 539 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/425 stabilizing places and 4/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p2)]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:35] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:40:35] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2022-05-20 14:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:40:35] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2022-05-20 14:40:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:40:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2022-05-20 14:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:40:36] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-05-20 14:40:36] [INFO ] Computed and/alt/rep : 334/1297/334 causal constraints (skipped 239 transitions) in 34 ms.
[2022-05-20 14:40:39] [INFO ] Added : 254 causal constraints over 51 iterations in 2357 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 9 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:39] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:40:39] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:39] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:40:39] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:39] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:40:39] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 575/575 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/425 stabilizing places and 4/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:40:40] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:40:40] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-20 14:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:40:41] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2022-05-20 14:40:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:40:41] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-20 14:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:40:41] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2022-05-20 14:40:41] [INFO ] Computed and/alt/rep : 334/1297/334 causal constraints (skipped 239 transitions) in 35 ms.
[2022-05-20 14:40:44] [INFO ] Added : 254 causal constraints over 51 iterations in 2383 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 18501 reset in 527 ms.
Product exploration explored 100000 steps with 18539 reset in 534 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 17 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2022-05-20 14:40:45] [INFO ] Redundant transitions in 98 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:40:45] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:40:46] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/425 places, 574/575 transitions.
Applied a total of 0 rules in 9 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/425 places, 574/575 transitions.
Product exploration explored 100000 steps with 18450 reset in 1752 ms.
Product exploration explored 100000 steps with 18456 reset in 1810 ms.
Built C files in :
/tmp/ltsmin6353543663057921404
[2022-05-20 14:40:49] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6353543663057921404
Running compilation step : cd /tmp/ltsmin6353543663057921404;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 947 ms.
Running link step : cd /tmp/ltsmin6353543663057921404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6353543663057921404;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1776939081745147667.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 13 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:41:04] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:41:04] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:41:04] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:41:05] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:41:05] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:41:05] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 575/575 transitions.
Built C files in :
/tmp/ltsmin7644896897891439652
[2022-05-20 14:41:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7644896897891439652
Running compilation step : cd /tmp/ltsmin7644896897891439652;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 966 ms.
Running link step : cd /tmp/ltsmin7644896897891439652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7644896897891439652;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4482663762026714980.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:41:20] [INFO ] Flatten gal took : 21 ms
[2022-05-20 14:41:20] [INFO ] Flatten gal took : 20 ms
[2022-05-20 14:41:20] [INFO ] Time to serialize gal into /tmp/LTL1493222181116071366.gal : 2 ms
[2022-05-20 14:41:20] [INFO ] Time to serialize properties into /tmp/LTL15179640235651919789.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1493222181116071366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15179640235651919789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1493222...267
Read 1 LTL properties
Checking formula 0 : !((X(!(("(p505==1)")U(X(!(F(X((F("(p891==1)"))U(F("((p505==1)||(p891==1))")))))))))))
Formula 0 simplified : !X!("(p505==1)" U X!FX(F"(p891==1)" U F"((p505==1)||(p891==1))"))
Detected timeout of ITS tools.
[2022-05-20 14:41:35] [INFO ] Flatten gal took : 24 ms
[2022-05-20 14:41:35] [INFO ] Applying decomposition
[2022-05-20 14:41:35] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5789356353312953501.txt' '-o' '/tmp/graph5789356353312953501.bin' '-w' '/tmp/graph5789356353312953501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5789356353312953501.bin' '-l' '-1' '-v' '-w' '/tmp/graph5789356353312953501.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:41:36] [INFO ] Decomposing Gal with order
[2022-05-20 14:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:41:36] [INFO ] Removed a total of 633 redundant transitions.
[2022-05-20 14:41:36] [INFO ] Flatten gal took : 34 ms
[2022-05-20 14:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 642 labels/synchronizations in 82 ms.
[2022-05-20 14:41:36] [INFO ] Time to serialize gal into /tmp/LTL4763009786522335595.gal : 10 ms
[2022-05-20 14:41:36] [INFO ] Time to serialize properties into /tmp/LTL11230623515961393271.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4763009786522335595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11230623515961393271.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4763009...246
Read 1 LTL properties
Checking formula 0 : !((X(!(("(i4.i1.u49.p505==1)")U(X(!(F(X((F("(i8.i0.u91.p891==1)"))U(F("((i4.i1.u49.p505==1)||(i8.i0.u91.p891==1))")))))))))))
Formula 0 simplified : !X!("(i4.i1.u49.p505==1)" U X!FX(F"(i8.i0.u91.p891==1)" U F"((i4.i1.u49.p505==1)||(i8.i0.u91.p891==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15439658588133101347
[2022-05-20 14:41:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15439658588133101347
Running compilation step : cd /tmp/ltsmin15439658588133101347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 930 ms.
Running link step : cd /tmp/ltsmin15439658588133101347;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15439658588133101347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(!((LTLAPp0==true) U X(!<>(X((<>((LTLAPp1==true)) U <>((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-03 finished in 94137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((!(p0 U p1)&&F(p2)))&&G(p2)&&p3))))'
Found a CL insensitive property : ShieldRVs-PT-030B-LTLFireability-04
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), (NOT p2), p1]
Support contains 3 out of 996 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 995 transition count 1024
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 874 transition count 1024
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 242 place count 874 transition count 876
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 538 place count 726 transition count 876
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 542 place count 722 transition count 872
Iterating global reduction 2 with 4 rules applied. Total rules applied 546 place count 722 transition count 872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 546 place count 722 transition count 871
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 548 place count 721 transition count 871
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1136 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1138 place count 425 transition count 575
Applied a total of 1138 rules in 79 ms. Remains 425 /996 variables (removed 571) and now considering 575/1146 (removed 571) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:42:06] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:42:07] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:42:07] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:42:07] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:42:07] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:42:07] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 425/996 places, 575/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/996 places, 575/1146 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND p3 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p3 p2), acceptance={1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 p2 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 p2 p1), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 1}, { cond=p2, acceptance={1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p2) p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p3 p2 p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p3 p2 p1), acceptance={1} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s415 0) (EQ s421 0)), p2:(EQ s297 0), p1:(EQ s297 1), p0:(AND (EQ s415 1) (EQ s421 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 605 reset in 338 ms.
Product exploration explored 100000 steps with 604 reset in 401 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (NOT (AND p3 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p3) p1) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1)))), (X (NOT p2)), (X p2), (X (OR (NOT p3) (NOT p2))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND p3 p2)), (X (NOT (AND p3 p2))), (X (X (OR (AND (NOT p3) p1) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 850 ms. Reduced automaton from 6 states, 19 edges and 4 AP to 8 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), (NOT p2), p1, false, false]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:42:09] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:42:09] [INFO ] [Real]Absence check using 121 positive place invariants in 16 ms returned sat
[2022-05-20 14:42:09] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-20 14:42:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2022-05-20 14:42:10] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (NOT (AND p3 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p3 (NOT p1) p2 p0))), (G (NOT (AND p3 p1 p2))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p3) p1) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1)))), (X (NOT p2)), (X p2), (X (OR (NOT p3) (NOT p2))), (X (NOT (OR (NOT p3) (NOT p2)))), (X (AND p3 p2)), (X (NOT (AND p3 p2))), (X (X (OR (AND (NOT p3) p1) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p2) p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (F (NOT (AND p3 (NOT p1) p2))), (F (OR (AND (NOT p3) p1) (AND p1 (NOT p2)))), (F (NOT (AND p3 (NOT p1) p2 (NOT p0)))), (F (OR (NOT p3) (NOT p2))), (F (NOT (AND p3 p2))), (F (AND (NOT p1) p0)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 1224 ms. Reduced automaton from 8 states, 27 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Support contains 3 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 15 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:42:11] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:42:11] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:42:11] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:42:12] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2022-05-20 14:42:12] [INFO ] Redundant transitions in 89 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:42:12] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:42:12] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/425 places, 574/575 transitions.
Applied a total of 0 rules in 9 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/425 places, 574/575 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (NOT p3) p1)), (X (NOT (OR (NOT p3) p1))), (X (NOT p2)), (X p2), (X (AND p3 (NOT p1))), (X (NOT (AND p3 (NOT p1)))), (X (X (OR (NOT p3) p1))), (X (X (NOT (OR (NOT p3) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 1260 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Finished random walk after 6 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) p2), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (NOT p3) p1)), (X (NOT (OR (NOT p3) p1))), (X (NOT p2)), (X p2), (X (AND p3 (NOT p1))), (X (NOT (AND p3 (NOT p1)))), (X (X (OR (NOT p3) p1))), (X (X (NOT (OR (NOT p3) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (AND (NOT p1) p0)), (F (OR (NOT p3) p1)), (F p1), (F (NOT (AND p3 (NOT p1))))]
Knowledge based reduction with 4 factoid took 576 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 5 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), p1, (NOT p2), p1]
Product exploration explored 100000 steps with 416 reset in 350 ms.
Product exploration explored 100000 steps with 419 reset in 395 ms.
Built C files in :
/tmp/ltsmin14610278186345854103
[2022-05-20 14:42:16] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:42:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:42:16] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:42:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:42:16] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:42:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:42:16] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14610278186345854103
Running compilation step : cd /tmp/ltsmin14610278186345854103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1301 ms.
Running link step : cd /tmp/ltsmin14610278186345854103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14610278186345854103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4654152316161820418.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:42:31] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:42:31] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:42:31] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 14:42:31] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2022-05-20 14:42:31] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:42:31] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:42:32] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 574/574 transitions.
Built C files in :
/tmp/ltsmin3990791471191263780
[2022-05-20 14:42:32] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:42:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:42:32] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:42:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:42:32] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:42:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:42:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3990791471191263780
Running compilation step : cd /tmp/ltsmin3990791471191263780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1328 ms.
Running link step : cd /tmp/ltsmin3990791471191263780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3990791471191263780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14761666902657148615.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:42:47] [INFO ] Flatten gal took : 17 ms
[2022-05-20 14:42:47] [INFO ] Flatten gal took : 16 ms
[2022-05-20 14:42:47] [INFO ] Time to serialize gal into /tmp/LTL8434395023700767704.gal : 2 ms
[2022-05-20 14:42:47] [INFO ] Time to serialize properties into /tmp/LTL18339522023734205054.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8434395023700767704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18339522023734205054.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8434395...267
Read 1 LTL properties
Checking formula 0 : !((G(F(((X((!(("((p1181==1)&&(p1194==1))")U("(p856==1)")))&&(F("(p856==0)"))))&&(G("(p856==0)")))&&("((p1181==0)||(p1194==0))")))))
Formula 0 simplified : !GF("((p1181==0)||(p1194==0))" & X(!("((p1181==1)&&(p1194==1))" U "(p856==1)") & F"(p856==0)") & G"(p856==0)")
Detected timeout of ITS tools.
[2022-05-20 14:43:02] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:43:02] [INFO ] Applying decomposition
[2022-05-20 14:43:02] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12152438728884212071.txt' '-o' '/tmp/graph12152438728884212071.bin' '-w' '/tmp/graph12152438728884212071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12152438728884212071.bin' '-l' '-1' '-v' '-w' '/tmp/graph12152438728884212071.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:43:02] [INFO ] Decomposing Gal with order
[2022-05-20 14:43:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:43:02] [INFO ] Removed a total of 631 redundant transitions.
[2022-05-20 14:43:02] [INFO ] Flatten gal took : 33 ms
[2022-05-20 14:43:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 662 labels/synchronizations in 6 ms.
[2022-05-20 14:43:02] [INFO ] Time to serialize gal into /tmp/LTL6311303408240296095.gal : 2 ms
[2022-05-20 14:43:02] [INFO ] Time to serialize properties into /tmp/LTL4702784797668894442.ltl : 116 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6311303408240296095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4702784797668894442.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6311303...245
Read 1 LTL properties
Checking formula 0 : !((G(F(((X((!(("((i13.i1.u119.p1181==1)&&(i13.i1.u121.p1194==1))")U("(i9.i1.u85.p856==1)")))&&(F("(i9.i1.u85.p856==0)"))))&&(G("(i9.i1...230
Formula 0 simplified : !GF("((i13.i1.u119.p1181==0)||(i13.i1.u121.p1194==0))" & X(!("((i13.i1.u119.p1181==1)&&(i13.i1.u121.p1194==1))" U "(i9.i1.u85.p856==...211
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17685898109319397635
[2022-05-20 14:43:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17685898109319397635
Running compilation step : cd /tmp/ltsmin17685898109319397635;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 970 ms.
Running link step : cd /tmp/ltsmin17685898109319397635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17685898109319397635;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp2==true))))&&[]((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 86413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Found a CL insensitive property : ShieldRVs-PT-030B-LTLFireability-09
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 996 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 995 transition count 1025
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 875 transition count 1025
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 240 place count 875 transition count 875
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 540 place count 725 transition count 875
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 544 place count 721 transition count 871
Iterating global reduction 2 with 4 rules applied. Total rules applied 548 place count 721 transition count 871
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 548 place count 721 transition count 870
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 550 place count 720 transition count 870
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 293
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1136 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1138 place count 425 transition count 575
Applied a total of 1138 rules in 85 ms. Remains 425 /996 variables (removed 571) and now considering 575/1146 (removed 571) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:34] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:43:34] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:34] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:43:34] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:34] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:43:34] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 425/996 places, 575/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/996 places, 575/1146 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s126 1), p0:(EQ s383 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 729 reset in 381 ms.
Product exploration explored 100000 steps with 713 reset in 411 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 245 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:36] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:43:36] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-20 14:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:43:37] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2022-05-20 14:43:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:43:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:43:37] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-05-20 14:43:37] [INFO ] Computed and/alt/rep : 507/2164/507 causal constraints (skipped 66 transitions) in 29 ms.
[2022-05-20 14:43:44] [INFO ] Added : 495 causal constraints over 99 iterations in 6282 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:44] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:43:44] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-20 14:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:43:44] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2022-05-20 14:43:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:43:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:43:45] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-05-20 14:43:45] [INFO ] Computed and/alt/rep : 507/2164/507 causal constraints (skipped 66 transitions) in 30 ms.
[2022-05-20 14:43:51] [INFO ] Added : 501 causal constraints over 101 iterations in 6467 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 6 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:51] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:43:51] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:51] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:43:52] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:52] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:43:52] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 575/575 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 256 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:43:53] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:43:53] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-20 14:43:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:43:53] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-05-20 14:43:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:43:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:43:54] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-20 14:43:54] [INFO ] Computed and/alt/rep : 507/2164/507 causal constraints (skipped 66 transitions) in 28 ms.
[2022-05-20 14:44:00] [INFO ] Added : 495 causal constraints over 99 iterations in 6373 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:44:00] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:44:01] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-20 14:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:44:01] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2022-05-20 14:44:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:44:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:44:02] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2022-05-20 14:44:02] [INFO ] Computed and/alt/rep : 507/2164/507 causal constraints (skipped 66 transitions) in 30 ms.
[2022-05-20 14:44:08] [INFO ] Added : 501 causal constraints over 101 iterations in 6364 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 743 reset in 349 ms.
Product exploration explored 100000 steps with 711 reset in 397 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 14 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2022-05-20 14:44:09] [INFO ] Redundant transitions in 95 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:44:09] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:44:09] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/425 places, 574/575 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/425 places, 574/575 transitions.
Product exploration explored 100000 steps with 697 reset in 390 ms.
Product exploration explored 100000 steps with 747 reset in 450 ms.
Built C files in :
/tmp/ltsmin10691901124156216752
[2022-05-20 14:44:11] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10691901124156216752
Running compilation step : cd /tmp/ltsmin10691901124156216752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 953 ms.
Running link step : cd /tmp/ltsmin10691901124156216752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10691901124156216752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15026627288381858674.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 6 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:44:26] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:44:26] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:44:26] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:44:26] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:44:26] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:44:27] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 575/575 transitions.
Built C files in :
/tmp/ltsmin1465044911671411810
[2022-05-20 14:44:27] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1465044911671411810
Running compilation step : cd /tmp/ltsmin1465044911671411810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 905 ms.
Running link step : cd /tmp/ltsmin1465044911671411810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1465044911671411810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11204334113476156373.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:44:42] [INFO ] Flatten gal took : 20 ms
[2022-05-20 14:44:42] [INFO ] Flatten gal took : 20 ms
[2022-05-20 14:44:42] [INFO ] Time to serialize gal into /tmp/LTL1988601548436754613.gal : 2 ms
[2022-05-20 14:44:42] [INFO ] Time to serialize properties into /tmp/LTL18438798856050257315.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1988601548436754613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18438798856050257315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1988601...267
Read 1 LTL properties
Checking formula 0 : !(((X(F("(p1088==1)")))&&(F("(p376==1)"))))
Formula 0 simplified : !(XF"(p1088==1)" & F"(p376==1)")
Detected timeout of ITS tools.
[2022-05-20 14:44:58] [INFO ] Flatten gal took : 21 ms
[2022-05-20 14:44:58] [INFO ] Applying decomposition
[2022-05-20 14:44:58] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2840759497533214384.txt' '-o' '/tmp/graph2840759497533214384.bin' '-w' '/tmp/graph2840759497533214384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2840759497533214384.bin' '-l' '-1' '-v' '-w' '/tmp/graph2840759497533214384.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:44:58] [INFO ] Decomposing Gal with order
[2022-05-20 14:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:44:58] [INFO ] Removed a total of 627 redundant transitions.
[2022-05-20 14:44:58] [INFO ] Flatten gal took : 33 ms
[2022-05-20 14:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 6 ms.
[2022-05-20 14:44:58] [INFO ] Time to serialize gal into /tmp/LTL14439102782350266316.gal : 2 ms
[2022-05-20 14:44:58] [INFO ] Time to serialize properties into /tmp/LTL15206944756130841211.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14439102782350266316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15206944756130841211.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1443910...247
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i11.i0.u109.p1088==1)")))&&(F("(i3.i0.u36.p376==1)"))))
Formula 0 simplified : !(XF"(i11.i0.u109.p1088==1)" & F"(i3.i0.u36.p376==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16077572325309899877
[2022-05-20 14:45:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16077572325309899877
Running compilation step : cd /tmp/ltsmin16077572325309899877;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 933 ms.
Running link step : cd /tmp/ltsmin16077572325309899877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16077572325309899877;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-09 finished in 115616 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(F(p0)))&&p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0||F(p1)))&&F(p0))))'
Found a CL insensitive property : ShieldRVs-PT-030B-LTLFireability-15
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 995 transition count 1027
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 877 transition count 1027
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 236 place count 877 transition count 876
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 538 place count 726 transition count 876
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 542 place count 722 transition count 872
Iterating global reduction 2 with 4 rules applied. Total rules applied 546 place count 722 transition count 872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 546 place count 722 transition count 871
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 548 place count 721 transition count 871
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 293
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1134 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1136 place count 426 transition count 576
Applied a total of 1136 rules in 80 ms. Remains 426 /996 variables (removed 570) and now considering 576/1146 (removed 570) transitions.
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:45:28] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:45:28] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:45:28] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:45:29] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:45:29] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:45:29] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 426/996 places, 576/1146 transitions.
Finished structural reductions, in 1 iterations. Remains : 426/996 places, 576/1146 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s87 1), p1:(AND (EQ s350 1) (EQ s355 1) (EQ s363 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21529 reset in 369 ms.
Product exploration explored 100000 steps with 21377 reset in 412 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/426 stabilizing places and 2/576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:45:30] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:45:31] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:45:31] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2022-05-20 14:45:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:45:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:45:32] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2022-05-20 14:45:32] [INFO ] Computed and/alt/rep : 507/2172/507 causal constraints (skipped 65 transitions) in 31 ms.
[2022-05-20 14:45:38] [INFO ] Added : 496 causal constraints over 100 iterations in 6034 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 426 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:45:38] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:45:38] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 576 rows 426 cols
[2022-05-20 14:45:38] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:45:38] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2022-05-20 14:45:38] [INFO ] Redundant transitions in 90 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2022-05-20 14:45:38] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:45:39] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/426 places, 575/576 transitions.
Applied a total of 0 rules in 9 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 426/426 places, 575/576 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/426 stabilizing places and 2/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 857 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 575 rows 426 cols
[2022-05-20 14:45:40] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:45:40] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:45:40] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-05-20 14:45:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:45:41] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2022-05-20 14:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:45:41] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2022-05-20 14:45:41] [INFO ] Computed and/alt/rep : 507/2173/507 causal constraints (skipped 64 transitions) in 32 ms.
[2022-05-20 14:45:48] [INFO ] Added : 468 causal constraints over 94 iterations in 7415 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21570 reset in 355 ms.
Product exploration explored 100000 steps with 21168 reset in 404 ms.
Built C files in :
/tmp/ltsmin1418618547944853476
[2022-05-20 14:45:49] [INFO ] Computing symmetric may disable matrix : 575 transitions.
[2022-05-20 14:45:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:45:49] [INFO ] Computing symmetric may enable matrix : 575 transitions.
[2022-05-20 14:45:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:45:49] [INFO ] Computing Do-Not-Accords matrix : 575 transitions.
[2022-05-20 14:45:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:45:49] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1418618547944853476
Running compilation step : cd /tmp/ltsmin1418618547944853476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1686 ms.
Running link step : cd /tmp/ltsmin1418618547944853476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1418618547944853476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4463786677127620100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 575/575 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 426 transition count 573
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 424 transition count 573
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 6 place count 423 transition count 572
Applied a total of 6 rules in 26 ms. Remains 423 /426 variables (removed 3) and now considering 572/575 (removed 3) transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:46:04] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:46:05] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:46:05] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:46:05] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2022-05-20 14:46:05] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:46:05] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:46:05] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/426 places, 572/575 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/426 places, 572/575 transitions.
Built C files in :
/tmp/ltsmin386786992150257961
[2022-05-20 14:46:05] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-05-20 14:46:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:46:05] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-05-20 14:46:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:46:05] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-05-20 14:46:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:46:05] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin386786992150257961
Running compilation step : cd /tmp/ltsmin386786992150257961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1300 ms.
Running link step : cd /tmp/ltsmin386786992150257961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin386786992150257961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10719534380772871585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:46:20] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:46:20] [INFO ] Flatten gal took : 18 ms
[2022-05-20 14:46:20] [INFO ] Time to serialize gal into /tmp/LTL12355610738219051401.gal : 2 ms
[2022-05-20 14:46:20] [INFO ] Time to serialize properties into /tmp/LTL6624525540152745036.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12355610738219051401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6624525540152745036.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1235561...267
Read 1 LTL properties
Checking formula 0 : !((F((X(("(p269==1)")||(F("(((p994==1)&&(p1005==1))&&(p1028==1))"))))&&(F("(p269==1)")))))
Formula 0 simplified : !F(X("(p269==1)" | F"(((p994==1)&&(p1005==1))&&(p1028==1))") & F"(p269==1)")
Detected timeout of ITS tools.
[2022-05-20 14:46:35] [INFO ] Flatten gal took : 17 ms
[2022-05-20 14:46:35] [INFO ] Applying decomposition
[2022-05-20 14:46:35] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1898206957580028934.txt' '-o' '/tmp/graph1898206957580028934.bin' '-w' '/tmp/graph1898206957580028934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1898206957580028934.bin' '-l' '-1' '-v' '-w' '/tmp/graph1898206957580028934.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:46:36] [INFO ] Decomposing Gal with order
[2022-05-20 14:46:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:46:36] [INFO ] Removed a total of 634 redundant transitions.
[2022-05-20 14:46:36] [INFO ] Flatten gal took : 32 ms
[2022-05-20 14:46:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 658 labels/synchronizations in 6 ms.
[2022-05-20 14:46:36] [INFO ] Time to serialize gal into /tmp/LTL11469923346770901718.gal : 2 ms
[2022-05-20 14:46:36] [INFO ] Time to serialize properties into /tmp/LTL10022459940519503345.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11469923346770901718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10022459940519503345.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1146992...247
Read 1 LTL properties
Checking formula 0 : !((F((X(("(i2.i1.u25.p269==1)")||(F("(((i11.i1.u100.p994==1)&&(i11.i1.u103.p1005==1))&&(i12.i0.u106.p1028==1))"))))&&(F("(i2.i1.u25.p2...167
Formula 0 simplified : !F(X("(i2.i1.u25.p269==1)" | F"(((i11.i1.u100.p994==1)&&(i11.i1.u103.p1005==1))&&(i12.i0.u106.p1028==1))") & F"(i2.i1.u25.p269==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10651408677414852048
[2022-05-20 14:46:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10651408677414852048
Running compilation step : cd /tmp/ltsmin10651408677414852048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 881 ms.
Running link step : cd /tmp/ltsmin10651408677414852048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10651408677414852048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(((LTLAPp0==true)||<>((LTLAPp1==true))))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-15 finished in 97842 ms.
[2022-05-20 14:47:06] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16239736608747162156
[2022-05-20 14:47:06] [INFO ] Computing symmetric may disable matrix : 1146 transitions.
[2022-05-20 14:47:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:47:06] [INFO ] Computing symmetric may enable matrix : 1146 transitions.
[2022-05-20 14:47:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:47:06] [INFO ] Applying decomposition
[2022-05-20 14:47:06] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13634369138290641329.txt' '-o' '/tmp/graph13634369138290641329.bin' '-w' '/tmp/graph13634369138290641329.weights'
[2022-05-20 14:47:06] [INFO ] Computing Do-Not-Accords matrix : 1146 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13634369138290641329.bin' '-l' '-1' '-v' '-w' '/tmp/graph13634369138290641329.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:47:06] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:47:06] [INFO ] Decomposing Gal with order
[2022-05-20 14:47:06] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16239736608747162156
Running compilation step : cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 14:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:47:06] [INFO ] Removed a total of 1071 redundant transitions.
[2022-05-20 14:47:06] [INFO ] Flatten gal took : 60 ms
[2022-05-20 14:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 14:47:06] [INFO ] Time to serialize gal into /tmp/LTLFireability7464723338670158349.gal : 6 ms
[2022-05-20 14:47:06] [INFO ] Time to serialize properties into /tmp/LTLFireability2871862416034183740.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7464723338670158349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2871862416034183740.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 5 LTL properties
Checking formula 0 : !((X(!(("(i6.i1.i0.u159.p505==1)")U(X(!(F(X((F("(i12.u277.p891==1)"))U(F("((i6.i1.i0.u159.p505==1)||(i12.u277.p891==1))")))))))))))
Formula 0 simplified : !X!("(i6.i1.i0.u159.p505==1)" U X!FX(F"(i12.u277.p891==1)" U F"((i6.i1.i0.u159.p505==1)||(i12.u277.p891==1))"))
Compilation finished in 3454 ms.
Running link step : cd /tmp/ltsmin16239736608747162156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(!((LTLAPp0==true) U X(!<>(X((<>((LTLAPp1==true)) U <>((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(!((LTLAPp0==true) U X(!<>(X((<>((LTLAPp1==true)) U <>((LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!((LTLAPp3==true) U (LTLAPp4==true))&&<>((LTLAPp5==true))))&&[]((LTLAPp5==true))&&(LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!((LTLAPp3==true) U (LTLAPp4==true))&&<>((LTLAPp5==true))))&&[]((LTLAPp5==true))&&(LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp7==true)))&&<>((LTLAPp8==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 15:12:41] [INFO ] Applying decomposition
[2022-05-20 15:12:41] [INFO ] Flatten gal took : 274 ms
[2022-05-20 15:12:42] [INFO ] Decomposing Gal with order
[2022-05-20 15:12:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:12:42] [INFO ] Removed a total of 627 redundant transitions.
[2022-05-20 15:12:42] [INFO ] Flatten gal took : 373 ms
[2022-05-20 15:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 222 ms.
[2022-05-20 15:12:43] [INFO ] Time to serialize gal into /tmp/LTLFireability13936109664612566858.gal : 68 ms
[2022-05-20 15:12:43] [INFO ] Time to serialize properties into /tmp/LTLFireability1873168901773226787.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13936109664612566858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1873168901773226787.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !((X(!(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u118.p505==1)")U(X(!(F(X((F("(i0.i0.i0.i0.i0.i0.i0.i1.u277.p891=...294
Formula 0 simplified : !X!("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u118.p505==1)" U X!FX(F"(i0.i0.i0.i0.i0.i0.i0.i1.u277.p891==1)" U ...276
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp7==true)))&&<>((LTLAPp8==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16239736608747162156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((<>([](<>((LTLAPp9==true))))&&(LTLAPp10==true))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-030B"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-030B, 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 r222-tall-165286025800828"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030B.tgz
mv ShieldRVs-PT-030B 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 ;