About the Execution of ITS-Tools for ShieldRVs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.323 | 3600000.00 | 6699562.00 | 88255.60 | FFFFFFFFF?FFF??F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025900860.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-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025900860
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.5K Apr 30 06:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 06:51 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:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 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 625K 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-050B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653065633155
Running Version 202205111006
[2022-05-20 16:53:54] [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 16:53:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:53:54] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2022-05-20 16:53:54] [INFO ] Transformed 2003 places.
[2022-05-20 16:53:54] [INFO ] Transformed 2253 transitions.
[2022-05-20 16:53:54] [INFO ] Found NUPN structural information;
[2022-05-20 16:53:54] [INFO ] Parsed PT model containing 2003 places and 2253 transitions in 330 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-050B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 344 places :
Symmetric choice reduction at 0 with 344 rule applications. Total rules 344 place count 1659 transition count 1909
Iterating global reduction 0 with 344 rules applied. Total rules applied 688 place count 1659 transition count 1909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 689 place count 1658 transition count 1908
Iterating global reduction 0 with 1 rules applied. Total rules applied 690 place count 1658 transition count 1908
Applied a total of 690 rules in 445 ms. Remains 1658 /2003 variables (removed 345) and now considering 1908/2253 (removed 345) transitions.
// Phase 1: matrix 1908 rows 1658 cols
[2022-05-20 16:53:55] [INFO ] Computed 201 place invariants in 34 ms
[2022-05-20 16:53:55] [INFO ] Implicit Places using invariants in 693 ms returned []
// Phase 1: matrix 1908 rows 1658 cols
[2022-05-20 16:53:56] [INFO ] Computed 201 place invariants in 16 ms
[2022-05-20 16:53:57] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2346 ms to find 0 implicit places.
// Phase 1: matrix 1908 rows 1658 cols
[2022-05-20 16:53:57] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 16:53:58] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1658/2003 places, 1908/2253 transitions.
Finished structural reductions, in 1 iterations. Remains : 1658/2003 places, 1908/2253 transitions.
Support contains 43 out of 1658 places after structural reductions.
[2022-05-20 16:53:59] [INFO ] Flatten gal took : 176 ms
[2022-05-20 16:53:59] [INFO ] Flatten gal took : 109 ms
[2022-05-20 16:53:59] [INFO ] Input system was already deterministic with 1908 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 25) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1908 rows 1658 cols
[2022-05-20 16:54:00] [INFO ] Computed 201 place invariants in 14 ms
[2022-05-20 16:54:00] [INFO ] [Real]Absence check using 201 positive place invariants in 68 ms returned sat
[2022-05-20 16:54:00] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 16:54:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 72 ms returned sat
[2022-05-20 16:54:02] [INFO ] After 1296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 16:54:03] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 5 ms to minimize.
[2022-05-20 16:54:03] [INFO ] Deduced a trap composed of 47 places in 338 ms of which 2 ms to minimize.
[2022-05-20 16:54:03] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 1 ms to minimize.
[2022-05-20 16:54:04] [INFO ] Deduced a trap composed of 55 places in 324 ms of which 1 ms to minimize.
[2022-05-20 16:54:04] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 2 ms to minimize.
[2022-05-20 16:54:05] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 1 ms to minimize.
[2022-05-20 16:54:05] [INFO ] Deduced a trap composed of 45 places in 303 ms of which 2 ms to minimize.
[2022-05-20 16:54:05] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 1 ms to minimize.
[2022-05-20 16:54:06] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 1 ms to minimize.
[2022-05-20 16:54:06] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 2 ms to minimize.
[2022-05-20 16:54:06] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 1 ms to minimize.
[2022-05-20 16:54:07] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 1 ms to minimize.
[2022-05-20 16:54:07] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 1 ms to minimize.
[2022-05-20 16:54:07] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 0 ms to minimize.
[2022-05-20 16:54:08] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2022-05-20 16:54:08] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 1 ms to minimize.
[2022-05-20 16:54:08] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 1 ms to minimize.
[2022-05-20 16:54:08] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 1 ms to minimize.
[2022-05-20 16:54:09] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 0 ms to minimize.
[2022-05-20 16:54:09] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 1 ms to minimize.
[2022-05-20 16:54:09] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 0 ms to minimize.
[2022-05-20 16:54:10] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 1 ms to minimize.
[2022-05-20 16:54:10] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 0 ms to minimize.
[2022-05-20 16:54:10] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 1 ms to minimize.
[2022-05-20 16:54:11] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 1 ms to minimize.
[2022-05-20 16:54:11] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 1 ms to minimize.
[2022-05-20 16:54:11] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 1 ms to minimize.
[2022-05-20 16:54:11] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 1 ms to minimize.
[2022-05-20 16:54:12] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 1 ms to minimize.
[2022-05-20 16:54:12] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 1 ms to minimize.
[2022-05-20 16:54:12] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 0 ms to minimize.
[2022-05-20 16:54:13] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 1 ms to minimize.
[2022-05-20 16:54:13] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 1 ms to minimize.
[2022-05-20 16:54:13] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 3 ms to minimize.
[2022-05-20 16:54:14] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 1 ms to minimize.
[2022-05-20 16:54:14] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 0 ms to minimize.
[2022-05-20 16:54:14] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 1 ms to minimize.
[2022-05-20 16:54:14] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 1 ms to minimize.
[2022-05-20 16:54:15] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 4 ms to minimize.
[2022-05-20 16:54:15] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 1 ms to minimize.
[2022-05-20 16:54:15] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 1 ms to minimize.
[2022-05-20 16:54:16] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 1 ms to minimize.
[2022-05-20 16:54:16] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 0 ms to minimize.
[2022-05-20 16:54:16] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 0 ms to minimize.
[2022-05-20 16:54:17] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 1 ms to minimize.
[2022-05-20 16:54:17] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2022-05-20 16:54:17] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 1 ms to minimize.
[2022-05-20 16:54:18] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2022-05-20 16:54:18] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 0 ms to minimize.
[2022-05-20 16:54:18] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 1 ms to minimize.
[2022-05-20 16:54:19] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 1 ms to minimize.
[2022-05-20 16:54:19] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 0 ms to minimize.
[2022-05-20 16:54:19] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 1 ms to minimize.
[2022-05-20 16:54:19] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 0 ms to minimize.
[2022-05-20 16:54:20] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 1 ms to minimize.
[2022-05-20 16:54:20] [INFO ] Deduced a trap composed of 61 places in 237 ms of which 1 ms to minimize.
[2022-05-20 16:54:20] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 0 ms to minimize.
[2022-05-20 16:54:21] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 1 ms to minimize.
[2022-05-20 16:54:21] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 1 ms to minimize.
[2022-05-20 16:54:21] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:54:21] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:54:22] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:54:22] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:54:22] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:54:22] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:54:22] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 2 ms to minimize.
[2022-05-20 16:54:23] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 20175 ms
[2022-05-20 16:54:23] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2022-05-20 16:54:23] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:54:23] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:54:24] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:54:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 855 ms
[2022-05-20 16:54:24] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 0 ms to minimize.
[2022-05-20 16:54:24] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:54:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2022-05-20 16:54:25] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:54:25] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:54:25] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:54:25] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:54:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:54:25] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 789 ms.
Support contains 19 out of 1658 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1658 transition count 1710
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1460 transition count 1710
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 396 place count 1460 transition count 1460
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 896 place count 1210 transition count 1460
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 899 place count 1207 transition count 1457
Iterating global reduction 2 with 3 rules applied. Total rules applied 902 place count 1207 transition count 1457
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 492
Deduced a syphon composed of 492 places in 2 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 2 with 984 rules applied. Total rules applied 1886 place count 715 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 2 with 98 rules applied. Total rules applied 1984 place count 715 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1985 place count 714 transition count 964
Applied a total of 1985 rules in 640 ms. Remains 714 /1658 variables (removed 944) and now considering 964/1908 (removed 944) transitions.
Finished structural reductions, in 1 iterations. Remains : 714/1658 places, 964/1908 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 964 rows 714 cols
[2022-05-20 16:54:27] [INFO ] Computed 201 place invariants in 12 ms
[2022-05-20 16:54:27] [INFO ] [Real]Absence check using 201 positive place invariants in 26 ms returned sat
[2022-05-20 16:54:27] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 16:54:28] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:54:28] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 16:54:28] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:54:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:54:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-20 16:54:28] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-05-20 16:54:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 335 ms
[2022-05-20 16:54:28] [INFO ] After 704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 16:54:28] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 714 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 714/714 places, 964/964 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 714 transition count 962
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 712 transition count 962
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 18 place count 705 transition count 955
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 705 transition count 955
Applied a total of 22 rules in 434 ms. Remains 705 /714 variables (removed 9) and now considering 955/964 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 705/714 places, 955/964 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206822 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206822 steps, saw 78766 distinct states, run finished after 3003 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 955 rows 705 cols
[2022-05-20 16:54:32] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 16:54:32] [INFO ] [Real]Absence check using 201 positive place invariants in 27 ms returned sat
[2022-05-20 16:54:32] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 16:54:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:54:33] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 16:54:33] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:54:33] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-05-20 16:54:33] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-05-20 16:54:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2022-05-20 16:54:33] [INFO ] After 518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 16:54:33] [INFO ] After 668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 705 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 21 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 705/705 places, 955/955 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 21 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
// Phase 1: matrix 955 rows 705 cols
[2022-05-20 16:54:33] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 16:54:33] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 955 rows 705 cols
[2022-05-20 16:54:33] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:54:34] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2022-05-20 16:54:34] [INFO ] Redundant transitions in 126 ms returned []
// Phase 1: matrix 955 rows 705 cols
[2022-05-20 16:54:34] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:54:35] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 18 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 955 rows 705 cols
[2022-05-20 16:54:35] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:54:35] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2022-05-20 16:54:35] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 16:54:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:54:35] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 16:54:35] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2022-05-20 16:54:35] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-20 16:54:36] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-20 16:54:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2022-05-20 16:54:36] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-20 16:54:36] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 16:54:36] [INFO ] Flatten gal took : 61 ms
[2022-05-20 16:54:36] [INFO ] Flatten gal took : 42 ms
[2022-05-20 16:54:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13047087592305831401.gal : 25 ms
[2022-05-20 16:54:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7021715521205975730.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14801387440737619197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13047087592305831401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7021715521205975730.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7021715521205975730.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 102
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :102 after 306
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :306 after 506
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :506 after 839
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :839 after 8224
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8224 after 82950
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :82950 after 5.36368e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.36368e+06 after 4.47718e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.47718e+08 after 4.56596e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.56596e+10 after 5.79649e+12
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.79649e+12 after 4.84041e+15
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.84041e+15 after 2.87627e+20
Detected timeout of ITS tools.
[2022-05-20 16:54:51] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:54:51] [INFO ] Applying decomposition
[2022-05-20 16:54:51] [INFO ] Flatten gal took : 38 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/graph14901365820062103116.txt' '-o' '/tmp/graph14901365820062103116.bin' '-w' '/tmp/graph14901365820062103116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14901365820062103116.bin' '-l' '-1' '-v' '-w' '/tmp/graph14901365820062103116.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:54:51] [INFO ] Decomposing Gal with order
[2022-05-20 16:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:54:51] [INFO ] Removed a total of 1096 redundant transitions.
[2022-05-20 16:54:51] [INFO ] Flatten gal took : 125 ms
[2022-05-20 16:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1135 labels/synchronizations in 31 ms.
[2022-05-20 16:54:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7003863249049973912.gal : 9 ms
[2022-05-20 16:54:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16389929965727746919.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14801387440737619197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7003863249049973912.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16389929965727746919.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16389929965727746919.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.57878e+07 after 1.02311e+18
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2541103064243740493
[2022-05-20 16:55:06] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2541103064243740493
Running compilation step : cd /tmp/ltsmin2541103064243740493;'/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 1730 ms.
Running link step : cd /tmp/ltsmin2541103064243740493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2541103064243740493;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp19==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldRVs-PT-050B-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 401 stabilizing places and 401 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(F(p0)))&&(G(p1) U p2)&&p1))))'
Support contains 2 out of 1658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1657 transition count 1707
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1457 transition count 1707
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 400 place count 1457 transition count 1456
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 902 place count 1206 transition count 1456
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 908 place count 1200 transition count 1450
Iterating global reduction 2 with 6 rules applied. Total rules applied 914 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 1 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1904 place count 705 transition count 955
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 1906 place count 703 transition count 953
Applied a total of 1906 rules in 292 ms. Remains 703 /1658 variables (removed 955) and now considering 953/1908 (removed 955) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:55:22] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 16:55:23] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:55:23] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:55:23] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2022-05-20 16:55:23] [INFO ] Redundant transitions in 154 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:55:23] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:55:24] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1658 places, 952/1908 transitions.
Applied a total of 0 rules in 20 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 703/1658 places, 952/1908 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s619 1), p0:(EQ s125 0), p2:(NEQ s125 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 690 steps with 0 reset in 16 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-00 finished in 2206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U X(p1))||p2))||F(p0)||p2)))'
Support contains 3 out of 1658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1654 transition count 1904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1654 transition count 1904
Applied a total of 8 rules in 87 ms. Remains 1654 /1658 variables (removed 4) and now considering 1904/1908 (removed 4) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:55:24] [INFO ] Computed 201 place invariants in 14 ms
[2022-05-20 16:55:25] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:55:25] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:55:26] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:55:26] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:55:27] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1658 places, 1904/1908 transitions.
Finished structural reductions, in 1 iterations. Remains : 1654/1658 places, 1904/1908 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s680 1), p0:(EQ s450 1), p1:(EQ s376 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 91116 steps with 51 reset in 520 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-01 finished in 3821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(p0)))))'
Support contains 3 out of 1658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1657 transition count 1707
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1457 transition count 1707
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1457 transition count 1457
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1207 transition count 1457
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 906 place count 1201 transition count 1451
Iterating global reduction 2 with 6 rules applied. Total rules applied 912 place count 1201 transition count 1451
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 2 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1906 place count 704 transition count 954
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 1908 place count 702 transition count 952
Applied a total of 1908 rules in 218 ms. Remains 702 /1658 variables (removed 956) and now considering 952/1908 (removed 956) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:55:28] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:55:28] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:55:28] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:55:29] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2022-05-20 16:55:29] [INFO ] Redundant transitions in 210 ms returned [951]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:55:29] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:55:30] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/1658 places, 951/1908 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/1658 places, 951/1908 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s677 1) (EQ s679 1) (EQ s684 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 669 steps with 0 reset in 8 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-02 finished in 1870 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U X(p2))))'
Support contains 5 out of 1658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1654 transition count 1904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1654 transition count 1904
Applied a total of 8 rules in 80 ms. Remains 1654 /1658 variables (removed 4) and now considering 1904/1908 (removed 4) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:55:30] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 16:55:30] [INFO ] Implicit Places using invariants in 433 ms returned []
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:55:30] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:55:32] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:55:32] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 16:55:33] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1658 places, 1904/1908 transitions.
Finished structural reductions, in 1 iterations. Remains : 1654/1658 places, 1904/1908 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s162 1), p0:(AND (EQ s169 1) (EQ s178 1) (EQ s199 1)), p2:(EQ s959 1)], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-04 finished in 3439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))&&p1))))'
Support contains 6 out of 1658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1652 transition count 1902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1652 transition count 1902
Applied a total of 12 rules in 81 ms. Remains 1652 /1658 variables (removed 6) and now considering 1902/1908 (removed 6) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:55:33] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 16:55:34] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:55:34] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:55:35] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:55:35] [INFO ] Computed 201 place invariants in 12 ms
[2022-05-20 16:55:36] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1652/1658 places, 1902/1908 transitions.
Finished structural reductions, in 1 iterations. Remains : 1652/1658 places, 1902/1908 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1598 1) (EQ s1602 1) (EQ s1609 1)), p1:(OR (EQ s426 0) (EQ s433 0) (EQ s454 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2001 steps with 0 reset in 12 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-06 finished in 3266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(X(!(p0 U p1)))))&&G(p0))))'
Support contains 4 out of 1658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1652 transition count 1902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1652 transition count 1902
Applied a total of 12 rules in 98 ms. Remains 1652 /1658 variables (removed 6) and now considering 1902/1908 (removed 6) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:55:37] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 16:55:37] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:55:37] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:55:39] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:55:39] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:55:40] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1652/1658 places, 1902/1908 transitions.
Finished structural reductions, in 1 iterations. Remains : 1652/1658 places, 1902/1908 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (EQ s1083 1) (EQ s1117 1) (EQ s1138 1)), p1:(EQ s587 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-07 finished in 3472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((X(G(X(p0)))&&F(p1))))))'
Support contains 7 out of 1658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1657 transition count 1709
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1459 transition count 1709
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 396 place count 1459 transition count 1459
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 896 place count 1209 transition count 1459
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 901 place count 1204 transition count 1454
Iterating global reduction 2 with 5 rules applied. Total rules applied 906 place count 1204 transition count 1454
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 1 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1896 place count 709 transition count 959
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 1898 place count 707 transition count 957
Applied a total of 1898 rules in 265 ms. Remains 707 /1658 variables (removed 951) and now considering 957/1908 (removed 951) transitions.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:55:40] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:55:41] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:55:41] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:55:41] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2022-05-20 16:55:42] [INFO ] Redundant transitions in 811 ms returned [956]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 956 rows 707 cols
[2022-05-20 16:55:42] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:55:42] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 707/1658 places, 956/1908 transitions.
Applied a total of 0 rules in 19 ms. Remains 707 /707 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 707/1658 places, 956/1908 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s392 1) (EQ s398 1) (EQ s406 1) (OR (EQ s45 0) (EQ s63 0) (EQ s74 0))), p0:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 669 steps with 0 reset in 6 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-08 finished in 2879 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(F(p0)))||F(X(F(p1))))))'
Support contains 4 out of 1658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1657 transition count 1707
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1457 transition count 1707
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1457 transition count 1457
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1207 transition count 1457
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 906 place count 1201 transition count 1451
Iterating global reduction 2 with 6 rules applied. Total rules applied 912 place count 1201 transition count 1451
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1900 place count 707 transition count 957
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 1902 place count 705 transition count 955
Applied a total of 1902 rules in 185 ms. Remains 705 /1658 variables (removed 953) and now considering 955/1908 (removed 953) transitions.
// Phase 1: matrix 955 rows 705 cols
[2022-05-20 16:55:43] [INFO ] Computed 201 place invariants in 12 ms
[2022-05-20 16:55:43] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 955 rows 705 cols
[2022-05-20 16:55:43] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:55:44] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2022-05-20 16:55:44] [INFO ] Redundant transitions in 164 ms returned [954]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 954 rows 705 cols
[2022-05-20 16:55:44] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:55:45] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1658 places, 954/1908 transitions.
Applied a total of 0 rules in 15 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 705/1658 places, 954/1908 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s501 0), p1:(AND (EQ s185 1) (EQ s203 1) (EQ s213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 675 reset in 504 ms.
Product exploration explored 100000 steps with 576 reset in 615 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/705 stabilizing places and 2/954 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 954/954 transitions.
Applied a total of 0 rules in 19 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
// Phase 1: matrix 954 rows 705 cols
[2022-05-20 16:55:46] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:55:47] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 954 rows 705 cols
[2022-05-20 16:55:47] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:55:47] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2022-05-20 16:55:48] [INFO ] Redundant transitions in 164 ms returned []
// Phase 1: matrix 954 rows 705 cols
[2022-05-20 16:55:48] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:55:48] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 705/705 places, 954/954 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/705 stabilizing places and 2/954 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 566 reset in 518 ms.
Product exploration explored 100000 steps with 506 reset in 582 ms.
Built C files in :
/tmp/ltsmin2248188087770030907
[2022-05-20 16:55:50] [INFO ] Computing symmetric may disable matrix : 954 transitions.
[2022-05-20 16:55:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:55:50] [INFO ] Computing symmetric may enable matrix : 954 transitions.
[2022-05-20 16:55:50] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:55:50] [INFO ] Computing Do-Not-Accords matrix : 954 transitions.
[2022-05-20 16:55:50] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:55:50] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2248188087770030907
Running compilation step : cd /tmp/ltsmin2248188087770030907;'/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 2687 ms.
Running link step : cd /tmp/ltsmin2248188087770030907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin2248188087770030907;'/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/stateBased2212702303699338035.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 954/954 transitions.
Applied a total of 0 rules in 20 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
// Phase 1: matrix 954 rows 705 cols
[2022-05-20 16:56:05] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:56:05] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 954 rows 705 cols
[2022-05-20 16:56:05] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:56:06] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2022-05-20 16:56:06] [INFO ] Redundant transitions in 177 ms returned []
// Phase 1: matrix 954 rows 705 cols
[2022-05-20 16:56:06] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:56:06] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 705/705 places, 954/954 transitions.
Built C files in :
/tmp/ltsmin12260000414169986114
[2022-05-20 16:56:06] [INFO ] Computing symmetric may disable matrix : 954 transitions.
[2022-05-20 16:56:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:56:06] [INFO ] Computing symmetric may enable matrix : 954 transitions.
[2022-05-20 16:56:06] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:56:06] [INFO ] Computing Do-Not-Accords matrix : 954 transitions.
[2022-05-20 16:56:06] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:56:06] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12260000414169986114
Running compilation step : cd /tmp/ltsmin12260000414169986114;'/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 2781 ms.
Running link step : cd /tmp/ltsmin12260000414169986114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin12260000414169986114;'/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/stateBased15840998533767985151.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:56:22] [INFO ] Flatten gal took : 56 ms
[2022-05-20 16:56:22] [INFO ] Flatten gal took : 85 ms
[2022-05-20 16:56:22] [INFO ] Time to serialize gal into /tmp/LTL3921702551781401109.gal : 6 ms
[2022-05-20 16:56:22] [INFO ] Time to serialize properties into /tmp/LTL17580327518675994090.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/LTL3921702551781401109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17580327518675994090.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/LTL3921702...267
Read 1 LTL properties
Checking formula 0 : !((G((X(G(F("(p1436==0)"))))||(F(X(F("(((p566==1)&&(p610==1))&&(p634==1))")))))))
Formula 0 simplified : !G(XGF"(p1436==0)" | FXF"(((p566==1)&&(p610==1))&&(p634==1))")
Detected timeout of ITS tools.
[2022-05-20 16:56:37] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:56:37] [INFO ] Applying decomposition
[2022-05-20 16:56:37] [INFO ] Flatten gal took : 57 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/graph1022919133100668796.txt' '-o' '/tmp/graph1022919133100668796.bin' '-w' '/tmp/graph1022919133100668796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1022919133100668796.bin' '-l' '-1' '-v' '-w' '/tmp/graph1022919133100668796.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:56:37] [INFO ] Decomposing Gal with order
[2022-05-20 16:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:56:37] [INFO ] Removed a total of 1057 redundant transitions.
[2022-05-20 16:56:37] [INFO ] Flatten gal took : 110 ms
[2022-05-20 16:56:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 992 labels/synchronizations in 34 ms.
[2022-05-20 16:56:37] [INFO ] Time to serialize gal into /tmp/LTL3971958043911861090.gal : 11 ms
[2022-05-20 16:56:37] [INFO ] Time to serialize properties into /tmp/LTL10537804877398178629.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/LTL3971958043911861090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10537804877398178629.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/LTL3971958...246
Read 1 LTL properties
Checking formula 0 : !((G((X(G(F("(i11.u144.p1436==0)"))))||(F(X(F("(((i4.u53.p566==1)&&(i5.u58.p610==1))&&(i5.u61.p634==1))")))))))
Formula 0 simplified : !G(XGF"(i11.u144.p1436==0)" | FXF"(((i4.u53.p566==1)&&(i5.u58.p610==1))&&(i5.u61.p634==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3442086608854583341
[2022-05-20 16:56:52] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3442086608854583341
Running compilation step : cd /tmp/ltsmin3442086608854583341;'/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 1682 ms.
Running link step : cd /tmp/ltsmin3442086608854583341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3442086608854583341;'/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))))||<>(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050B-LTLFireability-09 finished in 84522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 6 out of 1658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1652 transition count 1902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1652 transition count 1902
Applied a total of 12 rules in 85 ms. Remains 1652 /1658 variables (removed 6) and now considering 1902/1908 (removed 6) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:57:07] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 16:57:08] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:57:08] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:57:10] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:57:10] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:57:11] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1652/1658 places, 1902/1908 transitions.
Finished structural reductions, in 1 iterations. Remains : 1652/1658 places, 1902/1908 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s507 1) (EQ s541 1) (EQ s563 1) (EQ s1081 1)), p1:(AND (EQ s552 1) (EQ s563 1) (EQ s582 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2041 steps with 0 reset in 12 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-12 finished in 3305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1657 transition count 1707
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1457 transition count 1707
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 400 place count 1457 transition count 1458
Deduced a syphon composed of 249 places in 4 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 898 place count 1208 transition count 1458
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 904 place count 1202 transition count 1452
Iterating global reduction 2 with 6 rules applied. Total rules applied 910 place count 1202 transition count 1452
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1904 place count 705 transition count 955
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 1906 place count 703 transition count 953
Applied a total of 1906 rules in 207 ms. Remains 703 /1658 variables (removed 955) and now considering 953/1908 (removed 955) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:57:11] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:57:11] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:57:11] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:57:12] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2022-05-20 16:57:12] [INFO ] Redundant transitions in 160 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:57:12] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:57:12] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1658 places, 952/1908 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 703/1658 places, 952/1908 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s591 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27072 reset in 659 ms.
Product exploration explored 100000 steps with 26902 reset in 734 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 1376 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 26 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 118 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:57:15] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:57:16] [INFO ] [Real]Absence check using 201 positive place invariants in 68 ms returned sat
[2022-05-20 16:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:57:17] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2022-05-20 16:57:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:57:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 65 ms returned sat
[2022-05-20 16:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:57:18] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2022-05-20 16:57:18] [INFO ] Computed and/alt/rep : 853/3688/853 causal constraints (skipped 97 transitions) in 58 ms.
[2022-05-20 16:57:32] [INFO ] Added : 705 causal constraints over 141 iterations in 13544 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 17 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:57:32] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:57:32] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:57:32] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:57:33] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2022-05-20 16:57:33] [INFO ] Redundant transitions in 142 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:57:33] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:57:33] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 952/952 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 113 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)]
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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 135 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:57:34] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:57:34] [INFO ] [Real]Absence check using 201 positive place invariants in 65 ms returned sat
[2022-05-20 16:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:57:35] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2022-05-20 16:57:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:57:36] [INFO ] [Nat]Absence check using 201 positive place invariants in 67 ms returned sat
[2022-05-20 16:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:57:37] [INFO ] [Nat]Absence check using state equation in 971 ms returned sat
[2022-05-20 16:57:37] [INFO ] Computed and/alt/rep : 853/3688/853 causal constraints (skipped 97 transitions) in 53 ms.
[2022-05-20 16:57:50] [INFO ] Added : 705 causal constraints over 141 iterations in 13502 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27091 reset in 644 ms.
Product exploration explored 100000 steps with 27002 reset in 721 ms.
Built C files in :
/tmp/ltsmin10637776368789455813
[2022-05-20 16:57:52] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2022-05-20 16:57:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:57:52] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2022-05-20 16:57:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:57:52] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2022-05-20 16:57:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:57:52] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10637776368789455813
Running compilation step : cd /tmp/ltsmin10637776368789455813;'/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 2710 ms.
Running link step : cd /tmp/ltsmin10637776368789455813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10637776368789455813;'/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/stateBased8675248608554201983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:58:07] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:58:07] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:58:07] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:58:08] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2022-05-20 16:58:08] [INFO ] Redundant transitions in 149 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:58:08] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:58:08] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin15644430901311664367
[2022-05-20 16:58:08] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2022-05-20 16:58:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:08] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2022-05-20 16:58:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:08] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2022-05-20 16:58:08] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:08] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15644430901311664367
Running compilation step : cd /tmp/ltsmin15644430901311664367;'/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 2698 ms.
Running link step : cd /tmp/ltsmin15644430901311664367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin15644430901311664367;'/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/stateBased17896558745435994929.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:58:24] [INFO ] Flatten gal took : 30 ms
[2022-05-20 16:58:24] [INFO ] Flatten gal took : 31 ms
[2022-05-20 16:58:24] [INFO ] Time to serialize gal into /tmp/LTL14377521187159649160.gal : 5 ms
[2022-05-20 16:58:24] [INFO ] Time to serialize properties into /tmp/LTL15670473496983856663.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/LTL14377521187159649160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15670473496983856663.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/LTL1437752...268
Read 1 LTL properties
Checking formula 0 : !((F("(p1689==1)")))
Formula 0 simplified : !F"(p1689==1)"
Detected timeout of ITS tools.
[2022-05-20 16:58:39] [INFO ] Flatten gal took : 40 ms
[2022-05-20 16:58:39] [INFO ] Applying decomposition
[2022-05-20 16:58:39] [INFO ] Flatten gal took : 30 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/graph9043968460818843247.txt' '-o' '/tmp/graph9043968460818843247.bin' '-w' '/tmp/graph9043968460818843247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9043968460818843247.bin' '-l' '-1' '-v' '-w' '/tmp/graph9043968460818843247.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:58:39] [INFO ] Decomposing Gal with order
[2022-05-20 16:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:58:39] [INFO ] Removed a total of 1048 redundant transitions.
[2022-05-20 16:58:39] [INFO ] Flatten gal took : 137 ms
[2022-05-20 16:58:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 894 labels/synchronizations in 29 ms.
[2022-05-20 16:58:39] [INFO ] Time to serialize gal into /tmp/LTL1618489847376534787.gal : 18 ms
[2022-05-20 16:58:39] [INFO ] Time to serialize properties into /tmp/LTL9772257478720637066.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/LTL1618489847376534787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9772257478720637066.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/LTL1618489...245
Read 1 LTL properties
Checking formula 0 : !((F("(i13.u168.p1689==1)")))
Formula 0 simplified : !F"(i13.u168.p1689==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5220346925340897214
[2022-05-20 16:58:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5220346925340897214
Running compilation step : cd /tmp/ltsmin5220346925340897214;'/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 2087 ms.
Running link step : cd /tmp/ltsmin5220346925340897214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5220346925340897214;'/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))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050B-LTLFireability-13 finished in 118561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1657 transition count 1706
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1456 transition count 1706
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1456 transition count 1456
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1206 transition count 1456
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 908 place count 1200 transition count 1450
Iterating global reduction 2 with 6 rules applied. Total rules applied 914 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 1 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1904 place count 705 transition count 955
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 1906 place count 703 transition count 953
Applied a total of 1906 rules in 225 ms. Remains 703 /1658 variables (removed 955) and now considering 953/1908 (removed 955) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:59:09] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:59:10] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:59:10] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:59:10] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2022-05-20 16:59:11] [INFO ] Redundant transitions in 170 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:59:11] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:59:11] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1658 places, 952/1908 transitions.
Applied a total of 0 rules in 14 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 703/1658 places, 952/1908 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 149 reset in 480 ms.
Product exploration explored 100000 steps with 150 reset in 586 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/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 22 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:59:12] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:59:13] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:59:13] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:59:13] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2022-05-20 16:59:14] [INFO ] Redundant transitions in 160 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:59:14] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:59:14] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 952/952 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/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 149 reset in 505 ms.
Product exploration explored 100000 steps with 149 reset in 586 ms.
Built C files in :
/tmp/ltsmin15024688326941876453
[2022-05-20 16:59:16] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2022-05-20 16:59:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:16] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2022-05-20 16:59:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:16] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2022-05-20 16:59:16] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:16] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15024688326941876453
Running compilation step : cd /tmp/ltsmin15024688326941876453;'/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 2759 ms.
Running link step : cd /tmp/ltsmin15024688326941876453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15024688326941876453;'/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/stateBased7732424948060054859.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:59:31] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:59:31] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:59:31] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:59:32] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2022-05-20 16:59:32] [INFO ] Redundant transitions in 166 ms returned []
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:59:32] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:59:32] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin7251447869934503192
[2022-05-20 16:59:32] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2022-05-20 16:59:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:32] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2022-05-20 16:59:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:32] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2022-05-20 16:59:32] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:32] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7251447869934503192
Running compilation step : cd /tmp/ltsmin7251447869934503192;'/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 2702 ms.
Running link step : cd /tmp/ltsmin7251447869934503192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7251447869934503192;'/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/stateBased16730339409925611727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:59:47] [INFO ] Flatten gal took : 29 ms
[2022-05-20 16:59:47] [INFO ] Flatten gal took : 29 ms
[2022-05-20 16:59:47] [INFO ] Time to serialize gal into /tmp/LTL2861559771377472279.gal : 5 ms
[2022-05-20 16:59:47] [INFO ] Time to serialize properties into /tmp/LTL6249037462352988777.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/LTL2861559771377472279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6249037462352988777.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/LTL2861559...266
Read 1 LTL properties
Checking formula 0 : !((F(G("(p1071!=1)"))))
Formula 0 simplified : !FG"(p1071!=1)"
Detected timeout of ITS tools.
[2022-05-20 17:00:02] [INFO ] Flatten gal took : 31 ms
[2022-05-20 17:00:02] [INFO ] Applying decomposition
[2022-05-20 17:00:02] [INFO ] Flatten gal took : 28 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/graph2696056613684837578.txt' '-o' '/tmp/graph2696056613684837578.bin' '-w' '/tmp/graph2696056613684837578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2696056613684837578.bin' '-l' '-1' '-v' '-w' '/tmp/graph2696056613684837578.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:00:03] [INFO ] Decomposing Gal with order
[2022-05-20 17:00:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:00:03] [INFO ] Removed a total of 1051 redundant transitions.
[2022-05-20 17:00:03] [INFO ] Flatten gal took : 52 ms
[2022-05-20 17:00:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 808 labels/synchronizations in 12 ms.
[2022-05-20 17:00:03] [INFO ] Time to serialize gal into /tmp/LTL7642538159237341066.gal : 3 ms
[2022-05-20 17:00:03] [INFO ] Time to serialize properties into /tmp/LTL4490931986549783240.ltl : 64 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/LTL7642538159237341066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4490931986549783240.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/LTL7642538...245
Read 1 LTL properties
Checking formula 0 : !((F(G("(i8.u105.p1071!=1)"))))
Formula 0 simplified : !FG"(i8.u105.p1071!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17147554833193671656
[2022-05-20 17:00:18] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17147554833193671656
Running compilation step : cd /tmp/ltsmin17147554833193671656;'/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 1666 ms.
Running link step : cd /tmp/ltsmin17147554833193671656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17147554833193671656;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050B-LTLFireability-14 finished in 83663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||X(X(X(F(p1))))))))'
Support contains 2 out of 1658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1658/1658 places, 1908/1908 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1653 transition count 1903
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1653 transition count 1903
Applied a total of 10 rules in 82 ms. Remains 1653 /1658 variables (removed 5) and now considering 1903/1908 (removed 5) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2022-05-20 17:00:33] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 17:00:33] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 1903 rows 1653 cols
[2022-05-20 17:00:33] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 17:00:35] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
// Phase 1: matrix 1903 rows 1653 cols
[2022-05-20 17:00:35] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 17:00:36] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1658 places, 1903/1908 transitions.
Finished structural reductions, in 1 iterations. Remains : 1653/1658 places, 1903/1908 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=1, aps=[p0:(EQ s212 1), p1:(EQ s1321 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-15 finished in 3216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(F(p0)))||F(X(F(p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-20 17:00:36] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14154913615099769988
[2022-05-20 17:00:37] [INFO ] Too many transitions (1908) to apply POR reductions. Disabling POR matrices.
[2022-05-20 17:00:37] [INFO ] Applying decomposition
[2022-05-20 17:00:37] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14154913615099769988
Running compilation step : cd /tmp/ltsmin14154913615099769988;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 17:00:37] [INFO ] Flatten gal took : 56 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/graph16106869722876049999.txt' '-o' '/tmp/graph16106869722876049999.bin' '-w' '/tmp/graph16106869722876049999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16106869722876049999.bin' '-l' '-1' '-v' '-w' '/tmp/graph16106869722876049999.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:00:37] [INFO ] Decomposing Gal with order
[2022-05-20 17:00:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:00:37] [INFO ] Removed a total of 1791 redundant transitions.
[2022-05-20 17:00:37] [INFO ] Flatten gal took : 110 ms
[2022-05-20 17:00:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-20 17:00:37] [INFO ] Time to serialize gal into /tmp/LTLFireability1756273538940494175.gal : 13 ms
[2022-05-20 17:00:37] [INFO ] Time to serialize properties into /tmp/LTLFireability2315105723920504695.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/LTLFireability1756273538940494175.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2315105723920504695.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 3 LTL properties
Checking formula 0 : !((G((X(G(F("(i15.i1.i1.u449.p1436==0)"))))||(F(X(F("(((i6.u182.p566==1)&&(i6.u195.p610==1))&&(i6.u201.p634==1))")))))))
Formula 0 simplified : !G(XGF"(i15.i1.i1.u449.p1436==0)" | FXF"(((i6.u182.p566==1)&&(i6.u195.p610==1))&&(i6.u201.p634==1))")
Compilation finished in 4346 ms.
Running link step : cd /tmp/ltsmin14154913615099769988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14154913615099769988;'/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))))||<>(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: LTL layer: formula: []((X([](<>((LTLAPp0==true))))||<>(X(<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.010: "[]((X([](<>((LTLAPp0==true))))||<>(X(<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.067: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.333: DFS-FIFO for weak LTL, using special progress label 1913
pins2lts-mc-linux64( 0/ 8), 0.333: There are 1914 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.333: State length is 1659, there are 1911 groups
pins2lts-mc-linux64( 0/ 8), 0.333: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.333: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.333: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.333: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.520: ~1 levels ~960 states ~5200 transitions
pins2lts-mc-linux64( 7/ 8), 0.678: ~1 levels ~1920 states ~11688 transitions
pins2lts-mc-linux64( 7/ 8), 0.956: ~1 levels ~3840 states ~23032 transitions
pins2lts-mc-linux64( 7/ 8), 1.542: ~1 levels ~7680 states ~52496 transitions
pins2lts-mc-linux64( 7/ 8), 2.625: ~1 levels ~15360 states ~110904 transitions
pins2lts-mc-linux64( 7/ 8), 4.715: ~1 levels ~30720 states ~242016 transitions
pins2lts-mc-linux64( 7/ 8), 8.747: ~1 levels ~61440 states ~504808 transitions
pins2lts-mc-linux64( 7/ 8), 17.257: ~1 levels ~122880 states ~1108376 transitions
pins2lts-mc-linux64( 7/ 8), 33.953: ~1 levels ~245760 states ~2390208 transitions
pins2lts-mc-linux64( 7/ 8), 66.542: ~1 levels ~491520 states ~5007144 transitions
pins2lts-mc-linux64( 7/ 8), 131.764: ~1 levels ~983040 states ~10309304 transitions
pins2lts-mc-linux64( 5/ 8), 263.021: ~1 levels ~1966080 states ~20956016 transitions
pins2lts-mc-linux64( 6/ 8), 512.165: ~1034 levels ~3932160 states ~39380344 transitions
pins2lts-mc-linux64( 4/ 8), 930.441: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 930.672:
pins2lts-mc-linux64( 0/ 8), 930.672: mean standard work distribution: 9.8% (states) 11.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 930.672:
pins2lts-mc-linux64( 0/ 8), 930.672: Explored 6563900 states 75408777 transitions, fanout: 11.488
pins2lts-mc-linux64( 0/ 8), 930.672: Total exploration time 930.320 sec (930.100 sec minimum, 930.181 sec on average)
pins2lts-mc-linux64( 0/ 8), 930.672: States per second: 7056, Transitions per second: 81057
pins2lts-mc-linux64( 0/ 8), 930.672:
pins2lts-mc-linux64( 0/ 8), 930.672: Progress states detected: 14423778
pins2lts-mc-linux64( 0/ 8), 930.672: Redundant explorations: -56.4092
pins2lts-mc-linux64( 0/ 8), 930.672:
pins2lts-mc-linux64( 0/ 8), 930.672: Queue width: 8B, total height: 13768405, memory: 105.04MB
pins2lts-mc-linux64( 0/ 8), 930.672: Tree memory: 370.9MB, 25.8 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 930.672: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 930.672: Stored 1956 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 930.672: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 930.672: Est. total memory use: 475.9MB (~1129.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14154913615099769988;'/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))))||<>(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14154913615099769988;'/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))))||<>(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 17:22:54] [INFO ] Applying decomposition
[2022-05-20 17:22:54] [INFO ] Flatten gal took : 324 ms
[2022-05-20 17:22:55] [INFO ] Decomposing Gal with order
[2022-05-20 17:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:22:56] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 17:22:56] [INFO ] Flatten gal took : 263 ms
[2022-05-20 17:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1592 labels/synchronizations in 123 ms.
[2022-05-20 17:22:57] [INFO ] Time to serialize gal into /tmp/LTLFireability13624913916804937855.gal : 172 ms
[2022-05-20 17:22:57] [INFO ] Time to serialize properties into /tmp/LTLFireability543748381858122555.ltl : 52 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/LTLFireability13624913916804937855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability543748381858122555.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 3 LTL properties
Checking formula 0 : !((G((X(G(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u301.p1436==0)"))))||(F(X(F("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...509
Formula 0 simplified : !G(XGF"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u301.p1436==0)" | FXF"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....492
Detected timeout of ITS tools.
[2022-05-20 17:45:11] [INFO ] Flatten gal took : 54 ms
[2022-05-20 17:45:12] [INFO ] Input system was already deterministic with 1908 transitions.
[2022-05-20 17:45:12] [INFO ] Transformed 1658 places.
[2022-05-20 17:45:12] [INFO ] Transformed 1908 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 17:45:12] [INFO ] Time to serialize gal into /tmp/LTLFireability13256478017722262573.gal : 6 ms
[2022-05-20 17:45:12] [INFO ] Time to serialize properties into /tmp/LTLFireability16397603099871646961.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/LTLFireability13256478017722262573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16397603099871646961.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...335
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X(G(F("(p1436==0)"))))||(F(X(F("(((p566==1)&&(p610==1))&&(p634==1))")))))))
Formula 0 simplified : !G(XGF"(p1436==0)" | FXF"(((p566==1)&&(p610==1))&&(p634==1))")
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-050B"
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-050B, 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-165286025900860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B 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 ;